Programming DEC-Alpha based multiprocessors the easy way (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Programming DEC-Alpha based multiprocessors the easy way (extended abstract)

Full text

Pdf (1.21 MB)

Source

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

Cape May, New Jersey, United States

Pages: 157 - 166

Year of Publication: 1994

ISBN:0-89791-671-9

Authors

Hagit Attiya	Department of Computer Science, The Technion, Haifa 32000, Israel
Roy Friedman	Department of Computer Science, The Technion, Haifa 32000, Israel

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): 2, Downloads (12 Months): 10, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

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/181014.192323 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	Sarita V. Adve , Mark D. Hill, Weak ordering—a new definition, Proceedings of the 17th annual international symposium on Computer Architecture, p.2-14, May 28-31, 1990, Seattle, Washington, United States
	2	S. Adve and M. Hill, Sufficient Conditions for Implementin9 the Data-Race-Free-1 Memory Model, Computer Sciences Technical Report #1107, University of Wisconsin-Madison, September 1992.
	3	Sarita V. Adve , Mark D. Hill , Barton P. Miller , Robert H. B. Netzer, Detecting data races on weak memory systems, Proceedings of the 18th annual international symposium on Computer architecture, p.234-243, May 27-30, 1991, Toronto, Ontario, Canada
	4	M. Ahamad, G. Neiger, P. Kohfi, J. Burns and P. Hutto, Causal Memory: Definitions, Implementation, and Programming, Technical Report #93/55, College of Computing, Georgia Institute of Technology, September 1993.
	5	Hagit Attiya , Roy Friedman, A correctness condition for high-performance multiprocessors (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.679-690, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129778]
	6	Hagit Attiya , Soma Chaudhuri , Roy Friedman , Jennifer L. Welch, Shared memory consistency conditions for non-sequential execution: definitions and programming strategies, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.241-250, June 30-July 02, 1993, Velen, Germany [doi>10.1145/165231.165263]
	7	Jong-Deok Choi , Sang Lyul Min, Race Frontier: reproducing data races in parallel-program debugging, Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, p.145-154, April 21-24, 1991, Williamsburg, Virginia, United States
	8	F. Corella, J. Stone and C. Barton, A Formal Specification of the PowerPC Shared Memory Architecture, IBM Research Report #RC18638.
	9	Digital Equipment Corporation, The Alpha Architecture Handbook, 1992.
	10	E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, v.8 n.9, p.569, Sept. 1965 [doi>10.1145/365559.365617]
	11	E. W. Dijkstra, "Co-operating sequential processes," Programming Languages (F. Genuys, ed.), Academic Press, New York, 1968.
	12	A. Dinning , E. Schonberg, An empirical comparison of monitoring algorithms for access anomaly detection, Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, p.1-10, March 14-16, 1990, Seattle, Washington, United States
	13	Anne Dinning , Edith Schonberg, Detecting access anomalies in programs with critical sections, Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging, p.85-96, May 20-21, 1991, Santa Cruz, California, United States
	14	K. Gharachorloo, electronic mail message, January 11, 1994.
	15	Phillip B. Gibbons , Michael Merritt, Specifying non-blocking shared memories (extended abstract), Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.306-315, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.141895]
	16	Phillip B. Gibbons , Michael Merritt , Kourosh Gharachorloo, Proving sequential consistency of high-performance shared memories (extended abstract), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.292-303, July 21-24, 1991, Hilton Head, South Carolina, United States [doi>10.1145/113379.113406]
	17	Maurice P. Herlihy , Jeannette M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.3, p.463-492, July 1990 [doi>10.1145/78969.78972]
	18	Leslie Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, v.17 n.8, p.453-455, Aug. 1974 [doi>10.1145/361082.361093]
	19	Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
	20	L. Lamport, "How to Make a Muitiprocessor Computer that Correctly Executes Multiprocess Programs," IEEE Trans. on Computers, Vol. C-28, no. 9 (September 1979), pp. 690-691.
	21	John Mellor-Crummey, On-the-fly detection of data races for programs with nested fork-join parallelism, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.24-33, November 18-22, 1991, Albuquerque, New Mexico, United States [doi>10.1145/125826.125861]
	22	B. Neidecker-Lutz, electronic mail message, August 10, 1993.
	23	Robert H. B. Netzer , Barton P. Miller, Improving the accuracy of data race detection, Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, p.133-144, April 21-24, 1991, Williamsburg, Virginia, United States
	24	Robert H. B. Netzer , Barton P. Miller, What are race conditions?: Some issues and formalizations, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.1, p.74-88, March 1992 [doi>10.1145/130616.130623]
	25	G. Peterson. "Myths About The Mutual Exclusion Problem," Information Proces#ing Letter#, Vol. 12, No. 3, June 1981, pp. 115-116.
	26	Gary L. Peterson , Michael J. Fischer, Economical solutions for the critical section problem in a distributed system (Extended Abstract), Proceedings of the ninth annual ACM symposium on Theory of computing, p.91-97, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803398]
	27	M. Raynal , D. Beeson, Algorithms for mutual exclusion, MIT Press, Cambridge, MA, 1986
	28	A. Singh, "A Framework for Programming using Nonatomic Variables," Technical Report #TRCS-93-11, Department of Computer Science, University of California at Santa Barbara, July 1993.

CITED BY 5

	Robert Cypher, The communication requirements of mutual exclusion, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.147-156, June 24-26, 1995, Santa Barbara, California, United States
	Allon Adir , Hagit Attiya , Gil Shurek, Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture, IEEE Transactions on Parallel and Distributed Systems, v.14 n.5, p.502-515, May 2003
	Miltos D. Grammatikakis , Stefan Liesche, Priority Queues and Sorting Methods for Parallel Simulation, IEEE Transactions on Software Engineering, v.26 n.5, p.401-422, May 2000
	Lisa Higham , Lillanne Jackson , Jalal Kawash, Specifying memory consistency of write buffer multiprocessors, ACM Transactions on Computer Systems (TOCS), v.25 n.1, p.1-es, February 2007
	Lisa Higham , Jalal Kawash, Implementing sequentially consistent programs on processor consistent platforms, Journal of Parallel and Distributed Computing, v.68 n.4, p.488-500, April, 2008