skip to main content
10.1145/143369.143452acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article
Free Access

Speedup of band linear recurrences in the presence of resource constraints

Published:01 August 1992Publication History
First page image

References

  1. 1.Aho, A., Sethi, R., UUman, J., "Compilers-Prlnciples, Techniques, and Tools", Addison Wesley, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Aiken, A., Nicolau, A., "Perfect Pipelining: A New Loop Parallelization Technique", Proceedings of ESOP, France, Springer- Verlag, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Chen, S. C., "Speedup of Iterative Programs in Multiprocessing Systems", Ph.D Thesis, January 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Chert, S. C. and Kuck, D., "Time and Processor Bounds for Linear Recurrence Systems", IEEE Transactions on Computer, Vol. C-24, pp. 701-717, July, 1975.Google ScholarGoogle Scholar
  5. 5.Chen, S. C., Kuck, D. and Sameh, A. H., "Practica~l Parallel Band Triangular System Solvers", ACM Transactions on Math. Software, Vol. 4, pp. 270-277, Sept, 197'8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.K. Ebcioglu. "Some Design Ideas for a VLIW Architecture for Sequential-natured Software", Proceedings IFIP, 1988.Google ScholarGoogle Scholar
  7. 7.K.Ebcloglu. "A Compilation Technique for Software Pipelining of Loops with ConditionM Jumps". Proceedings of the 20th Annual Workshop on Microprogramming, pp. 69-79, ACM Press, 1987'. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.J. A. Fisher. "Trace Scheduling: A technique for global microcode compaction". IEEE Transactions on Computers, No. 7,pp. 478-490, 1981.Google ScholarGoogle Scholar
  9. 9.Gajski, D., "An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines", IEEE, Transactions on Computers, Vol. c-30, No.3, March 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.K. A. Gallivan, R. J. PlemInons, A. H. Sameh, "Parallel Algorithms for Dense Linear Algebra Computations, SIAM Review, Vol. 32, No. 1, pp. 54-135, March 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.T. Gross, M. Lain, "Compilation for High Performance Systolic Array", Proceedings of 1986 SIGPLAN Symposium on Compiler Construction, July, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.J. R. Allen, K. Kennedy, "PFC: A program to Convert Fortran to Parallel Form", Rice University Tech. Rep. MASC TR 82-6, Houston, TX, 1982.Google ScholarGoogle Scholar
  13. 13.Hyafil, L. and Kung, H. T., "The Complexity of Parallel Evaluation of Linear Recurrence", JACM, Vol. 24, No.3, pp. 513-521, July 1977 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.Kogge, P. and Stone, H., "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations", IEEE Transactions on Computer, Vol., C-22, No.8, August 1973.Google ScholarGoogle Scholar
  15. 15.Kuck, D., "The Structure of Computers and Computations", Vol. 1, John Wiley & Sons, Inc., 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.Ladner, R., Fischer, M., "Parallel Prefix Computation", JACM, Vol. 27, No.4, October 1980, pp. 831-838. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.Little, J., Blelloch, G. and Cass, T., "Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, No. 3, March 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.Nicolau, A., Wang, H. G., "Optimal Schedules for Parallel Prefix Computation with Bounded Resources", Proceeding of Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , Williamsburg, Virginia, April 21-24, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.Padua, D., Wolfe, M., "Advanced Compiler Optimizations for Supercomputers", CACM, Vol. 29, No. 12, December 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.B. R Rau, C. D. Glaeser, "Efficient Code Gcnerationfor HorizontM Architectures: Compiler Techniques and Architectural Support". Proceedings of the 9th Symposium on Computer Architecture, April 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.H. Wang, A. Nicolau, "Speedup of Programs Confining Band Linear Recurrence with Resource ConstrMnts", Tech. Rep. 92-12, Department of Information and Computer Science, University of California Irvine, December, 1991.Google ScholarGoogle Scholar
  22. 22.H. Wang, A. Nicolau, "Optimal schedules and new time bounds for parallel evaluation of band linear recurrences", Technical Report, Department of Information and Computer Science, University of California at Irvine, Jan. 1992.Google ScholarGoogle Scholar

Index Terms

  1. Speedup of band linear recurrences in the presence of resource constraints

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  ICS '92: Proceedings of the 6th international conference on Supercomputing
                  August 1992
                  495 pages
                  ISBN:0897914856
                  DOI:10.1145/143369

                  Copyright © 1992 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 1 August 1992

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  Overall Acceptance Rate584of2,055submissions,28%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader