Главная » Все файлы » Просмотр файлов из архивов » PDF-файлы » 1994. Compiler Transformations for High-Perforamce Computing

1994. Compiler Transformations for High-Perforamce Computing, страница 24

PDF-файл 1994. Compiler Transformations for High-Perforamce Computing, страница 24, который располагается в категории "статьи" в предмете "конструирование компиляторов" изседьмого семестра. 1994. Compiler Transformations for High-Perforamce Computing, страница 24 - СтудИзба 2019-09-18 СтудИзба

Описание файла

PDF-файл из архива "1994. Compiler Transformations for High-Perforamce Computing", который расположен в категории "статьи". Всё это находится в предмете "конструирование компиляторов" из седьмого семестра, которые можно найти в файловом архиве МГУ им. Ломоносова. Не смотря на прямую связь этого архива с МГУ им. Ломоносова, его также можно найти и в других разделах. .

Просмотр PDF-файла онлайн

Текст 24 страницы из PDF

Partitioningand SchedulingParallelProgramsfor Multiprocessors.ResearchMonographsin Paralleland DistributedComputing.MIT Press, Cambridge,MassSARKAR, V. AND THEKKATH,R. 1992. A generalframeworkfor Iteration-reorderingtransformations. In Proceedingsof the SIGPLANConference on ProgrammingLanguageDesignandImplementation(San Francisco,Calif.,June).SIGPLANNot. 27, 7 (July),175-187,SCHEIFLER, R. W.

1977. An analysisof inline substitutionfor a structuredprogramminglanguage.Commun.ACM 20, 9 (Sept.), 647-654.SHEN, Z , LI, Z., AND YEW, P -C. 1990. An empiricalstudyof Fortranprogramsfor parallelizingcompilers.IEEETrans.Parall.Distrib.Syst,1, 3 (July),356-364.CompilerSINGH, J. P. AND HENNESSY, J. L. 1991. An empiricalinvestigationof the effectivenessand limitations of automaticparallelization.In Proceedings of the InternationalMemorySymposiumMultiprocessing,SINGH, J.

P., WEBER,SPLASH:(Apr.),W.-D.,StanfordTu,on Sharedforsharedmemory.SZGARCHC’omput.Arch,News20, 1 (Mar.),5-44.Also availableasStanfordUniv. Tech. Rep. CSL-TR-92-526.SITES, R. L., (ED.) 1992.ence Manual.DigitalAlphaPress,ArchitectureReferBedford,Mass.SOHI, G. S. AND VAJAPAYEM, S. 1990. Instructionissue logic for high-performance,interruptable,multiplefunctionalunit,pipelinedcomputers.IEEETrans. Comput.C-39, 3 (Mar.),349-359.STEELE, G. L., JR.

1977. Arithmeticered harmful,SIGPLANNot.61-69.schemes(June),SUN1990.forA surveyof cachemultiprocessors.coherenceComputer612-24.MICROSYSTEMS.1991.Manual,Version8. PartMicrosystems,MountainSPARCArchitectureNo. 800-1399-08.SunView, Calif.f?IZYMANSHI, T. G. 1978.

Assemblingcodechines with span-dependentinstructions.mum. ACM 21, 4 (Apr.), 300–308.TANG, P, AND YEW, P,self-schedulingforloops,IEEETrans.919-929.THINKING23,MACHINES.formaCorn-1990. DynamicproceesorgeneralparallelneetedComput.C-39,7 (July),ConnectionMachine,ModelCM-2TechnicalSummary.MachinesCorp., Cambridge,Mass.1989.ThinkingTJADEN, G. S. AND FLYNN, M. J. 1970. Detectionandparallelexecutionof parallelinstructions.IEEETrans. Comput.C-19, 10 (Oct.), 889-895.TORRELLAS, J., LAM, H. S., AND HENNESSY, J. L.1994.

