Article

Free access

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

Authors:

Hagit Attiya,

Roy FriedmanAuthors Info & Claims

SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

Pages 157 - 166

https://doi.org/10.1145/181014.192323

Published: 01 August 1994 Publication History

PDF eReader

References

[1]

S. Adve and M. Hill, "Weak Ordering--A New Definition," Proc. of the 17th International Symposium on Computer Architecture, May 1990, pp. 2-14.

Digital Library

Google Scholar

[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.

Google Scholar

[3]

S. Adve, M. Hill, B. Miller and R. Netzer, "Detecting Data Races on Weak Memory Systems," Proc. of the 18th International Sympos,um on Computer Architecture, May 1991, pp. 234-243.

Digital Library

Google Scholar

[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.

Google Scholar

[5]

It. Attiya and R. Friedman, "A Consistency Condition for High-Performance Multiprocessors," Proc. of the 24th A CM Symposium on Theory of Computing, May 1992, pp. 679-690. Also: Technical Report #767 (revised version), Department of Computer Science, The Technion, Haifa, December 1993.

Digital Library

Google Scholar

[6]

H. Attiya, S. Chaudhuri, R. Friedman and J. Welch, "Shared Memory Consistency Conditions for Non- Sequential Execution: Definitions and Programming Strategies," Proc. of the 5th A CM Symposium On Parallel Algorithms and Architectures, June/July 1993, pp. 241-250. Also: Technical Report LPCR #9306, Department of Computer Science, The Technion.

Digital Library

Google Scholar

[7]

J.-D. Choi and S. L. Min, "Race Frontier: Reproducing Data Races in Parallel Program Debugging," Proc. of the 3rd A CM Symposium on Principles and Practice of Parallel Programming, April 1991, pp. 145-154.

Digital Library

Google Scholar

[8]

F. Corella, J. Stone and C. Barton, A Formal Specification of the PowerPC Shared Memory Architecture, IBM Research Report #RC18638.

Google Scholar

[9]

Digital Equipment Corporation, The Alpha Architecture Handbook, 1992.

Google Scholar

[10]

E. W. Dijkstra, "A Solution of # Problem in Concurrent Programming Control," Communzcat,ons of the A CM, Vol. 8, No. 9, September 1965, pp. 569.

Digital Library

Google Scholar

[11]

E. W. Dijkstra, "Co-operating sequential processes," Programming Languages (F. Genuys, ed.), Academic Press, New York, 1968.

Google Scholar

[12]

A. Dinning and E. Schonberg, "An Empirical Comparison of Monitoring Algorithms for Access Anomaly Detection," Proc. of the 2nd A CM Symposium on Pranceples and Practice of Parallel Programming, March 1990, pp. 1-10.

Digital Library

Google Scholar

[13]

A. Dinning and E. Schonberg, "Detecting Access Anomalies in Programs with Critical Sections," Proc. of the A CM Workshop on Parallel and Distmbuted Debugging, May 1991, pp. 85-96.

Digital Library

Google Scholar

[14]

K. Gharachorloo, electronic mail message, January 11, 1994.

Google Scholar

[15]

P. Gibbons and M. Merritt, "Specifying Non-Blocking Shared Memories," Proc. of the 4th A CM Symposium on Parallel Algor,thms and Architectures, July 1992, pp. 306-315.

Digital Library

Google Scholar

[16]

P. Gibbons, M. Merritt and K. Gharachorloo, "Proving Sequential Consistency of High-Performance Shared Memories," Proc. of the 3rd A CM Symposium on Parallel Algorithms and Architectures, July 1991, pp. 292- 303.

Digital Library

Google Scholar

[17]

M. Herlihy and J. Wing, "Linearizabflity: A Correctness Condition for Concurrent Objects," ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3 (July 1990), pp. 463-492.

Digital Library

Google Scholar

[18]

L. Lamport, "A New Solution of Dijkstra's Concurrent Programming Problem," Communications of the A CM, Vol. 17, No. 8 (August 1974), pp. 453-455.

Digital Library

Google Scholar

[19]

L. Lamport, "Time, Clocks and the Ordering of Events in a Distributed System," Communications of the A CM, Vol. 21, No. 7 (July 1978), pp. 558-565.

Digital Library

Google Scholar

[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.

Google Scholar

[21]

J. Mellor-Crummey, "On-the-fly Detection of Data Races for Programs with Nested Fork-Join Parallelism," Supercomputing '91, pp. 24-33, November 1991.

Digital Library

Google Scholar

[22]

B. Neidecker-Lutz, electronic mail message, August 10, 1993.

Google Scholar

[23]

R. Netzer and B. Miller, "Improving the Accuracy of Data Race Detection," Proc. of the 3rd A CM Syrnpos#um on Principles and Practice of Parallel Programming, April 1991, pp. 133-144.

Digital Library

Google Scholar

[24]

R. Netzer and B. Miller, "What are Race Conditions? Some Issues and Formalizations," A CM Letters on Programming Languages and Systems, Vol. 1, No. 1 (March 1992), pp. 74-88.

Digital Library

Google Scholar

[25]

G. Peterson. "Myths About The Mutual Exclusion Problem," Information Proces#ing Letter#, Vol. 12, No. 3, June 1981, pp. 115-116.

Crossref

Google Scholar

[26]

G. Peterson and M. Fischer. "Economical Solutions for the Critical Section Problem in a Distributed System," Proc. of the 9th ACM Symposium on Theory of Computing, May 1977, pp. 91-97.

Digital Library

Google Scholar

[27]

M. Raynal, Algorithms for Mutual Exclus,on, MIT Press, 1986.

Digital Library

Google Scholar

[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.

Google Scholar

Cited By

View all

Flur SSarkar SPulte CNienhuis KMaranget LGray KSezgin ABatty MSewell P(2017)Mixed-size concurrency: ARM, POWER, C/C++11, and SCACM SIGPLAN Notices10.1145/3093333.300983952:1(429-442)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009839
Flur SSarkar SPulte CNienhuis KMaranget LGray KSezgin ABatty MSewell PCastagna GGordon A(2017)Mixed-size concurrency: ARM, POWER, C/C++11, and SCProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009839(429-442)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009839
Lugowski AKamil SBuluç AWilliams SDuriakova EOliker LFox AGilbert J(2015)Parallel processing of filtered queries in attributed semantic graphsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2014.08.01079:C(115-131)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2014.08.010
Show More Cited By

Index Terms

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

Recommendations

Finite Element Calculations at the Parallel Computers Intel/Paragon, IBM SP-2, and a Cluster of DEC-ALPHA Workstations
HIPC '96: Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)

In many natural and engineering science applications, systems of partial differential equations have to be solved. The finite element method represents an effective tool to solve these systems, but a disadvantage arises due to the very high computation ...
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors
SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

When using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his choice to the standard programming environments (MPI and OpenMP), he has a ...
The NYU Ultracomputer—designing a MIMD, shared-memory parallel machine (Extended Abstract)
ISCA '82: Proceedings of the 9th annual symposium on Computer Architecture

We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements. This machine uses an enhanced message switching network with the geometry of an Omega-network to approximate ...

Comments

Information & Contributors

Information

Published In

SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

August 1994

374 pages

ISBN:0897916719

DOI:10.1145/181014

Chairmen:
Lawrence Snyder
Univ. of Washington, Seattle
,
Charles E. Leiserson
Massachusetts Institute of Technology, Cambridge

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: 01 August 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

6SPAA94

Sponsor:

European Comp Soc
SIGACT
SIGARCH

6SPAA94: 6th Annual ACM Symposium on Parallel Algorithms and Architectures

June 27 - 29, 1994

New Jersey, Cape May, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
68
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)8

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Flur SSarkar SPulte CNienhuis KMaranget LGray KSezgin ABatty MSewell P(2017)Mixed-size concurrency: ARM, POWER, C/C++11, and SCACM SIGPLAN Notices10.1145/3093333.300983952:1(429-442)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009839
Flur SSarkar SPulte CNienhuis KMaranget LGray KSezgin ABatty MSewell PCastagna GGordon A(2017)Mixed-size concurrency: ARM, POWER, C/C++11, and SCProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009839(429-442)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009839
Lugowski AKamil SBuluç AWilliams SDuriakova EOliker LFox AGilbert J(2015)Parallel processing of filtered queries in attributed semantic graphsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2014.08.01079:C(115-131)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2014.08.010
Cheng SHigham LKawash J(2014)Partition consistencyDistributed Computing10.1007/s00446-013-0205-027:5(363-389)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s00446-013-0205-0
Kumarage HKhalil ITari ZZomaya A(2013)Distributed anomaly detection for industrial wireless sensor networks based on fuzzy data modellingJournal of Parallel and Distributed Computing10.1016/j.jpdc.2013.02.00473:6(790-806)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1016/j.jpdc.2013.02.004
Higham LKawash J(2008)Implementing sequentially consistent programs on processor consistent platformsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2007.07.00268:4(488-500)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1016/j.jpdc.2007.07.002
Higham LJackson LKawash J(2007)Specifying memory consistency of write buffer multiprocessorsACM Transactions on Computer Systems10.1145/1189736.118973725:1(1-es)Online publication date: 1-Feb-2007
https://dl.acm.org/doi/10.1145/1189736.1189737
Higham LJackson LKawash J(2006)Capturing register and control dependence in memory consistency models with applications to the itanium architectureProceedings of the 20th international conference on Distributed Computing10.1007/11864219_12(164-178)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.1007/11864219_12
Adir AAttiya HShurek G(2003)Information-Flow Models for Shared Memory with an Application to the PowerPC ArchitectureIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2003.119906714:5(502-515)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1109/TPDS.2003.1199067
Grammatikakis MLiesche S(2000)Priority Queues and Sorting Methods for Parallel SimulationIEEE Transactions on Software Engineering10.1109/32.84629826:5(401-422)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1109/32.846298
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Finite Element Calculations at the Parallel Computers Intel/Paragon, IBM SP-2, and a Cluster of DEC-ALPHA Workstations

Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors

The NYU Ultracomputer—designing a MIMD, shared-memory parallel machine (Extended Abstract)