Vivek Sarkar
Guang R. Gao
- AD79.W.B. Ackerman and J. B. Dennis. VAL--a value-oriented algorithmic language. Technical Report 218, Laboratory for Computer Science, MIT, 1979. Google Scholar
Digital Library
- AHU74.A.V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and AnaIys~s of Computer Algorithms. Addison-Wesley Publishing Co., 1974. Google ScholarDigital Library
- AK87.R. Alien and K. Kennedy. Automatic translation of FORTRAN programs to vector form. A CM Transactions on Programming Languages and Systems, 9, 1987. Google ScholarDigital Library
- All83.John R. Allen. Dependence Analysis }or Subscripted Variables and its Apphcation to Program Transformation. PhD thesis, Rice University, 1983. Google ScholarDigital Library
- AN90.Arvind and R.S. Nikhil. Executing a program on the MIT tagged-token dataflow architecture. IEEE Transactions on Computers, 39(3):300- 318, March 1990. Google ScholarDigital Library
- Ban90.U. Banerjee. Unimodular transformations of double loops. In Proceedings o/the Third Workshop on Programming Languages and Compilers for Parallel Computing, Irvine, CA, August 1990. To be published by Pitman in Monographs in Parallel and Distributed Computing.Google Scholar
- BCKT89.Preston Briggs, Keith D. Cooper, Ken Kennedy, and Linda Torczon. Coloring heuristics for register allocation. Proceedings of the 1989 SIGPLAN Conference on Programming Language Design and Implementation, 24(7):275- 284, July 1989. Google ScholarDigital Library
- CAC+81.G. J. Chaitin, M. Auslander, A. Chandra, J. Cocke, M. Hopkins, and P. Markstein. Register allocation via coloring. Computer Languages 6, pages 47-57, January 1981.Google Scholar
- CCK90.David Callahan, Steve Cart, and Ken Kennedy. Improving register allocation for subscripted variables. Proceedings o.f the SIGPLAN '90 Conference on Programming Language Design and Implementation, June 1990. White Plains, NY. Google ScholarDigital Library
- Deo74.Narsingh Dec. Graph Theory with Applications to Engineering and Computer Sc,cnce. Automatic Computation. Prentice-HuH, Englewood Cliffs, NJ, 1974. Google ScholarDigital Library
- Dij59.E.W. Dijkstra. A note on two problems in connection with graphs. Numer~she Mathematik, 1:269-271, 1959.Google ScholarDigital Library
- Gao86.G.R. Gao. X maximally pipel~necl ~ridi~So~l linear equation solver. Journal of Parallel and Distributed Computing, 3(2):215-235, June t986. Google ScholarDigital Library
- Gao90.G.R. Gao. A Code Mapping Scheme for Dataflow Software Pzpelining. Kluwer Academic Publishers, Boston, December 1990. Google ScholarDigital Library
- GYDM90.G. R. Gao, R. Yates, J. B. Dennis, and L. Mullin. An efficient monolithic array constructor. In Proceedings of the 3rd Workshop on Languages and Compilers for Parallel Computing, Irvine, CA, 1990. To be published by MIT Press.Google Scholar
- Hud89.P. Hudak. Conception, evolution, and application of functional programming languages. Computing Surveys, 21(3), September 1989. Google ScholarDigital Library
- KLL86.S.Y. Kung, S. C. Lo, and P. S. Lewi:~. Timing analysis and optimization of VLSI ,data flow arrays. In Proceedings of the 1986 International Conference on Parallel Processing, 1986.Google Scholar
- KRP+81.D. J. Kuck, Kuhn R., D. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proceedings of the E,ghth A CM Symposium on Principles of Programming Languages, pages 207-218, January 1981. Google ScholarDigital Library
- Kuh80.Robert Henry Kuhn. Optimization and Interconnection Complexity for Parallel Processors, Single-Stage Networks, and Decision Trees. PhD thesis, University of Illinois at Urbana- Champaign, 1980. Report No. UIUCDCS-R-80- 1009.Google Scholar
- Lei83.C.E. Leiserson. Area-E~cient VLSI Computation. MIT Press, Cambridge, MA, 1983. Google ScholarDigital Library
- Mea85.J.R. McGraw and et al. SISAL: Streams and iteration in a single assignment languagew language reference manual version 1.2. Technical Report M-146, Lawrence Livermore National Laboratory, 1985.Google Scholar
- Sar89.Vivek Sarkar. Partitioning and Scheduling Parallel Programs.for Multiprocessors. Pitman, London and The MIT Press, Cambridge, MA, 1989. In the series, Research Monographs in Parallel and Distributed Computing. This monograph is a revised version of the Author's Ph.D. dissertation published as Technical Report CSL-TR-87-328, Stanford University, April 1987. Google ScholarDigital Library
- Sar90.Vivek Sarkar. Automatic partitioning of a program dependence graph into parallel tasks. Technical report, IBM Research, October 1990. Submitted to IBM Journal of Research and Development. Google ScholarDigital Library
- SC90.Vivek Sarkar and David Cann. POSC--a partitioning and optimizing sisal compiler. Proceedings of the A CM 1990 International Con/erence on Supercomputing, pages 148-163, June 1990. Amsterdam, the Netherlands. Google ScholarDigital Library
- WL90.Michael E. Wolf and Monica S. Lain. Maximizing parallelism via loop parallelism. Proceedings of the Third Workshop on Languages and Compilers for Parallel Computing, August 1990.Google Scholar
- Wol89.Michael J. Wolfe. Opt,mizing Supercompilers for Supercomputers. Pitman, London and The MIT Press, Cambridge, MA, 1989. In the series, Research Monographs in Parallel and Distributed Computing. Revised version of the author's Ph.D. dissertation, Published as Technical Report UIUCDCS-R-82-1105, University Illinois at Urbana-Champaign, 1982. Google ScholarDigital Library
- X3J90.The FORTRAN Technical Committee of ANSI X3J3, June 1990. FORTRAN 90, Draft of the International Standard.Google Scholar
- ZSY90.Zhiyuan Li Zhiyu Shen and Pen-Chung Yew. An empirical study oi" FORTRAN programs for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems, 1(3):356-364, July 1990. Google ScholarDigital Library
Index Terms
- Optimization of array accesses by collective loop transformations
Recommendations
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests
Linear loop transformations and tiling are known to be very effective for enhancing locality of reference in perfectly-nested loops. However, they cannot be applied directly to imperfectly-nested loops. Some compilers attempt to convert imperfectly-...
Array Pattern Optimization for Steerable Circular Isotropic Antenna Array Using Cat Swarm Optimization Algorithm
In this paper the steerable isotropic circular array antenna is designed for reducing the side lobe level (SLL) using evolutionary optimization technique. The optimization techniques particle swarm optimization and cat swarm optimization algorithm are ...
Comments