False sharingand spatial localityin multiprocessorcaches. IEEETrans. Comput.43, 6(June),D.InA,Rice1993,ProceedingsUniversity,Automaticarrayof theInter-6thVON HANXLEDEN, R. AND KENNEDY, K. 1992. Relaxing SIMDcontrolflow constraintsusinglooptransformations.In Proceedingsof the SIGPLANConferenceon ProgrammingLanguageDesignandImplementation(SanFrancisco,Calif.,June).SIGPLANNot.27,7 (July),188-199.(SantaClara,4, 176-188.toInProceedingsof the SIGPLANConferenceonProgrammingLanguageDesign and Implementation(WhitePlains,N.Y., June).SIGPLANNot, 25, 6, 112-126.STENSTROM, P.Dept.,WALL, D. W. 1991.

Limitsof instruction-levelparallelism.In Proceedingsof the 4th InterncutonalConferenceon Arch~tecturalSupportfor ProgrammingLanguagesand OperatingSystemsshiftingconsid12, 11 (Nov.),STEELE, G, L., JR, AND WHITE, J, L. 1990. Howprintfloating-pointnumbersaccurately,P, AND ~ADUA,419●nationalWorkshopon Languagesand Compders for ParallelComputing.LectureNotes inComputerScience,vol. 768. Springer-Verlag,Berlin,500-521.1992.applicationsScienceTex.privatization.213-240.AND GUPTA, A.parallelComputerHouston,Transformations651-663.TOWLE, R.

A. 1976, Controland data dependenceforprogramtransformations.Ph.D.thesis,Tech. Rep. 76-788,ComputerScienceDept.,Univ. of Illinoisat Urbana-Champaign.TRIOLET, R., IRIGOIN, F., AND FEAUTRIER, P. 1986.Directparallelizationof callstatements.InProceedingsof the SIGPLANSymposiumonCompderConstruction(Palo Alto, Calif., June).SIGPLANNot. 21, 7 (July),176-185.TSENG, C.-W. 1993. An optimizingFortranD compiler for MIMDdistributed-memorymachines.Ph.D. thesis, Tech.

Rep. Rice COMP TR93-199,Calif.,Apr.).SIGPLANNot.26,WANG, K. 1991. Intelligentprogramoptimizationandparallelizationforparallelcomputers.Ph.D. thesis,Tech. Rep. CSD-TR-91-030,Purdue University,West Lafayette,Ind.WANG, K. AND GANNON, D. 1989. ApplyingAl techniquesto programoptimizationfor parallelcomputers.In ParallelProcessingfor Supercomputersand Art~fictalIntelligence,K. Hwangand D. Llegroot,Eds. McGrawHill, New York,Chap.

12,WEDEL, D. 1975. Fortranfor the Texas InstrumentsASC system. In ProgrammmgLanguagesandCompilersfor ParallelandVectorMachines(New York,119-132.N.Y.,Mar.).SZGPLANNot.10, 3,WEGMAN, M. N. AND ZADECK, F. K. 1991. Constantpropagationwithconditionalbranches,ACMTrans.Program.181-210,Lang.Syst.13,2(Apr.),WEISS, M. 1991. Stripminingon SIMDarchitectures.

In Proceedingsof the ACM InternationalConferenceon Supercomputtng(Cologne,Germany, June). ACM Press, New York, 234–243.WHOLEY, S. 1992. Automaticdata mappingfor distributed-memoryparallelcomputers.In Proceedingsof the ACM InternationalConferenceon Supercomputing(Washington,D. C., July).ACM Pressj New York, 25–34.WOLF, M. E. 1992.

Improvinglocalityand parallelismin nested loops. Ph.D. thesis,ComputerScienceDept.,StanfordUniversity,Stanford,Calif.WOLFE, M. J. 1989a. More iterationspace tiling.InProceedingsof Supercomputing’89 (Reno, Nev.,Nov.). ACM Press, New York, 655–664.WOLFE, M. J. 1989b. OptLmLzmgSupercompdersforSupercomputers.ResearchMonographsin Parallel and DistributedComputing.MITPress,Cambridge,Mass.ACMComputingSurveys,Vol26, No.

4, December1994420eDavidF.BaconetalWOLI, M, E, AND LAM, M, S. 1991, A loop transformationtheoryand an algorlthmto maxlmlzeparallelism.IEEETrans. Parall,Dlstrlb.Syst.2, 4 (Oct.), 452-471,WOLFE, M J ANI) TSEN~, C 1992 The Powerfor data dependence.IEEETrans. Paralltrzb S-yst 3, 5 (Sept ), 591–601RecewedACMNovemberComput,ng1993,Surveys,finalVolrevisionZIMA, H P, BAST, H ,J , Ah_D GERNnT, M1988SUPERB.Atoolforsemi-automaticSIMD\MIMDparallehzatlonParallC’ornput6, 1 (Jan,), 1-18TestDzs-accepted26, No 4, DecemberOctober19941994.

Свежие статьи
Популярно сейчас