ACM Home Page
Please provide us with feedback. Feedback
Advanced collective communication in aspen
Full text PdfPdf (496 KB)
Source
International Conference on Supercomputing archive
Proceedings of the 22nd annual international conference on Supercomputing table of contents
Island of Kos, Greece
SESSION: Communication & synchronization 1 table of contents
Pages 83-93  
Year of Publication: 2008
ISBN:978-1-60558-158-3
Authors
Qasim Ali  Purdue University, West Lafayette, IN, USA
Vijay S. Pai  Purdue University, West Lafayette, IN, USA
Samuel P. Midkiff  Purdue University, West Lafayette, IN, USA
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 59,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1375527.1375543
What is a DOI?

ABSTRACT

Aspen is a programming language that relies on high-level messaging to support communication among different program tasks executing in parallel. Unlike MPI, the computational logic of Aspen tasks is specified and developed independently of the global communication structure of the program. A root module specifies the communication structure of the program. The semantics and generality of these specifications enable novel forms of collective communication, including asynchronous and concurrent collective operations and reduction type operations with subsets of the participants being receivers of the reduced data, and with receivers that do not provide data to the reduction. This paper describes efficient implementations of these and other collective communication operations in Aspen. We demonstrate the ease-of-use of these features using several code examples and quantify their performance impact through both microbenchmarks and a quantum chemistry code used in rubber chemistry. Aspen's performance is competitive with, or slightly better than, the performance of MPI implementations for both the chemistry application and the microbenchmarks.


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
29th TOP500 List, June 2007.
 
2
3
 
4
5
 
6
7
 
8
9
 
10
M. S. DeBergalis. A parallel file I/O API for Cilk. Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, May 2000.
 
11
A. Goyal, J. Cao, P. Patkar, G. Medvedev, S. P. Midkiff, V. Venkatasubramanian, and J. M. Caruthers. Population balance kinetic model for interaction of 2-bisbenzothiazole-2-2 disulfide (mbts) with sulfur. Rubber Chemistry and Technology , 2007. In press.
 
12
J. Gurd and W. Bohm. Implicit parallel processing: SISAL on the Manchester dataflow computer. In Proceedings of the IBM-Europe Institute on Parallel Programming, Aug. 1987.
 
13
14
 
15
J. Hoeflinger. Extending OpenMP to clusters, 2006.
 
16
17
18
 
19
20
 
21
 
22
R. Rabenseifner. Optimization of Collective Reduction Operations. In Proceedings of the International Conference on Computational Science , June 2004.
 
23
R. Thakur and W. Gropp. Improving the performance of collective operations in mpich. In 10th European PVM/MPI Users Group Conference (Euro PVN/MPI 2003) , September 2003.
24
 
25
UPC Consortium. UPC Language Specification (Version 1.2), June 2005.
 
26
N. Harvey and J. Morris. NL: A general purpose visual dataflow language. Australian Computer Journal, 12(1):2--12, 199622, 2007.
27
28
 
29
30
31
32
 
33
 
34
Jun Cao and Ayush Goyal and Samuel P. Midkiff and James M. Caruthers An Optimizing Compiler for Parallel Chemistry Simulations In 21th International Parallel and Distributed Processing Symposium (IPDPS 2007).

Collaborative Colleagues:
Qasim Ali: colleagues
Vijay S. Pai: colleagues
Samuel P. Midkiff: colleagues