Models for advancing pram and other algorithms into parallel programs for a PRAM-on-chip platform

Handbook of Parallel Computing: Models, Algorithms and Applications

Volumn , Issue , 2007, Pages 5-1-5-60

  Vishkin, Uzi ^a   Caragea, George C ^b   Lee, Bryant C ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b Institute of Advanced Computer Science   (United States)

^c NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 46449103865     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420011296     Document Type: Chapter

References (62)

1. A. V. Aho and J. D. Ullman, Foundations of Computer Science. W. H. Freeman & Co., New York, 1994.
2. R. Allen, D. Callahan, and K. Kennedy, Automatic decomposition of scientific programs for parallel execution. In POPL ’87: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 63–76, New York, 1987. ACM Press.
3. G. S. Almasi and A. Gottlieb, Highly Parallel Computing. Benjamin Cummings, Redwood City, CA, 1994.
4. S. P. Amarasinghe, J. M. Anderson, M. S. Lam, and C. W. Tseng, The SUIF compiler for scalable parallel machines. In Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995.
5. S. Baase, Computer Algorithms: Introduction to Design and Analysis. Addison Wesley, Boston, MA, 1988.
6. D. A. Bader, G. Cong, and J. Feo, On the architectural requirements for efficient execution of graph algorithms. In ICPP ’05: Proceedings of the 2005 International Conference on Parallel Processing (ICPP’05), pages 547–556, Washington, DC, 2005. IEEE Computer Society.
7. A. Balkan, G. Qu, and U. Vishkin, Mesh-of-trees and alternative interconnection networks for single-chip parallel processing. In ASAP 2006: 17th IEEE Internation Conference on Application- Specific Systems, Architectures and Processors, pages 73–80, Steamboat Springs, Colorado, 2006. Best Paper Award.
8. A. O. Balkan and U. Vishkin, Programmer’s manual forXMTC language, XMTC compiler andXMT simulator. Technical Report UMIACS-TR 2005-45, University of Maryland Institute for Advanced Computer Studies (UMIACS), February 2006.
9. G. Bilardi and A. Nicolau, Adaptive bitonic sorting: an optimal parallel algorithm for sharedmemory machines. SIAM J. Comput., 18(2):216–228, 1989.
10. G. E. Blelloch, Programming parallel algorithms. Commun. ACM, 39(3):85–97, 1996.
11. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha, A comparison of sorting algorithms for the connection machine CM-2. In SPAA ’91: Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pages 3–16, New York, 1991. ACM Press.
12. R. D. Blumofe and C. E. Leiserson, Space-efficient scheduling of multithreaded computations. In 25th Annual ACM Symposium on the Theory of Computing (STOC ’93), pages 362–371, 1993.
13. R. P. Brent, The parallel evaluation of general arithmetic expressions. J. ACM, 21(2):201–206, 1974.
14. D. Burger and T. M. Austin, The simplescalar tool set, version 2. 0. SIGARCH Comput. Archit. News, 25(3):13–25, 1997.
15. L. Carter, J. Feo, and A. Snavely, Performance and programming experience on the tera mta. In Proceedings SIAM Conference on Parallel Processing, 1999.
16. R. Cole and U. Vishkin, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In STOC ’86: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 206–219, New York, 1986. ACM Press.
17. R. Cole and O. Zajicek, The APRAM: incorporating asynchrony into the PRAM model. In SPAA ’89: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures, pages 169–178, New York, 1989. ACM Press.
18. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. 1st ed., MIT Press, Cambridge, MA, 1990.
19. D. E. Culler and J. P. Singh, Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, 1999.
20. S. Dascal and U. Vishkin, Experimentswith list ranking for explicitmulti-threaded (xmt) instruction parallelism. J. Exp, Algorithmics, 5:10, 2000. Special issue for the 3rd Workshop on Algorithms Engineering (WAE’99), London, UK, July 1999.
21. R. Dementiev, M. Klein, and W. J. Paul, Performance ofMP3Don the SB-PRAM prototype (research note). In Euro-Par ’02: Proceedings of the 8th International Euro-Par Conference on Parallel Processing, pages 132–136, London, UK, 2002. Springer-Verlag.
22. A. C. Dusseau, D. E. Culler, K. E. Schauser, and R. P. Martin, Fast parallel sorting under Logp: Experience with the CM-5. IEEE Trans. Parallel Distrib. Syst., 7(8):791–805, 1996.
23. D. Eppstein and Z. Galil, Parallel algorithmic techniques for combinatorial computation. Ann. Rev. of Comput. Sci., 3:233–283, 1988.
24. J. Feo, D. Harper, S. Kahan, and P. Konecny, Eldorado. In CF ’05: Proceedings of the 2nd Conference on Computing Frontiers, pages 28–34, New York, 2005. ACM Press.
25. M. J. Garzaran, J. L. Briz, P. Ibanez, and V. Vinals, Hardware prefetching in bus-based multiprocessors: pattern characterization and cost-effective hardware. In Proceedings of the Euromicro Workshop on Parallel and Distributed Processing, pages 345–354, 2001.
26. P. B. Gibbons, A more practical PRAM model. In SPAA ’89: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures, pages 158–168, New York, 1989. ACM Press.
27. P. B. Gibbons, Y. Matias, and V. Ramachandran, The queue-read queue-write asynchronous PRAM model. Theor. Comput. Sci., 196(1-2):3–29, 1998.
28. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU ultracomputer: designing a mimd, shared-memory parallel machine (extended abstract). In ISCA ’82: Proceedings of the 9th Annual Symposium on Computer Architecture, pages 27–42, Los Alamitos, CA, 1982. IEEE Computer Society Press.
29. A. Gress and G. Zachmann, GPU-BiSort: Optimal parallel sorting on stream architectures. In IPDPS ’06: Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS’06), 2006. To appear.
30. P. Gu and U. Vishkin, Case study of gate-level logic simulation on an extermely fine-grained chip multiprocessor. Journal of Embedded Computing, Special Issue on Embedded Single-Chip Multicore Architectures and Related Research—from System Design to Application Support, 2006. To appear.
31. M. J. Harris, W. V. Baxter, T. Scheuermann, and A. Lastra, Simulation of cloud dynamics on graphics hardware. In HWWS ’03: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, pages 92–101, Aire-la-Ville, Switzerland, Switzerland, 2003. Eurographics Association.
32. D. R. Helman and J. JáJá. Designing practical efficient algorithms for symmetric multiprocessors. In ALENEX ’99: Selected papers from the International Workshop on Algorithm Engineering and Experimentation, pages 37–56, London, UK, 1999. Springer-Verlag.
33. J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, 2003.
34. L. Hochstein and V. R. Basili, An empirical study to compare two parallel programming models. 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’06), July 2006. Position Paper and Brief Announcement.
35. L. Hochstein, U. Vishkin, J. Gilbert, and V. Basili, An empirical study to compare the productivity of two parallel programming models. Preprint, 2005.
36. J. S. Huang and Y. C. Chow, Parallel sorting and data partitioning by sampling. In Proceedings of the IEEE Computer Society’s Seventh International Computer Software and Applications Conference, pages 627–631, November 1983.
37. J. JáJá. An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1992.
38. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines. Handbook of Theoretical Computer science (vol. A): Algorithms and Complexity, pages 869–941, 1990.
39. J. Keller, C. W. Kessler, and J. L. Traff, Practical PRAM Programming. Wiley, New York, 2000.
40. P. Kipfer, M. Segal, and R. Westermann, Uberflow: a GPU-based particle engine. In HWWS ’04: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, pages 115–122, New York, 2004. ACM Press.
41. R. E. Ladner and M. J. Fischer, Parallel prefix computation. J. ACM, 27(4):831–838, 1980.
42. C. E. Leiserson and H. Prokop, Minicourse on multithreaded programming. http://supertech.csail.mit.edu/cilk/papers/index.html, 1998.
43. U. Manber, Introduction to Algorithms—A Creative Approach. AddisonWesley, Boston, MA, 1989.
44. K. Moreland and E. Angel, The FFT on a GPU. In HWWS ’03: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, pages 112–119, Aire-la-Ville, Switzerland, 2003. Eurographics Association.
45. D. Naishlos, J. Nuzman, C. W. Tseng, and U. Vishkin, Evaluating multi-threading in the prototype XMT environment. In Proceedings 4th Workshop on Multithreaded Execution, Architecture, and Compilation, 2000.
46. D. Naishlos, J. Nuzman, C. W. Tseng, and U. Vishkin, Evaluating the XMT programming model. In Proceedings of the 6th Workshop on High-Level Parallel Programming Models and Supportive Environments, pages 95–108, 2001.
47. D. Naishlos, J. Nuzman, C. W. Tseng, and U. Vishkin, Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. In Invited Special Issue for ACM-SPAA’01: TOCS 36, 5, pages 521–552, New York, 2003. Springer-Verlag.
48. V. S. Pai and S. V. Adve, Comparing and combining read miss clustering and software prefetching. In PACT ’01: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques, page 292, Washington, DC, 2001. IEEE Computer Society.
49. J. H. Reif and L. G. Valiant, A logarithmic time sort for linear size networks. J. ACM, 34(1):60–76, 1987.
50. J. T. Schwartz, Ultracomputers. ACM Trans. Program. Lang. Syst., 2(4):484–521, 1980.
51. V. Shah and J. R. Gilbert, Sparse matrices in MATLAB: Design and implementation. In HiPC, pages 144–155, 2004.
52. Y. Shiloach and U. Vishkin, An o(n2logn) parallel max-flow algorithm. J. Algorithms, 3(2):128–146, 1982.
53. S. Skiena, The Algorithm Design Manual. Springer, November 1997.
54. A. Snavely, L. Carter, J. Boisseau, A. Majumdar, K. S. Gatlin, N. Mitchell, J. Feo, and B. Koblenz, Multi-processor performance on the Tera MTA. In Supercomputing ’98: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (CDROM), pages 1–8, Washington, DC, 1998. IEEE Computer Society.
55. X. Tian, R. Krishnaiyer, H. Saito, M. Girkar, and W. Li, Impact of compiler-based data-prefetching techniques on SPECOMPapplication performance. In IPDPS ’05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05)—Papers, page 53. 1, Washington, DC, 2005. IEEE Computer Society.
56. A. Tzannes, R. Barua, G. C. Caragea, and U. Vishkin, Issues in writing a parallel compiler starting from a serial compiler. Draft, 2006.
57. U. Vishkin, From algorithm parallelism to instruction-level parallelism: An encode-decode chain using prefix-sum. In SPAA ’97: Proceedings of the 9th Annual ACMSymposium on Parallel Algorithms and Architectures, pages 260–271, New York, 1997. ACM Press.
58. U. Vishkin, A no-busy-wait balanced tree parallel algorithmic paradigm. In SPAA ’00: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 147–155, New York, 2000. ACM Press.
59. U. Vishkin, Thinking in parallel: Some basic data-parallel algorithms and techniques. In use as class notes since 1993. http://www.umiacs.umd.edu/users/vishkin/PUBLICATIONS/classnotes.ps, February 2002.
60. U. Vishkin, S. Dascal, E. Berkovich, and J. Nuzman, Explicit multi-threading (XMT) bridging models for instruction parallelism (extended abstract). In SPAA ’98: Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 140–151, New York, 1998. ACM Press.
61. X. Wen and U. Vishkin, Pram-on-chip: First commitment to silicon. In SPAA ’07: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 301–302, 2007, ACM Press.
62. Balkan, M. Horak, G. Qu, and U. Vishkin, Layout-accurate design and implementation of a high-throughput interconnection network for single-chip parallel processing. In Processings of Hot Interconnects 15, pages 21–28, Stanford, CA, August 22–24, 2007. IEEE.