Checkpointing distributed applications on mobile computers

Arup Acharya, Badri Nath

Research output: Contribution to conferencePaper

100 Citations (Scopus)

Abstract

The integration of mobile/portable computing devices within existing data networks can be expected to spawn distributed applications that execute on mobile hosts (MHs). For reliability, it is vital that the global state of such applications be checkpointed from time to time. A global checkpoint consists of a set of local checkpoints, one per participant. This paper first identifies the problems in recording a consistent global state of mobile distributed applications. The location of a MH within the static network varies with time and therefore, a MH will first need to be located ('searched') in order to obtain its local checkpoint. Moreover, MHs often (voluntarily) disconnect from the network; a disconnected MH is not reachable from the rest of the network. This means that a (disconnected) MH may not be available to provide its local checkpoint. Lastly, a MH is not equipped with stable storage; disk space at a MH is not considered stable due to vulnerability of MHs to loss, theft and physical damage. Therefore, an alternative stable repository is required to save local checkpoints of MHs. This paper presents a checkpointing algorithm for MHs that satisfies these constraints.

Original languageEnglish (US)
Pages73-80
Number of pages8
StatePublished - Dec 1 1994
EventProceedings of the 3rd International Conference on Parallel and Distributed Information Systems - Austin, TX, USA
Duration: Sep 28 1994Sep 30 1994

Other

OtherProceedings of the 3rd International Conference on Parallel and Distributed Information Systems
CityAustin, TX, USA
Period9/28/949/30/94

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Acharya, A., & Nath, B. (1994). Checkpointing distributed applications on mobile computers. 73-80. Paper presented at Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems, Austin, TX, USA, .
Acharya, Arup ; Nath, Badri. / Checkpointing distributed applications on mobile computers. Paper presented at Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems, Austin, TX, USA, .8 p.
@conference{af5ea0de549445e888b10498d9b0666b,
title = "Checkpointing distributed applications on mobile computers",
abstract = "The integration of mobile/portable computing devices within existing data networks can be expected to spawn distributed applications that execute on mobile hosts (MHs). For reliability, it is vital that the global state of such applications be checkpointed from time to time. A global checkpoint consists of a set of local checkpoints, one per participant. This paper first identifies the problems in recording a consistent global state of mobile distributed applications. The location of a MH within the static network varies with time and therefore, a MH will first need to be located ('searched') in order to obtain its local checkpoint. Moreover, MHs often (voluntarily) disconnect from the network; a disconnected MH is not reachable from the rest of the network. This means that a (disconnected) MH may not be available to provide its local checkpoint. Lastly, a MH is not equipped with stable storage; disk space at a MH is not considered stable due to vulnerability of MHs to loss, theft and physical damage. Therefore, an alternative stable repository is required to save local checkpoints of MHs. This paper presents a checkpointing algorithm for MHs that satisfies these constraints.",
author = "Arup Acharya and Badri Nath",
year = "1994",
month = "12",
day = "1",
language = "English (US)",
pages = "73--80",
note = "Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems ; Conference date: 28-09-1994 Through 30-09-1994",

}

Acharya, A & Nath, B 1994, 'Checkpointing distributed applications on mobile computers' Paper presented at Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems, Austin, TX, USA, 9/28/94 - 9/30/94, pp. 73-80.

Checkpointing distributed applications on mobile computers. / Acharya, Arup; Nath, Badri.

1994. 73-80 Paper presented at Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems, Austin, TX, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Checkpointing distributed applications on mobile computers

AU - Acharya, Arup

AU - Nath, Badri

PY - 1994/12/1

Y1 - 1994/12/1

N2 - The integration of mobile/portable computing devices within existing data networks can be expected to spawn distributed applications that execute on mobile hosts (MHs). For reliability, it is vital that the global state of such applications be checkpointed from time to time. A global checkpoint consists of a set of local checkpoints, one per participant. This paper first identifies the problems in recording a consistent global state of mobile distributed applications. The location of a MH within the static network varies with time and therefore, a MH will first need to be located ('searched') in order to obtain its local checkpoint. Moreover, MHs often (voluntarily) disconnect from the network; a disconnected MH is not reachable from the rest of the network. This means that a (disconnected) MH may not be available to provide its local checkpoint. Lastly, a MH is not equipped with stable storage; disk space at a MH is not considered stable due to vulnerability of MHs to loss, theft and physical damage. Therefore, an alternative stable repository is required to save local checkpoints of MHs. This paper presents a checkpointing algorithm for MHs that satisfies these constraints.

AB - The integration of mobile/portable computing devices within existing data networks can be expected to spawn distributed applications that execute on mobile hosts (MHs). For reliability, it is vital that the global state of such applications be checkpointed from time to time. A global checkpoint consists of a set of local checkpoints, one per participant. This paper first identifies the problems in recording a consistent global state of mobile distributed applications. The location of a MH within the static network varies with time and therefore, a MH will first need to be located ('searched') in order to obtain its local checkpoint. Moreover, MHs often (voluntarily) disconnect from the network; a disconnected MH is not reachable from the rest of the network. This means that a (disconnected) MH may not be available to provide its local checkpoint. Lastly, a MH is not equipped with stable storage; disk space at a MH is not considered stable due to vulnerability of MHs to loss, theft and physical damage. Therefore, an alternative stable repository is required to save local checkpoints of MHs. This paper presents a checkpointing algorithm for MHs that satisfies these constraints.

UR - http://www.scopus.com/inward/record.url?scp=0028593260&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028593260&partnerID=8YFLogxK

M3 - Paper

SP - 73

EP - 80

ER -

Acharya A, Nath B. Checkpointing distributed applications on mobile computers. 1994. Paper presented at Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems, Austin, TX, USA, .