Abstract
We describe a general-purpose shared-memory model for parallel computation, called the QSM [22], which provides a high-level shared-memory abstraction for parallel algorithm design, as well as the ability to be emulated in an effective manner on the BSP, a lower-level, distributed-memory model. We present new emulation results that show that very little generality is lost by not having a ‘gap parameter’ at memory.
This work was supported in part by NSF grant CCR/GER-90–23059.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Adler, P.B. Gibbons, Y. Matias, and V. Ramachandran, Modeling parallel bandwidth: Local vs. global restrictions, In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, 94–105, June 1997.
A. Aggarwal, A.K. Chandra, and M. Snir, Communication complexity of PRAMs, Theoretical Computer Science, 71(1):3–28, 1990.
M. Ajtai, J. Komlos, and E. Szemeredi, Sorting in clgn parallel steps, Combinatorica, 3(1):1–19, 1983.
A. Alexandrov, M.F. Ionescu, K.E. Schauser, and C. Sheiman, LogGP: Incorporating long messages into the LogP model — one step closer towards a realistic model for parallel computation, In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures,95–105, July 1995.
B. Alpern, L. Carter, and E. Feig, Uniform memory hierarchies, In Proc. 31st IEEE Symp. on Foundations of Computer Science, 600–608, October 1990.
Y. Aumann and M.O. Rabin, Clock construction in fully asynchronous parallel systems and PRAM simulation, In Proc. 33rd IEEE Symp. on Foundations of Computer Science, 147–156, October 1992.
A. Bar-Noy and S. Kipnis, Designing broadcasting algorithms in the postal model for message-passing systems, In Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 13–22, June-July 1992.
A. Baumker and W. Dittrich, Fully dynamic search trees for an extension of the BSP model, In Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, 233–242, June 1996.
G.E. Blelloch, Vector Models for Data-Parallel Computing, The MIT Press, Cambridge, MA, 1990.
G.E. Blelloch, P.B. Gibbons, Y. Matias, and M. Zagha, Accounting for memory bank contention and delay in high-bandwidth multiprocessors, In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, 84–94, July 1995.
J.L. Carter and M.N. Wegman, Universal classes of hash functions, J. Comput. Syst. Sci., 18:143–154, 1979.
R. Cole, Parallel merge sort, SIAM Journal on Computing,17(4):770–785, 1988.
R. Cole and O. Zajicek, The APRAM: Incorporating asynchrony into the PRAM model, In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, 169–178, June 1989.
D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. VON Eicken, LogP: Towards a realistic model of parallel computation, In Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, 1–12, May 1993.
C. Dwork, M. Herlihy, and O. Waarts, Contention in shared memory algorithms, In Proc. 25th ACM Symp. on Theory of Computing, 174–183, May 1993.
S. Fortune and J. Wyllie, Parallelism in random access machines, In Proc. 10th ACM Symp. on Theory of Computing, 114–118, May 1978.
A.V. Gerbessiotis and L. Valiant, Direct bulk-synchronous parallel algorithms, Journal of Parallel and Distributed Computing,22:251–267, 1994.
P.B. Gibbons, A more practical PRAM model, In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, 158–168, June 1989; Full version in The Asynchronous PRAM: A semi-synchronous model for shared memory MIMD machines, PhD thesis, U.C. Berkeley 1989.
P.B. Gibbons, Y. Matias, and V. Ramachandran, The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms, SIAM Journal on Computing, 1997, To appear. Preliminary version appears in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 638–648, January 1994.
P.B. Gibbons, Y. Matias, and V. Ramachandran, Efficient low-contention parallel algorithms, Journal of Computer and System Sciences, 53(3):417–442, 1996, Special issue devoted to selected papers from the 1994 ACM Symp. on Parallel Algorithms and Architectures.
P.B. Gibbons, Y. Matias, and V. Ramachandran, The Queue-Read Queue-Write Asynchronous PRAM model, Theoretical Computer Science: Special Issue on Parallel Processing, To appear. Preliminary version in Euro-Par’96, Lecture Notes in Computer Science, Vol. 1124, 279–292. Springer, Berlin, August 1996.
P.B. Gibbons, Y. Matias, and V. Ramachandran, Can a shared-memory model serve as a bridging model for parallel computation? In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, 72–83, June 1997.
T. Heywood and S. Ranka, A practical hierarchical model of parallel computation: I. The model, Journal of Parallel and Distributed Computing, 16:212–232, 1992.
J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
B.H.H. Juurlink and H.A.G. Wijshoff, The E-BSP Model: Incorporating general locality and unbalanced communication into the BSP Model, In Proc. Euro-Par’96,339–347, August 1996.
A. Karlin and E. Upfal, Parallel hashing — An efficient implementation of shared memory, J. ACM, 35:4, 876–892, 1988.
R. Karp, A. Sahay, E. Santos, and K.E. Schauser, Optimal broadcast and summation in the LogP model, In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures,142–153, June-July 1993.
R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, 869–941. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.
Z.M. Kedem, K.V. Palem, M.O. Rabin, and A. Raghunathan, Efficient program transformations for resilient parallel computation via randomization, In Proc. 24th ACM Symp. on Theory of Computing, 306–317, May 1992.
K. Kennedy, A research agenda for high performance computing software, In Developing a Computer Science Agenda for High-Performance Computing, 106–109. ACM Press, 1994.
F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes,Morgan Kaufmann, San Mateo, CA, 1992.
P. Liu, W. Aiello, and S. Bhatt, An atomic model for message-passing, In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures,154–163, June-July 1993.
P.D. Mackenzie and V. Ramachandran, ERCW PRAMs and optical communication, Theoretical Computer Science: Special Issue on Parallel Processing, To appear. Preliminary version in Euro-Par’96,Lecture Notes in Computer Science, Vol. 1124, 293–303, Springer, Berlin, August 1996.
P.D. Mackenzie and V. Ramachandran, Computational bounds for fundamental problems on general-purpose parallel models, Manuscript. Univ. of Texas at Austin. 1998.
B.M. Maggs, L.R. Matheson, and R.E. Tarjan, Models of parallel computation: A survey and synthesis, In Proc. 28th Hawaii International Conf. on System Sciences, II: 61–70, January 1995.
Y. Mansour, N. Nisan, and U. Vishkin, Trade-offs between communication throughput and parallel time, In Proc. 26th ACM Symp. on Theory of Computing, 372–381, 1994.
W.F. McColl, A BSP realization of Strassen’s algorithm, Technical report, Oxford University Computing Laboratory, May 1995.
K. Mehlhorn and U. Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Informatica, 21:339–374, 1984.
N. Nishimura, Asynchronous shared memory parallel computation, In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, 76–84, July 1990.
P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences,37:130–143, 1988.
A.G. Ranade, Fluent parallel computation,PhD thesis, Department of Computer Science, Yale University, New Haven, CT, May 1989.
J.H. Reif, editor. A Synthesis of Parallel Algorithms, Morgan-Kaufmann, San Mateo, CA, 1993.
L. Snyder, Type architecture, shared memory and the corollary of modest potential, Annual Review of CS,I:289–317, 1986.
L.G. Valiant, A bridging model for parallel computation, Communications of the ACM, 33(8):103–111, 1990.
L.G. Valiant, General purpose parallel architectures, In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, 943–972. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.
U. Vishkin, A parallel-design distributed-implementation (PDDI) general purpose computer, Theoretical Computer Science, 32:157–172, 1984.
J.S. Vitter and E.A.M. Shriver, Optimal disk I/O with parallel block transfer, In Proc. 22nd ACM Symp. on Theory of Computing,159–169, May 1990.
H.A.G. Wijshoff and B.H.H. Juurlink, A quantitative comparison of parallel computation models, In Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, 13–24, June 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ramachandran, V. (1999). A General-Purpose Shared-Memory Model for Parallel Computation. In: Heath, M.T., Ranade, A., Schreiber, R.S. (eds) Algorithms for Parallel Processing. The IMA Volumes in Mathematics and its Applications, vol 105. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1516-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1516-5_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7175-8
Online ISBN: 978-1-4612-1516-5
eBook Packages: Springer Book Archive