skip to main content
article
Free Access

Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata

Authors Info & Claims
Published:01 October 1979Publication History
First page image

References

  1. 1 ANDERSON, D W, SPARACIO, F J, AND TOMASULO, R M Machme philosophy and instrucuon handhng IBM J Res. Develop. 11 (I 967), 8-24.Google ScholarGoogle Scholar
  2. 2 BAER, J L A survey of some theoretical aspects of multtprocessmg Comptg Surveys 5 (1973), 31-80 Google ScholarGoogle Scholar
  3. 3 KARP, R M., AND MILLER, R.E. Parallel program schemata J Comptr. Syst. Sci. 3 (1969), 147-195.Google ScholarGoogle Scholar
  4. 4 KELLER, R.M Parallel program schemata and maxtmal parallehsm Pt I. Fundamental results. ~ ACM 20, 3 (July 1973), 514-537; Pt II Construction of closures ~ ACM 20, 4 (Oct 1973), 696-710. Google ScholarGoogle Scholar
  5. 5 KELLER, R.M Look-ahead processors. Comptg. Surveys 5 (1975), 177-195 Google ScholarGoogle Scholar
  6. 6 KoTov,V E, AND }qARIN'YANI, A.S Theory of parallel programming, Pts. I, II Cybernaics 10 (1974), 1-18, 377-392, 745-748Google ScholarGoogle Scholar
  7. 7 LOGRIPPO, L. Renammgs m parallel program schemas Res Rep. CS-74-05, Dept. Appl. Analysis and Comptr Sci, U of Waterloo, Waterloo, Ont, 1974.Google ScholarGoogle Scholar
  8. 8 LoGmPpo,L.Renammgs and economy of memory m program schemata J ACM 25, I (Jan. 1978), 10-22. Google ScholarGoogle Scholar
  9. 9 MANNA,Z.MathemaUcal Theory of Computatwn McGraw-Hill, New York, 1974. Google ScholarGoogle Scholar
  10. 10 MILLER, R E, ANt) YAr, C.K. On formulating sunultanetty for studying parallehsm and synchromzatton Proc 10th Annual ACM Symp. Theory of Comptg, San D~ego, Cahf., May 1978, pp. 105-113 Google ScholarGoogle Scholar
  11. 11 PATERSON, M S Equwalence problems m a model of computation Memo No. 1, A. I Lab., M. I T, Cambndge, Mass., 1970Google ScholarGoogle Scholar
  12. 12 STONE, H.S A p~pelme push-down stack computer In Parallel Processor Systems, Technologies, and Apphcatwns, L C. Hobbs, Ed, Spartan Books, Washmgton, D C, 1970, pp. 235-249.Google ScholarGoogle Scholar

Index Terms

  1. Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata

      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

      Full Access

      • Published in

        cover image Journal of the ACM
        Journal of the ACM  Volume 26, Issue 4
        Oct. 1979
        231 pages
        ISSN:0004-5411
        EISSN:1557-735X
        DOI:10.1145/322154
        Issue’s Table of Contents

        Copyright © 1979 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 1979
        Published in jacm Volume 26, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader