An atomic model for message-passing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An atomic model for message-passing

Full text

Pdf (954 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents

Velen, Germany

Pages: 154 - 163

Year of Publication: 1993

ISBN:0-89791-599-2

Authors

Pangfeng Liu
William Aiello
Sandeep Bhatt

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 15, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165251 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. Bhatt, M. Chen, C. Lin, and P. Liu. Abstractions for parallel N-body simulation. In Scalable High Performance Computing Conference SHPCC-92, 1992.
	2	Mihály Geréb-Graus , Thanasis Tsantilas, Efficient optical communication in parallel computers, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.41-48, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.140906]
	3	Richard Karp , Yanjun Zhang, A randomized parallel branch-and-bound procedure, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.290-300, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62240]
	4	Charles E. Leiserson , Zahi S. Abuhamdeh , David C. Douglas , Carl R. Feynman , Mahesh N. Ganmukhi , Jeffrey V. Hill , Daniel Hillis , Bradley C. Kuszmaul , Margaret A. St. Pierre , David S. Wells , Monica C. Wong , Shaw-Wen Yang , Robert Zak, The network architecture of the Connection Machine CM-5 (extended abstract), Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.272-285, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.141883]
	5	Abhiram Ranade, A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method, University of California at Berkeley, Berkeley, CA, 1990
	6	Charles L. Seitz. Multicomputers. In Developments in Concurrency and Communication, C.A.R Hoare (ed) Addison-Wesley, 1990. pp 131-201.

CITED BY 13

	Phillip B. Gibbons , Yossi Matias , Vijaya Ramachandran, Asynchrony versus bulk-synchrony in QRQW PRAM models, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.176, May 23-26, 1996, Philadelphia, Pennsylvania, United States
	Volker Stemann, Parallel balanced allocations, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.261-269, June 24-26, 1996, Padua, Italy
	Pangfeng Liu , Sandeep N. Bhatt, Experiences with parallel N-body simulation, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.122-131, June 27-29, 1994, Cape May, New Jersey, United States
	Jan-Jan Wu , Pangfeng Liu, Distributed data structure design for scientific computation, Proceedings of the 12th international conference on Supercomputing, p.227-234, July 1998, Melbourne, Australia
	Kieran T. Herley , Andrea Pietracaprina , Geppino Pucci, Deterministic parallel backtrack search, Theoretical Computer Science, v.270 n.1-2, p.309-324, January
	Pangfeng Liu , Sandeep N. Bhatt, Experiences with Parallel N-Body Simulation, IEEE Transactions on Parallel and Distributed Systems, v.11 n.12, p.1306-1323, December 2000
	Mark Goudreau , Kevin Lang , Satish Rao , Torsten Suel , Thanasis Tsantilas, Towards efficiency and portability: programming with the BSP model, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.1-12, June 24-26, 1996, Padua, Italy
	Matthew I. Frank , Anant Agarwal , Mary K. Vernon, LoPC: modeling contention in parallel algorithms, ACM SIGPLAN Notices, v.32 n.7, p.276-287, July 1997
	Phillip B. Gibbons , Yossi Matias , Vijaya Ramachandran, The QRQW PRAM: accounting for contention in parallel algorithms, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.638-648, January 23-25, 1994, Arlington, Virginia, United States
	Andrea C. Dusseau , David E. Culler , Klaus Erik Schauser , Richard P. Martin, Fast Parallel Sorting Under LogP: Experience with the CM-5, IEEE Transactions on Parallel and Distributed Systems, v.7 n.8, p.791-805, August 1996
	Robert D. Blumofe , Christopher F. Joerg , Bradley C. Kuszmaul , Charles E. Leiserson , Keith H. Randall , Yuli Zhou, Cilk: an efficient multithreaded runtime system, ACM SIGPLAN Notices, v.30 n.8, p.207-216, Aug. 1995
	Robert D. Blumofe , Charles E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM (JACM), v.46 n.5, p.720-748, Sept. 1999
	Mark W. Goudreau , Kevin Lang , Satish B. Rao , Torsten Suel , Thanasis Tsantilas, Portable and Efficient Parallel Computing Using the BSP Model, IEEE Transactions on Computers, v.48 n.7, p.670-689, July 1999