1994. Compiler Transformations for High-Perforamce Computing, страница 22
Описание файла
PDF-файл из архива "1994. Compiler Transformations for High-Perforamce Computing", который расположен в категории "". Всё это находится в предмете "конструирование компиляторов" из 7 семестр, которые можно найти в файловом архиве МГУ им. Ломоносова. Не смотря на прямую связь этого архива с МГУ им. Ломоносова, его также можно найти и в других разделах. .
Просмотр PDF-файла онлайн
Текст 22 страницы из PDF
J. AND KATZ, R. H. 1989 Evaluatingtheperformanceof four snoopingcache coherencyprotocols.In proceedingsof the 16th AnnualCompilerInternationaltectureComput.SymposmmonComputerArchi-(Jerusalem,Israel,May).SZGARCHArch. News 17, 3 (June), 2-15.EIGENMANN, R,, HOEFLINGER, J., LI, Z,, AND PADUA,D, A. 1991, Experiencein the automaticparallelizationof four Perfect-benchmarkprograms.In Proceedingsof the 4th InternationalWorkshop on Languagesand Compdersfor ParallelComputing.LectureNotesin ComputerScience, vol.
589. Springer-Verlag,Berlin,65–83.Also availableas Tech. Rep. 1193, CenterforSupercomputingResearchand Development,ELLIS, J. R. 1986. Bulldog:A Compilerfor VLIWArchitectures.ACMDoctoralDissertationAward.MIT Press, Cambridge,Mass.ERSHOV, A.P.1966.ALPHA-angrammingsystem13, 1 (Jan.), 17-24.FEAUTRIER,scalarof highP. 1991. Dataflowreferences.1 (Feb.),Int.automaticefficiency.analysisJ. Parall.FERRARI, D,behavior.1976, The improvementComputer9, 11 (Nov.),FISHER, J.A. 1981. Trace schedulingfor global microcodecompaction.Comput.C-30, 7 (July), 478-490.FISHER, J. A., ELLIS,of program39-47.A techniqueIEEETrans.J.
R., RUTTENBERG,J. C., ANDNICOLAU, A. 1984. ParallelprocessingA smartcompilerand a dumb machine.In Proceedingsof the SIGPLANSymposiumstruction(Montreal,Quebec,Not. 19, 6, 37-47.on CompilerConJune).SIGPLANFLOATING POINT SYSTEMS. 1979. FPScessor Handbook.FloatingPointBeaverton,Ore.AP-120BSystems,FREE SOFTWARE FOUNDATION. 1992. gcc 2,xence Manual.Free SoftwareFoundation,bridge,compiler.In Proceedingsof the SIGPLANConference on ProgrammingLanguageDesign andImplementation(San Francisco,Calif.,June).SZGPLANNot.
27, 7 (July),341-352.GUPTA,M.1992.Automaticdatapartitioningdistributedmemorymulticomputers.sis, Tech. Rep. UILU-ENG-92-2237,Illinoisat Urbana-Champaign.onPh.D. theUniv.ofGUPTA, M., MIDKIE-F, S., SCHONBERG, E., SWEENEY,P., WANG, K. Y., AND BURRE, M. 1993. PTRANII: A compilerfor High PerformanceFortran.In Proceedingsof the 4th InternationalWorkshopon CompilersforParallelComputers(Delft,Netherlands,Dec.).
479-493.HALL, M. W., KENNEDY, K., AND MCKINLEY,K. S.1991. Interproceduraltransformationsfor parallel code generation.In Proceedingsof Supercomputing’91 (Albuquerque,NewMexico,Nov.). IEEE ComputerSociety Press, os Alamitos, Calif., 424-434.ProInc.,HARRIS, K. AND HOBBS, S.1994.VAX Fortran.InOptimizationin Compders,F. E. Allen,R.Cytron,B.
K. Rosen, and K. Zadeck, Eds. ACMPress, New York, chap. 16. To be published,ReferCam-HATFIELD, D. J. AND GERALD, J. 1971. Programrestructuringfor virtualmemory,IBMSyst. J.10, 3, 168-192,Mass.FREUDENEERGER, S. M., SCHWARTZ, J. T., AND SHARIR,M. 1983. Experiencewith the SETL optimizer.ACM Trans.Program.Lang.Syst. 5, 1 (Jan.),26-45.GANNON, D., JALBY, W., AND GALLIVAN,K. 1988.Strategiesfor cache and local memorymanagementby globalprogramtransformation,J.Parall.Distr~b. Comput.5, 5 (Oct.), 587-616.GERNDT, M. 1990. Updatingdistributedlocal computations.Concurrency2, 3 (Sept.), 171-193.Washington,GRANLUND, T.
AND KENNER, R. 1992. Eliminatingbranchesusing a superoptimizerand the GNU23-52.FEAUTRIER, P. 1988. Arrayexpansion.In Proceedings of the ACMInternationalConferenceonSupercomputing(St. Malo, France, July), ACMPress, New York, 429-441.Society,GRAHAM, S. L., LUCCO, S., AND SHARP, O. J. 1993.Orchestratinginteractionsamong parallelcomputations,InProceedingsof the SIGPLANConferenceon ProgrammingLanguageDesignand Implementation(Albuquerque,New Mexico, June), SZGPLANNot. 28, 6, 100-111.and20,Computer415●GOFF, G,, KENNEDY, K,, AND TSENG, C.-W.1991.Practicaldependencetesting.In Proceedingsofthe SIGPLANConferenceon ProgrammingLanguageDesign and Implementat~on(Toronto,Ontario,June).
SIGPLANNot, 26, 6, 15-29,ACMof arrayProgram.Nov.).IEEED. C,, 164-173.pro-J.TransformationsHENNESSY, J. L, AND PATTERSON, D. A. 1990. ComputerArchitecture:A QuantitativeApproach.MorganKaufmannPublishers,SanMateo,Calif,HEWLETT-PACKARD.1992. PA-RZSC1.1 Architectureand InstructionManual.2nd ed. Part Number09740-90039.Hewlett-Packard,Palo Alto, Calif.HIGHvariablesinPratt.Ilxper.GIBSON, D. H. AND RAO, G. S.
1992. Designof theIBM System/390computerfamilyfor numericallyintensiveapplications:An overviewforengineersand scientists.IBM J. Res. Dev. 36,4 (July),695-711.GIRKAR, M. AND POLYCHRONOPOULOS, C. D. 1988.Compilingissues for supercomputers.In Proceedings of Supercomputing’88 (Orlando,Fla.,PERFORMANCE FORTRAN FORUM. 1993. HighPerformanceFortranlanguagespecification,version1.0. Tech. Rep. CRPC-TR92225,RiceUniversity,Houston,Tex.HIRANANDAM,S., KENNEDY, K., AND TSENG, C.-W.1993.PreliminaryexperienceswiththeFortranD compiler.In Proceedmg.sof Supercomputing’93 (Portland,Ore.,Nov.).IEEEComputerSocietyPress, Los Alamitos,CaIif.,338-350.HIRANANDANL S., KRNNEDY, K., AND TSENG,1992.CompilingFortranD for MIMDACMComputingSurveys,Vol. 26, No.
4, DecemberC.-W.dis-1994416David*tributed-memory8 (Aug.), 66-80.F. Baconmachines.et al,Commun.ACM35,HUDAK, P. AND GOLDBERG, B. 1985. Distributedexecution of functionalprogramsusing serial combinatorsIEEETrans. Comput.C-34, 10 (Ott),881-890.HWU, W. W. AND CHANG, P.
P. 1989 Achievinghighinstructioncache performancewith an optimizing compiler.In Proceedingsof the 16th Ann ual InternationalSymposiumon ComputerArchitecture(Jerusalem,Israel,May)SIGARCH242-251.Hwu,IBMIBM.Comput.Arch.News17,3 (June),W. W., MAHLKE, S. A., CHEN, W. Y., CHANG,P. P., WARTER,N. J., BRINGMANN,R. A.,OUELLETTE, R. G., HANK, R.
E., KIYOHARA, T.,HAAO, G E., HOLM, J, G., AND LAVERY, D M1993. The superblock:An effectivetechniquefor VLIWand superscalarcompilation.J. Su percomput7, 1/2 (May), 229-2481992 OptimizationXL Fortranand XLcation SC09-1545-00,1991IBMRISCand TuningGuide for theC Compilers.1st ed. PubliIBM, Armonk,N.Y.System/6000Guide for Fortranand3611-01,IBM, Armonk,NICC PublicationNY.TuningGG24-IRIGOIN, F. AND TRIOLET, R. 1988.
SupernodepartitioningIn ConferenceRecord of the 15th ACMSymposiumon Principlesof ProgrammingLan guages(San Diego,Calif.,Jan)ACMPress,New York, 319-329IVERSON,JohnK. E. 1962. A F’rogrammzngWiley and Sons, New York.LanguageKENNEDY, K. AND MCKINLEY,K. S. 1990 Loop distributionwitharbitrarycontrolflowIn Proceedingsof Supercomputing’90 (NewYork,N.Y, Nov.
) IEEE ComputerSociety Press, LosAlamitos,Calif., 407-416KENNEDY, K., MCKTNLEY, K. S., AND TSENG, C.-W.1993. Analysisand transformationin an interactive parallelprogrammingtool ConcurrencyPratt.Exper5, 7 (Oct.), 575-602.KILDALL, G. 1973. A unifiedapproachgram optimizationIn ConferenceACMSympostumon PrmclplesmmgLanguages(Boston,MassPress, New York, 194–206.to global proRecord of theof Program, Oct.). ACMKNOBE, K.
AND NATARAJAN, V. 1993. Automaticdataallocationto minimizecommunicationon SIMDmachmes.J. Supercomput.7, 4 (Dec.), 387–415.KNOBE, K., LUKAS, J, D., AND STEELE, G. L., JR.1990, Data optimlzatlon:Allocationof arrays toreducecommunicationon SIMDmachmes.J.ParallDistrib,Comput.8, 2 (Feb.), 102-118.KNOBE, K., LUKAS, J D., AND STEELE, G. L., JR1988. Massivelyparalleldata optimization,InThe 2nd. Symposiumon the Frontiersof Massiuely ParallelComputation(Fairfax,Vs., Oct.).IEEE,Piscataway,N.J., 551-558.KNUTH,ACMD. E.
1971.ComputmgAnSurveys,empiricalVolstudyof Fortran26, No 4, December1994programs.105-133.Soflw.Pratt.Exper.KOELBEL,C 1990. Compilingshared memorymachinesUniversity,West Lafayette,1,2 (Apr.-June),programsfor nonPh D thesis, PurdueInd.KOELBEL,C AND MEHROTRA, P. 1991Compilingglobal name-spaceparallelloops for distributedexecution.IEEETrans.ParallDlstnb.Syst.2, 4 (Oct.), 440-451KRANZ, D., KELSE~, R., REES, J., HUDAK, P., PHILBIN,J , AND ADAMS, N. 1986.
ORBIT:An optimizingcompilerfor Scheme.SIGPLANSymposmmtion (Palo Alto,Calif,21, 7 (July),219-233Kuc~,D. J. 1978.ComputationsNew York.KUCK,D.J.1977.In Proceedingsof theon CompderConstrucJune).SIGPLANNotThe StructureVol. 1. JohnAsurveyof ComputersWdeyandof parallelorgamzationand programming.Suru. 9, 1 (Mar.), 29-59.KUCK,D.
J, AND STOKES, R, 1982.SclentiticProcessorput, C-31, 5 (May),KUCK,D. J., KUHN,(BSP).363-376.ACMTheIEEEandSons,machineComput.BurroughsTrans.Com-R. H,, PADUA, D,, LEASURE,B,,AND WOLFE, M. 1981, Dependencegraphsandcompileroptimizatlons,In ConferenceRecord ofthe 8th ACM Svmposlumon Prmctplesof ProgrammmgLanguages(Williamsburg,Vs., Jan,).ACM Press, New York, 207-218.LAM, M S 1988.
Softwarepipelining:An effectiveschedulingtechniquefor VLIWmachinesInProceedingsof the SIGPLANConferenceonProgrammingLanguageDesign and Implementation(Atlanta,Ga., June). SIGPLANNot. 23,7 (July),318-328LAM, M. S AND WILSON, R P 1992. Limitsof control flow on parallelismIn Proceedingsof the19thAnnualInternationalSymposiumonComputerArchitecture(Gold Coast, Australia,May).SIGARCHComputArchNews 20, 2,46-57LAM, M, S., ROTHBERG, E. E., AND WOLF, M. E. 1991.The cache performanceand optlmlzatlonofblockedalgorithms.In Proceedingsof the 4thInternationalConferenceon ArchitecturalSupportfor ProgrammmgLanguagesand OperatingSystems(SantaClara,Cahf,,Apr.).SIGPLANNot.
