skip to main content
10.1145/277651.277680acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article
Free Access

Explicit multi-threading (XMT) bridging models for instruction parallelism (extended abstract)

Published:01 June 1998Publication History
First page image

References

  1. Tera.It. Alverson et al. The Tera computer system. Int. Conf. on Supercomp., 1-6, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bl90.G.E. Blelloch. Vector Models }or Data-Parallel Computing. MIT Press, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bl96.G.E. Blelloch. Prorgamming parallel algorithms. CA CM, 39(3), 1996, 85-97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. BGMN.G.E. Blelloch, P.B. Gibbons, Y. Matias and G.J. Narlikar. Space-efficient scheduling of parallelism with synchronization variables. In Proc. 9th ACM-SPAA, 1997, 12-22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. BL93.It.D. Blumofe and C.E. Leiserson. Spaceefficient scheduling of multi-threaded computations. Proc. 25th STOC, 362-371, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. CZ89.It. Cole and O. Zajicek. The APRAM: incorporating asynchrony into the P t tAM model. Parallelism: Proc. 1st SPAA, 1989, 169-178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Fl96.M.J. Flynn. Parallel processors were the future., and may yet be. Computer 29,12, 151- 152, December 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Fr93.M. Franklin. The Multiscalar Architecture. Doctoral dissertation, Department of Computer Science, University of Wisconsin, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. G89.P.B. Gibbons. A more practical P t tAM algorithm. Proc. 1st SPAA, 1989, 158-168. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. HP96.3.L. Hennessy and D.A. Patterson. Computer Architecture A Qualitative Approach, Second Edition. Morgan Kaufmann, San Mateo, California, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Ja92.J. J~J~. An Introduction to Parallel Algorithms. Addison-Wesley, Iteading, MA, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ke96.C.W. Kessler. Quick reference guides: (i) Fork95, and (ii) SB-PItAM: Instruction set simulator system software. U. Trier, FB IV, D-54286 Trier, Germany, 1996.Google ScholarGoogle Scholar
  13. M96.T. Mudge. Strategic directions in computer architecture. A CM Computing Surveys, 28,4 (1996), 671-678. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P+97.D. Patterson et al. Intelligent RAM (IRAM): Chips that remember and compute. 1997 IEEE Int. Solid-State Circuits Conf., San Francisco, CA, Feb. 1997.Google ScholarGoogle Scholar
  15. PH94.D.A. Patterson and J.L. Hennessy. Computer Organization and Design The Hardware#Software interlace. Morgan Kaufmann, San Mateo, California, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. SCDEFT97.M. Schlansker et al. Compilers for instruction-level parallelism. Computer, 30,12 (1997), 63-69. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Si97.J.F. Sibeyn. From parallel to external list ranking. TIt-MPI-I-97-1-021, Saarbrucken, Germany, 1997.Google ScholarGoogle Scholar
  18. TEL95.D.M. Tullsen, S.J. Eggers, and H.M. Levy. Simultaneous multithreading: maximizing onchip parallelism. Proc. 22nd ISCA, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Va90.L.G. Valiant. A bridging model for parallel computation. CA CM, 33(8), 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Vi84.U. Vishkin. Randomized speed-ups in parallel computation. Proc. 16th STOC, 1984, 230- 239. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Vi84a.U. Vishkin. Parallel-Design Distributed- Implementation (PDDI) general purpose computer. TCS 32 (1984), 157-172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Vi97.U. Vishkin. From Algorithm Parallelism to Instruction-Level Parallelism: An Encode- Decode Chain Using Prefix-Sum. Proc. 9th SPAA, 1997, 260-271. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Explicit multi-threading (XMT) bridging models for instruction parallelism (extended abstract)

        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
          SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
          June 1998
          312 pages
          ISBN:0897919890
          DOI:10.1145/277651

          Copyright © 1998 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 June 1998

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          SPAA '98 Paper Acceptance Rate30of84submissions,36%Overall Acceptance Rate447of1,461submissions,31%

          Upcoming Conference

          SPAA '24

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader