1994. Compiler Transformations for High-Perforamce Computing, страница 21
Описание файла
PDF-файл из архива "1994. Compiler Transformations for High-Perforamce Computing", который расположен в категории "". Всё это находится в предмете "конструирование компиляторов" из 7 семестр, которые можно найти в файловом архиве МГУ им. Ломоносова. Не смотря на прямую связь этого архива с МГУ им. Ломоносова, его также можно найти и в других разделах. .
Просмотр PDF-файла онлайн
Текст 21 страницы из PDF
Nicolau,Ed. ResearchMonographsin Paralleland DistributedComputing,MITPress,Cambridge,Mass., Chap. 10.to a formalJ. Supercom-BANERJEE, U. 1979. Speedupof ordinaryprograms,Ph.D. thesis, Tech. Rep. 79-989, ComputerScienceDept.,Univ.of IllinoisatUrbanaChampaign.Scansas primitiveTrans.Comput.HELLER,S.,413parallelC-38,op-11 (Nov.),MCNERNEY,T.,ANDBURKE, M. AND CYTRON, R. 1986. Interproceduraldependenceanalysisandparallelization.InProceedingsof the SIGPLANSymposiumonCompilerConstruction(Palo Alto, Calif., June).SZGPLANNot.21, 7 (July),162-175.Extendedversionavailableas IBMThomasJ.
WatsonResearchCenter Tech. Rep. RC 11794.BURNETT, G. J. AND COFFMAN, E. G., JR. 1970. Astudy of interleavedmemorysystems.In Proceedingsof the SpringJoint AFIPSComputerConference.467-474.vol.36.AFIPS,Montvale,N.J.,BURSTALL, R. M. AND DARLINGTON, J. 1977. A transformationsystem for developingrecursiveprograms.J. ACM24,1 (Jan.),44-67.BUTLER) M., YEH, T., PATT, Y., ALsuP, M., SCALES,H., AND SHEBANOW, M. 1991, Single instructionstream parallelismis greaterthan two.
In Proceedings of the 18th AnnualInternationalSymposiumon ComputerArchitectureOntario,May). SIGARCHComput.19, 3, 276-286.BANERJEE, U. 1988a. DependenceAnalysisfor Supercomputing.KluwerAcademicPublishers,Boston,Mass.BANEKJEE, U. 1988b. An introductiontheoryof dependenceanalysis.put. 2, 2 (Oct.), 133-149.M.,*STEELE, G. L., JR. 1991. Fortranat ten gigaflops:The ConnectionMachineconvolutioncompiler.In Proceedingsof the SIGPLANConference on ProgrammmgLanguageDestgn andImplementation(Toronto,Ontano,June). SIGPLAN Not. 26, 6, 145-156.ANDBALASUNDARAM,V.,KENNEDY,K.,KREMER,U.,MCKINLEY,K., AND SUBHLOK, J.
1989.TheParaScopeeditor:An interactiveparallelprogrammingtool. In Proceedingsof Superconzputmg’89 (Reno, Nev., Nov.). ACM Press, NewYork, 540-550.G, 1989,erations.IEEE1526-1538.Descriptor,9,KREMER, U. 1990. An interactiveenvironmentfor data partitioningand distribution.In Proceedingsof the 5th DlstnbutedMemoryCornputerConference(Charleston,South Carolina,Apr.).IEEEComputerSocietyPress,LosAlamitos,Calif.BALL, J.
E. 1979. PredictingBLELLOCH,pro-TransformationsCALLAHAN, D. AND KENNEDY, K.interproceduralside-effectsgrammingCornput.(Toronto,Arch. Neuw1988a. Analysisofin a parallelpro-environmentJ.5, 5 (Oct.), 517-550.Parall.DistribCALLAHAN, D. AND KENNEDY, K. 1988b. Compihngprogramsfor distributed-memorymultiprocessors. J. Supercompzd.2, 2 (Oct.), 151–169.BANERJEE, U., CHEN, S.
C., KUCK, D. J., AND TOWLE,R. A. 1979. Time and parallelprocessorboundsfor Fortran-likeloops. IEEETrans.Comput.C-28, 9 (Sept.), 660-670.CALLAHAN, D., CARR, S., AND KENNEDY, K. 1990.Improvingregisterallocationfor subscriptedvariables.In Proceedingsof the SIGPLANConference on ProgrammingLanguageDesign andImplementation(WhitePlains,N.Y.,June).BANNING, J. P. 1979. An efficientway to find theside-effectsof procedurecalls and the aliases ofvariables.In ConferenceRecord of the 6th ACMDCALLAHAN,Symposiumon Principlesof Programmingguages(San Antonio,Tex., Jan.). ACM29-41.BERNSTEIN, R.
1986. Multiplicationstants.Softw.Pratt.Exper.641-652.SIGPLANLan Press,by integercon16, 7 (July),BERRY, M., CHEN, D., Koss, P., KUCK, D., Lo, S.,PANG, Y., POINTER, L., ROLOFF, R., SAMEH, A.,CLEMENTI, E , CHIN. S , SCHNEI~ER, D , Fox, G ,ME SSINA,P.,WALKER,D.,HSIUNG,C.,SCHWARZMEIER, J., LUE, K., ORSZAG, S., S~IDL,F., JOHNSON, O., GOODRUM, R., AND MARTIN, J.1989. The PerfectClub benchmarks:Effectiveperformanceevaluationof supercomputers.Znt.J. Supercomput.Appl. 3, 3 (Fall), 5-40.Not.25, 6, 53-65.Estimatingpipelined, COCKE, J., AND KENNEDY, K. 1988.interlockand improvingbalance forarchitecturesJ.Parall.Distrib.Comput.5, 4 (Aug.),334-358.CALLAHAN,D.,COOPER, K.,KENNEDY,K.,ANDTORCZON, L. 1986.Interproceduralconstantpropagation.In Proceedingsof the SIGPLANSympos~umon CompJerConstruction(PaloAlto, Cahf., June).
SIGPLANNot. 21, 7 (July),152-161.CARR, S. 1993.Ph.D. thesis,Memory-hierarchyR]ce Umversity,management.Houston,Tex.CHAITIN, G. J. 1982. Registerallocationvia graph coloring.In ProceedingsPLANSymposiumon Compiler(Boston,Mass., June).SIGPLAN98-105.ACMComputingSurveys,Vol26,Noand spillingof the SIGConstructionNot17, 6,4, December1994414David“F. Baconet al.CFIMTIN, G. J,, AUSLANDER, M. A., CHANDRA, A. K.,COCKE, J., HOPKINS, M.
E., AND MARKSTEIN,P. W. 1981. Registerallocationvia coloring.Comput.Lang.6, 1 (Jan.), 47-57.CHAMBERS, C. .MXD UNGAR, D. 1989. Customization:Optimizingcompilertechnologyfor SELF,adynamically-typedobject-orientedprogramminglanguage.In proceedingsof the SIGPLANConferenceon ProgrammingLanguageDesignandImplementation(Portland,Ore.,June). SIGPLANNot. 24, 7 (July),146-160.CEATTERJEE, S., GILBERT, J. R., AND SCHREIBER, R.1993a.The alignment-distributiongraph.InProceedingsof the 6th InternationalWorkshopon Languagesand Compilersfor ParallelComputing.LectureNotesin ComputerScience,vol. 768.
234–252.CHATTERJEE, S., GILBERT, J. R., SCHREIBER, R., ANDTENG, S.-H. 1993b. Automaticarray alignmentin data-parallelprograms.In ConferenceRecordof the 20th ACMSympo.mumon PrmczplesofProgrammmgLanguages(Charleston,S. Carolina, Jan.). ACM Press, New York, 16–28.CHEN, S. C.
AND KUCK, D. J. 1975.lel processorboundsfor lineartems.IEEE701-717.Trans.Time and paralrecurrencesys-Comput.C-247 (July),CHOI, J.-D., BURKE, M., AND CARINI, P. 1993. Efficientflow-sensitiveinterproceduralcomputation of pointer-inducedaliases and side effects.In ConferenceRecord of the 20th ACM Symposium on Principlesof ProgrammingLanguages(Charleston,New York,S. Carolina,232-245.Jan.).ACMPress,CHOW, FC1988.Minimizingregisterusagepenaltyat procedurecalls. In Proceedingsofthe SIGPLANConferenceon ProgrammingLanguageDesign and Implementation(Atlanta,Ga., June).SIGPLANNot.CHOW, F.
C. AND HENNESSEY,ity-basedcoloringtion. ACM Trans.(Oct.),23, 7 (July),J. L. 1990.approachProgram.85-94.Theprior-to registerallocaLang.Syst. 12, 4501-536.CLARKR, C. D. AND PEYTON-JONES, S. L. 1985. Strictness analysis—apracticalapproach.In Functional ProgrammingLanguagesand ComputerArchitecture.LectureNotes in ComputerScience, vol.
201. Springer-Verlag,Berlin,35–49.CLINGER, W. D. 1990How to read floatingpointnumbersaccurately.In proceedingsof the SIGPLANConferenceon ProgrammmgLanguageDeslognandImplementation(WhitePlains,NY., June). SIGPLANNot. 25, 6, 92-101.COCKE, J. 1970. Global common subexpressionelimination.In proceedingsof the ACM Symposmmon CompderOptLmizatzon(July).SIGPLANNot. 5, 7, 20–24.COCKR, J.
AND MARKSTEIN, P. 1980. Measurementofprogramimprovementalgorithms.In Proceedings of the IFIP Congress(Tokyo, Japan,Oct.).North-Holland,Amsterdam,Netherlands,ACMComputmgSurveys,Vol.26,No.4, December1994221-228.Also available8111, Feb. 1980.as IBMTechRep. RCCOCKE, J. AND SCHWARTZ, J. T. 1970. Programminglanguagesandtheircompders(preliminarynotes). 2nd ed. CourantInst. of MathemalzcalSciences, New York Umverslty,New York.COLWELL,R. P,, NIX,R, P,, ODONNEL,J. J.,PAPWORTH, D. B., AND RODMAN, P, K. 1988.
AVLIWarchitecturefor a trace schedulingcompiler.IEEETrans.Comput.C-37,8 (Aug.),967-979.COOPER, K, D, AND KENNEDY, K, 1989, Fast interproceduralahas analysie,In ConferenceRecordof the 16th ACMSymposmmon Prmc~plesofProgrammmgLanguages(Austin,Tex., Jan.).ACM Press, New York, 49-59.COOPER, K, D., HALL, M. W,, AND KENNEDY, K. 1993.A methodologyfor procedurecloning.Comput.Lang.19, 2 (Apr.), 105-117.COOPER, K. D., HALL, M. W., AND TORCZON, L. 1992.Unexpectedside effects of inlinesubstitutionA case study. ACM Lett. Program.Lang.Syst1, 1 (Mar.),22-32.COOPER, K D., HALL, M. W., AND TORCZON, L 1991.An experimentwith inlinesubstitution.SoftwPratt.Exper. 21, 6 (June),581-601CRAY RESEARCH 1988CFT77ReferenceManual.PublicationSR-0018-C.CrayResearch,Inc..Eagan, Minn.1986.
Doacross:Beyondvectorizatlonfor multiprocessors.In Proceedingsof the InternationalConferenceon ParallelProcessing(St.Charles,Ill., Aug.).IEEEComputerSociety,Washington,D. C., 836-844.CYTRON, R.CYTRON, R. AND FERRANTE, J. 1987. What’sin aname?-or- the valueof renamingfor parallehsmdetectionand storageallocation.Proceedingsof the Internat~onalConferenceonParallelProcewng(UniversityPark,Penn.,Aug.),PennsylvaniaStateUniversityPress,UniversityPark.Pa.,19-27.DANTZIG, G.
B. AND EAVES, B. C. 1974. FourierMotzkinehminationand sits dual with application to integerprogramming.In CombinatorialProgramming:MethodsandApplications(Versailles,France,Sept.). B. D. Roy,Reidel, Boston,Mass., 93-102.DENNIS,JComputerB1980Data13, 11 (Nov.),flowEd.D.supercomputers48-56.DIXIT, K. M. 1992.
NewCPUbenchmarksfromSPEC. In Digest of Papers,SpringCOMPCON1992,37thIEEEComputerSocietyInternationalConference(San Francisco,Calif., Feb.).IEEEComputerSocietyPress, Los Alamitos,Calif., 305-310DONGARRA, J. AND HIND, A. R. 1979. Unrollingloopsm Fortran.Softzo, Pratt.Exper.9, 3 (Mar.),219-226.EGGERS, S.
