1994. Compiler Transformations for High-Perforamce Computing, страница 23
Описание файла
PDF-файл из архива "1994. Compiler Transformations for High-Perforamce Computing", который расположен в категории "". Всё это находится в предмете "конструирование компиляторов" из 7 семестр, которые можно найти в файловом архиве МГУ им. Ломоносова. Не смотря на прямую связь этого архива с МГУ им. Ломоносова, его также можно найти и в других разделах. .
Просмотр PDF-файла онлайн
Текст 23 страницы из PDF
26, 4, 63–74.LAMPORT,loops.L. 1974Commun.The parallelexecutionof DOACM 17, 2 (Feb.), 83-93.LANDI, W., RYDER, B. G., AND ZHANG, S. 1993. Interproceduralmodificationside effectanalysiswithpointerabasing.In Proceedingsof theSIGPLANConferenceon ProgrammmgLanguageDesignandImplementation(Albuquerque,New Mexico, June), SZGPLANNot.28, 6, 56-67,LARUS, J.mericParall.R.
1993Loop-levelparallelismin nuand symbolicprograms.IEEETrans.Dwtrtb.Syst 4, 7 (July),812-826.CompilerLEE,LI,G., KRUSKAL, C. P., AND KUCK, D. J. 1985. Anempiricalstudyof automaticrestructuringofnonnumericalprogramsfor parallelprocessors.IEEETrans. Comput.C-34, 10 (Oct.), 927-933.Z. 1992. Arrayprivatizationtion of loops. In ProceedingsnationalConferenceon(Washington,York, 313-322.LI,D.
C.,July).for parallelexecuof the ACM InterSupercomputmgACMPress,NewJ. AND CHEN, M. 1991. Compilingcommunication-eftlcientprogramsfor massivelyparallelmachines.IEEETrans.Parall.Distrib.Syst.2, 3 (July),361-376.LI, J. AND CHEN, M. 1990.Indexdomainalignment:Minimizingcost of cross-referencingbetweendistributedarrays.In The 3rd Symposiumonthe Frontiersof MassivelyParallelComputation, J.
Jaja, Ed. IEEE ComputerSociety Press,Los Alamitos,Calif., 424-433.LI,Z. AND YEW, P. 1988. Interproceduralanalysisfor parallelcomputing.In Proceedingsof theInternationalConferenceon ParallelProcessing. F. A. Briggs, Ed. Vol. 2. PennsylvaniaStateUniversityPress,UniversityPark,Pa.,221-228.LI, Z., YEW, P., AND ZHU, C. 1990. Data dependenceanalysison multi-dimensionalarrayreferences. IEEETrans.Parall.D~str~b. Syst. 1, 1(Jan.),LOVRMAN,26-34.D.B.1977.source-to-source(Jan.), 121-145.ProgramimprovementbyJ. ACM1, 24transformation.Lucco,S. 1992. A dynamicschedulingmethodforirregularparallelprograms.In Proceedingsofthe SIGPLANConferenceon ProgrammingLanguageDesignandImplementation(SanFrancisco,Calif.,June).SIGPLANNot.
27, 7(July),200-211.MACE, M, E, 1987, MemoryStoragePatternsmParallelProcessing.KluwerAcademicPublishers, Norwell,Mass.MACE,M.E.AND WAGNER,R.A.1985.Globallyoptimumselectionof memorystorage patterns.In Proceedingsof the InternationalConferenceon ParallelComputerProcessing,D. DeGrott,Ed. IEEESociety, Washington,D. C., 264-271.MARKSTEIN, P., MARKSTEIN, V., AND ZADECK, K.
1994.Strengthreduction.In Optimizationin t30mpders. ACMPress,New York,Chap.9 To bepublished.MASSALIN,H.1987.Superoptimizer:A lookat thesmallestprogram.In Proceedingsof the 2ndInternationalConferenceon ArchitecturalSupport for ProgrammmgLanguagesand Operating Systems (Palo Alto, Calif., Oct.). SIGPLANNot. 22, 10, 122-126.MAYDAN, D. E., AMAMSINGHE,S. P., AND LAM, M. S.1993. Arraydata flow analysisand its use inarray privatization.In ConferenceRecord of the20th ACMSympostumon Principlesof ProgrammingLanguages(Charleston,S. Carolina,Jan.). ACM Press, New York, 1-15.Transformations417●MAYDAN, D.
E., HENNESSEY, J. L., AND LAM, M. S.1991.Efficientandexactdatadependenceanalysis.In Proceedingsof the SIGPLANConference on ProgrammingLanguageDesign andImplementation(Toronto,Ontario,June). SIGPLAN Not. 26, 6, 1-14.MCFARLING,S. 1991. Proceduremergingwithinstructioncaches.In Proceedingsof the SIGPLANConferenceon ProgrammingLanguageDesign and Implementation(Toronto,Ontario,June). SIGPLANNot. 26, 6, 71-79.MCGRAW, J. R. 1985.
SISAL:Streamsand iterationin a singleassignmentlanguage.Tech. Rep.M-146,LawrenceLivermoreNationalLaboratory,Livermore,Calif.MCMAHON, 1?. M. 1986. The LivermoreFortrankernels: A computertest of numericalperformancerange. Tech. Rep. UCRL-55745,LawrenceLivermoreMICHIE, D.learning.NationalLaboratory,1968. “Memo”Nature218,Livermore,functions19-22.MILLSTEIN,R. E. AND MUNTZ, C. A.LIAC-IVFortrancompiler.InandCalif.machine1975. The ILProgrammingLanguagesand Compilersfor Paralleland Vector Machines(NewYork,N.Y.,Mar).SIGPLAN Not. 10, 3, 1-8.MIRCHANDANEY, R., SALTZ, J. H., SMITH, R.
M., NICOL,D. M., AND CROWLEY, K. 1988. Principlesofruntimesupportfor parallelprocessors.In Proceedingsof the ACM InternationalConferenceon Supercomputing(St. Male,France,July).ACM Press, New York, 140-152.MOREL, E. AND RENVOME, C. 1979. Global optimizationby suppressionof partialredundancies.Commun.ACM 22, 2 (Feb.), 96-103.MUCHNICK, S. S. AND JONES, N., (EDs.)gram Flow Analysis.Prentice-Hall,Cliffs,1981.
ProEnglewoodN.J.MURAOKA, Y. 1971. Parallelismexposureand exploitationin programs.Ph.D. thesis, Tech. Rep.71-424, Univ. of Illinoisat Urbana-Champaign.MYERS, E. W. 1981. A precise interproceduraldataflow algorithm.In ConferenceRecord of the 8thACMSymposiumon Principlesof ProgrammingLanguages(Williamsburg,Vs.,Jan.).ACM Press, New York, 219-230.NICOLAU, A. 1988.
Loop quantization:loop unwindingtechnique.J.Comput.5, 5 (Oct.), 568-586.A generalizedParallDistrib.NICOLAU, A. AND FISHER, J. A. 1984. Measuringtheparallelismavailablefor very long instructionword architectures.IEEE Trans. Comput.C-33,11 (Nov.), 968-976.NIKHIL,R. S. 1988. ID referencemanual,version88.0.
Tech. Rep. 284, Laboratoryfor ComputerScience,MassachusettsInstztuteof Technology, Cambridge,Mass.NOBAYASHL H. AND EOYANG, C. 1989. A comparisonstudyof automaticallyvectorizingFortrancompilers.In Proceedingsof SupercomputingACMComputingSurveys,Vol. 26, No 4, December1994418*David’89 (Reno,820-825Nev.,F. BaconNov.),ACMet al.Press,NewYork,Proceedingsof the InternationalParallelProcessing.VolumeOBRIEN,K., HAY, B., MINISH,J., SCHAFFER, H ,SCHLOSS, B., SHEPHERD, A., AND ZALESKI, M.1990Advancedcompilertechnologyfor theRISC System/6000architecture.In IBM RISCSystem/6000Technology.PublicationSA232619.
IBM Corporation,Mechanicsburg,PennOED,W. 1992. Cray Y-MPC90:and early benchmarkresults.18, 8 (Aug.), 947-954.SystemParall.featuresComput.OEHLER, R. R. AND BLASGEN, M, W. 1991. IBMSystem/6000:IEEE MicroArchitecture11, 3 (June),and14-24,performance.PADUA, D. A. AND PETERSEN, P. M. 1992of parallelizingcompilers.ParallelandTransputerAppllcatlons,Spain,Sept ) CIMNE,1505-1514.able as Centerfor Supercomputingand DevelopmentTech Rep. 1173.PADUA, D.
A,compilerCommun.ACMPADUA, D. A.,High-speedtechniques(Sept.),AND WOLFE,optlmlzations29,M.RISCTrans.C-29,9763-776.PETERSEN, P. M. AND PADUA, DA1993Staticanddynamicevaluationof data dependenceanalYsis. In Proceedingsof the ACMInternationalConferenceon Supercomputmg(Tokyo,Japan,July). ACM Press, New York, 107-116.PETTIS, K, AND HANSEN,R.
C, 1990.Profileguidedcode posltionmg.In Proceedingsof the SIGPLANConferenceon ProgrammmgLanguageDes~gnandImplementation(WhtePlains,NY., June). SIGPLANNot. 25, 6, 16-27.POLYCHRONOPOULOS, C. D. 1988. ParallelProgrammingand Compilers.KluwerAcademicPublishers,Boston, Mass.POLYCHRONOPOULOS, C D1987aAdvancedloopoptlmlzationsfor parallelcomputersIn Proceedings of the Ist InternationalConferenceonSupercomputmg.LectureNotesin Computer297Springer-Verlag,Berlin,Science,vol255-277.POLYCHRONOPOULOS, C. D.
1987b, LOOP coalescing:A compilertransformationfor parallelmachines,InProceedingsof the InternationalConferenceon ParallelProcessing(UmversltyPark, Penn., Aug.). PennsylvaniaState University Press, UniversityPark, Pa., 235–242.POLYCHRONOPOULOS, C. D. AND KUCK, D. J. 1987.Guidedself-scheduling:A practicalscheduhngschemeforparallelsupercomputers.IEEETrans. Comput.C-36, 12 (Dec.), 1425-1439,POLYCHRONOPOULOS, C. D., GIRKAR, M., HAGHIGHAT,M.
R., LEE, C. L., LEUNG, B., AND SCHOUTEN, D.1989. Parafrase-2:An environmentfor paralIelizing,partitioning,synchronizing,andschedulingprogramson multiprocessors.InACMComputmgSurveys,Vol. 26, No 4, DecemberPUGH, W. 1992. A practicalarray dependenceanalysls8 (Aug.), 102-115,RAU,1184-1201.Comput.UmversityPark,Pa.,PRESBERG, D. L. AND JOHNSON, N. W. 1975TheParalyzer:IVTRAN’Sparallehsrnanalyzerandsynthesizer,In ProgrammmgLanguagesandCompdersfor ParallelandVectorMachines(New York, NY.,Mar.).SIGPLANNot. 10, 3,9-16.tional ConferenceGermany,June).(Barcelona,Also availResearchKUCK, D.
J. AND LAWRIE, D. 1980.multiprocessorsandcompilationIEEEPress,algorithmCommun.for exactACM 35,PUGH, W. 1991, Umformtechniquesfor loop optimization,In proceedingsof the ACM Interna-EvaluationComputingJ. 1986. Advancedforsupercomputers.12 (Dec.),State Umverslty39-48.Conferenceon2, Pennsylvania1994on SupercomputmgACM Press, New(Cologne,York.B.
AND FISHER, J. A. 1993. InstructIon-levelparallelprocessing:History,overview,and perspectwe,J. Supercomput.7, 1/2 (May), 9–50RAU, B., YEN, D. W. L., YEN, W., AND TOWI,E, R. A.1989. The Cydra5 departmentalsupercomputer:Designphdosophies,decisions,andtrade-offs,Computer22, 1 (Jan,), 12-34.REES, J., CLINGER, W, ET AL. 1986 Revised3on thealgorithmiclanguageScheme.PLAN Not 21, 12 (Dee), 37-79.reportSIG-RISEMAN, E. M, AND FOSTER, C. C, 1972, The mhlbltionof potentialparallehsrnby conditionaljumps.IEEETrans,Comput,C-21, 12 (Dec.),1405-1411.ROGERS, A.
M, 1991. Compilingfor localityof reference. Ph.D. thesis, Tech Rep. TR 91-1195,Dept.of ComputerScience, CornellUniversityRUSSELL, R. M. 1978. The CRAY-1computertem. Commun.ACM 21, 1 (Jan.), 63–72,sys-SABOT, G. AND WHOLEY, S. 1993 CMAX:A Fortrantranslatorfor the ConnectIonMachinesystem.In proceedingsof the ACM InternationalConferenceon Supercomputmg(Tokyo,Japan,July). ACM Press, New York.SARKAR, V. 1989.
