DocumentCode
2940992
Title
NAP: practical fault-tolerance for itinerant computations
Author
Johansen, Dag ; Marzullo, Keith ; Schneider, Fred B. ; Jacobsen, Kjetil ; Zagorodnov, D.
Author_Institution
Dept. of Comput. Sci., Tromso Univ., Norway
fYear
1999
fDate
1999
Firstpage
180
Lastpage
189
Abstract
One use of mobile agents is support for itinerant computation (D. Chess et al., 1995). An itinerant computation is a program that moves from host to host in a network. Which hosts the program visits is determined by the program. The program can have a pre-defined itinerary or can dynamically compute the next host to visit as it visits each successive host; it can visit the same host repeatedly or it can even create multiple concurrent copies of itself on a single host. Itinerant computations are susceptible to processor failures, communications failures, and crashes due to program bugs. NAP is a protocol for supporting fault tolerance in itinerant computations. It employs a form of failure detection and recovery, and it generalizes the primary backup approach to a new computational model. The guarantees offered by NAP as well as an implementation for NAP in TACOMA are discussed
Keywords
fault tolerant computing; mobile computing; protocols; system recovery; NAP; TACOMA; communications failures; compuational model; failure detection; itinerant computations; mobile agents; multiple concurrent copies; practical fault tolerance; primary backup approach; processor failures; Computer bugs; Computer crashes; Computer networks; Computer science; Fault tolerance; Jacobian matrices; Local area networks; Mobile agents; Programming profession; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on
Conference_Location
Austin, TX
ISSN
1063-6927
Print_ISBN
0-7695-0222-9
Type
conf
DOI
10.1109/ICDCS.1999.776519
Filename
776519
Link To Document