Migration and rollback transparency for arbitrary distributed applications in workstation clusters
- Stefan PetriAffiliated withInstitute for Computer Engineering, Medical University at Lübeck
- , Matthias BolzeAffiliated withInstitute for Operating Systems and Computer Networks, Technical University Braunschweig
- , Horst Langendörfer
Programmers and users of compute intensive scientific applications often do not want to (or even cannot) code load balancing and fault tolerance into their programs.
The Beam system  uses a global virtual name space to provide migration and rollback transparency in user space for distributed groups of processes on workstations. The system calls are interposed and their parameters translated between the name spaces. Unlike other migration mechanisms, Beam does not require the applications to be written for a specific programming model or communication library.
In this paper we describe design and implementation of a separate system call interposition process  that accesses the application via the debugging interface. The main advantage of this approach is that it can handle even unmodified (e. g. commercially bought) application programs. We compare measured performance figures with previous similar approaches [15, 20].
- Migration and rollback transparency for arbitrary distributed applications in workstation clusters
- Book Title
- Parallel and Distributed Processing
- Book Subtitle
- 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing Orlando, Florida, USA, March 30 – April 3, 1998 Proceedings
- pp 159-170
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.