Article

Free access

Decoupling synchronization and data transfer in message passing systems of parallel computers

Authors:

T. GrossAuthors Info & Claims

ICS '95: Proceedings of the 9th international conference on Supercomputing

Pages 1 - 10

https://doi.org/10.1145/224538.224539

Published: 03 July 1995 Publication History

PDF eReader

References

[1]

D. Adams. Cray T3D System Architecture Overview. Technical report, Cray Research Inc., September 1993. Revision 1.C.

Google Scholar

[2]

A. Bar-Noy and S. Kipnis. Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. In Symposium on Parallel Algorithms and Architectures, pages 13-22, San Diego, June 1992. ACM.

Digital Library

Google Scholar

[3]

R. Barriuso and Knies A. Shmem User's Guide for C. Technical report, Cray Research Inc., June 20 1994. Revision 2.1.

Google Scholar

[4]

A. Beguelin etal. A User{, Guide to PVM. Oak Ridge National Laboratories, Oak Ridge, TN, 1991.

Google Scholar

[5]

W.J. Dally and C.L. Seitz. Deadlock-Free Message Routing in Multiprocessor interconnection Networks. IEEE Trans. on Computers, C-36(5):547-553, May 1987.

Digital Library

Google Scholar

[6]

A. Feldmann, T. Stricker, and T. Warfel. Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches. In Proc. SPAA, pages 203-212. ACM, June 1993.

Digital Library

Google Scholar

[7]

T. Gross, D. O'Hallaron, and J. Subhlok. Task Parallelism in a High Performance Fortran Framework. IEEE Parallel and Distributed Technology, 2(3): 16-26, Fail 1994.

Digital Library

Google Scholar

[8]

S. Hinrichs, C. Kosak, D. O'Hallaron, T Stricker, and R. Take. An Architecture for Optimal All-to-AlI Personalized Communication. Technical Report CMU-CS-94-140, Carnegie Mellon University, School of Computer Science, 1994.

Digital Library

Google Scholar

[9]

Cray Research Inc. PVM and HENCE Programmer~ Manual. Mendota Heights, MN, manual v4 for release 1.1 edition, 1994. SR-2501-4.

Google Scholar

[10]

R. Numrich, P. Springer, and J. Peterson. Measurement of Communication Rates on the Cray T3D Interprocessor Network. In Proc. HPCN Europe '94, Vol. II, pages 150-157, Munich, April 1994. Springer Vefiag. Lecture Notes in Computer Science, Vol. 797.

Digital Library

Google Scholar

[11]

P. Pierce and G. Regnier. The Paragon Implementation of the NX Message Passing Interface. In Proc. Scalable High Performance Computing Conference, pages 184-190, Knoxville, TN, May 1994. IEEE Computer Society Press.

Crossref

Google Scholar

[12]

D. Pountain and D. May. A Tutorial Introduction to Occam Programming. BSP Professional Books, Oxford, GB, 1987.

Digital Library

Google Scholar

[13]

T Stricker and T Gross. Optimizing Memory System Performance for Communication in Parallel Computers. In Proc. 22nd Intl. Symposium on Computer Architecture, to appear, Santa Marguerita di Ligure, June 1995. ACM.

Digital Library

Google Scholar

[14]

T. Stricker, J. Stichnoth, D. O'Hallaron, S. Hinrichs, and T Gross. Decoupling Communication Services for Coalpiled Parallel Programs. Technical Report CMU-CS-94-139, Carnegie Mellon University, School of Computer Science, 1994.

Google Scholar

[15]

C. Thekkath, H. Levy, and E. Lazowska. Separating Data and Control Transfer in Distributed Operating Systems. In Proceedings of ASPLOS VI, pages 1-12, San Jose, October 1994. ACM.

Digital Library

Google Scholar

[16]

T. yon Eicken, D. Culler, S. Goldstein, and K. Schauser. Active Messages: A Mechanism for Integrated Communication and Computation. In Proc. 19th Intl. Conf. on Computer Architecture, pages 256-266, May 1992.

Digital Library

Google Scholar

[17]

D. Walker. The design of a standard message passing interface for distributed memory concurrent computers. Paralh:l Computing, 20(4):657-73, April 1994.

Digital Library

Google Scholar

Cited By

View all

Dinda PWang XWang JBeauchene CHetland CZhao MChandra ARamakrishnan L(2018)Hard real-time scheduling for parallel run-time systemsProceedings of the 27th International Symposium on High-Performance Parallel and Distributed Computing10.1145/3208040.3208052(14-26)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3208040.3208052
Xie J(2012)Implementation and performance optimization of a parallel contour line generation algorithmComputers & Geosciences10.1016/j.cageo.2012.06.01149(21-28)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1016/j.cageo.2012.06.011
Choudhary AKandemir M(2010)Compilation for Distributed Memory ArchitecturesThe Compiler Design Handbook10.1201/9781420040579.ch11Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch11
Show More Cited By

Index Terms

Recommendations

Cooperative Data Transfer: Fast Message-Passing on Shared-Memory Multiprocessors
Optimizing the Synchronization Operations in Message Passing Interface One-Sided Communication

One-sided communication in Message Passing Interface (MPI) requires the use of one of three different synchronization mechanisms, which indicate when the one-sided operation can be started and when the operation is completed. Efficient implementation of ...
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers

This paper considers the problem of creating message-passing protocols for parallel computers. It is assumed that the processors are connected by a network that provides guaranteed delivery of every message, provided that each message delivered ...

Comments

Information & Contributors

Information

Published In

ICS '95: Proceedings of the 9th international conference on Supercomputing

July 1995

448 pages

ISBN:0897917286

DOI:10.1145/224538

Chairman:
Mateo Valero
Univ. Polite`cnica de Catalunya

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: 03 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS95

Sponsor:

Univ Politecnica del Catalunya
SIGARCH
Oregon Graduate Institute

ICS95: 1995 International Conference on Supercomputing

July 3 - 7, 1995

Barcelona, Spain

Acceptance Rates

ICS '95 Paper Acceptance Rate 49 of 120 submissions, 41%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
451
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)6

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dinda PWang XWang JBeauchene CHetland CZhao MChandra ARamakrishnan L(2018)Hard real-time scheduling for parallel run-time systemsProceedings of the 27th International Symposium on High-Performance Parallel and Distributed Computing10.1145/3208040.3208052(14-26)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3208040.3208052
Xie J(2012)Implementation and performance optimization of a parallel contour line generation algorithmComputers & Geosciences10.1016/j.cageo.2012.06.01149(21-28)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1016/j.cageo.2012.06.011
Choudhary AKandemir M(2010)Compilation for Distributed Memory ArchitecturesThe Compiler Design Handbook10.1201/9781420040579.ch11Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch11
Chamberlain BChoi SSnyder L(2005)A compiler abstraction for machine independent parallel communication generationLanguages and Compilers for Parallel Computing10.1007/BFb0032698(261-276)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0032698
Dillon EGuyard JWantz G(2005)MeDLey: An abstract approach to message passingApplied Parallel Computing Industrial Computation and Optimization10.1007/3-540-62095-8_21(196-203)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-62095-8_21
Nanda MKarnik NLamont GHaddad HPapadopoulos GPanda B(2003)Synchronization analysis for decentralizing composite Web servicesProceedings of the 2003 ACM symposium on Applied computing10.1145/952532.952612(407-414)Online publication date: 9-Mar-2003
https://dl.acm.org/doi/10.1145/952532.952612
Kurmann CStricker T(2003)Zero-copy for CORBA - efficient communication for distributed object middlewareHigh Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on10.1109/HPDC.2003.1210011(4-13)Online publication date: 2003
https://doi.org/10.1109/HPDC.2003.1210011
Taufer MPerathoner ECavalli ACaflisch AStricker T(2002)Performance Characterization of a Molecular Dynamics Code on PC ClustersProceedings of the 16th International Parallel and Distributed Processing Symposium10.5555/645610.661547Online publication date: 15-Apr-2002
https://dl.acm.org/doi/10.5555/645610.661547
Taufer MPerathoner ECavalli ACaflisch AStricker T(2002)Performance characterization of a molecular dynamics code on PC clusters: is there any easy parallelism in CHARMM?Proceedings 16th International Parallel and Distributed Processing Symposium10.1109/IPDPS.2002.1015505(8 pp)Online publication date: 2002
https://doi.org/10.1109/IPDPS.2002.1015505
Chamberlain BDeitz SSnyder LTurcotte L(2000)A comparative study of the NAS MG benchmark across parallel languages and architecturesProceedings of the 2000 ACM/IEEE conference on Supercomputing10.5555/370049.370452(46-es)Online publication date: 1-Nov-2000
https://dl.acm.org/doi/10.5555/370049.370452
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

Cooperative Data Transfer: Fast Message-Passing on Shared-Memory Multiprocessors

Optimizing the Synchronization Operations in Message Passing Interface One-Sided Communication

Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers