ACM Home Page
Please provide us with feedback. Feedback
Mobile MPI programs in computational grids
Full text PdfPdf (188 KB)
Source Principles and Practice of Parallel Programming archive
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming table of contents
New York, New York, USA
SESSION: Communication table of contents
Pages: 22 - 31  
Year of Publication: 2006
ISBN:1-59593-189-9
Authors
Rohit Fernandes  Cornell University, Ithaca, NY
Keshav Pingali  Cornell University, Ithaca, NY
Paul Stodghill  Cornell University, Ithaca, NY
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 78,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: 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/1122971.1122977
What is a DOI?

ABSTRACT

Utility computing is becoming a popular way of exploiting the potential of computational grids. In utility computing, users are provided with computational power in a transparent manner similar to the way in which electrical utilities supply power to their customers. To take full advantage of utility computing, an application needs to be mobile; that is, it needs to be able to migrate between heterogeneous computing platforms while it is executing. Further, it needs to be able to adapt to the computing resources at each site, such as the number of available physical processors. At present, there are few high-performance computing applications of this sort, and re-engineering legacy codes to be mobile can take enormous effort.In this paper, we describe theph$PC^3$ system, which converts C/MPI codes into mobile programs almost transparently. Because it is based on portable application-level checkpointing, it enables the state of running applications to be saved so that the application can be restarted on different architectures, operating systems and MPI implementations. Moreover, the number of processors on these machines can be different. To our knowledge, this is the first system to provide all these features. Experimental results show that the overhead introduced by the system is usually small.


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
2
3
 
4
 
5
Tom Goodale, Gabrielle Allen, Gerd Lanfermann, Joan Massó, Thomas Radke, Edward Seidel, and John Shalf. The Cactus Framework and Toolkit: Design and Applications. In VECPAR, 2002.
 
6
Chao Huang, Orion Lawlor, and L. V. Kale. Adaptive MPI. In Languages and Compilers for Parallel Computers (LCPC), 2003.
 
7
 
8
 
9
 
10
M. Elnozahy, L. Alvisi, Y. M. Wang, and D. B. Johnson. A Survey of Rollback-recovery Protocols in Message Passing Systems. Technical Report CMU-CS-96-181, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA, October 1996.
 
11
J. Basney M. Litzkow, T. Tannenbaum and M. Livny. Checkpoint and Migration of UNIX Processes in the Condor Distributed Processing System. Technical Report 1346, University of Wisconsin-Madison, 1997.
 
12
NASA. NAS Parallel Benchmarks. http://www.nas.nasa.gov/Software/NPB/.
 
13
James S. Plank, Micah Beck, Wael R. Elwasif, Terry Moore, Martin Swany, and Rich Wolski. The Internet Backplane Protocol: Storage in the Network. In NetStore99: The Network Storage Symposium, Seattle, WA, 1999.
 
14
 
15
 
16
 
17
18
 
19
S. Vadhiyar and J. Dongarra. SRS - A Framework for Developing Malleable and Migratable Parallel Software. Parallel Processing Letters, 13(2):291--312, June 2003.


Collaborative Colleagues:
Rohit Fernandes: colleagues
Keshav Pingali: colleagues
Paul Stodghill: colleagues