AN ADAPTIVE PROGRAMMING
MODEL FOR FAULT TOLERANT DISTRIBUTED COMPUTING
abstract
The capability of dynamically adapting to distinct
runtime conditions is an important issue when designing distributed systems
where negotiated quality of service (QoS) cannot always be delivered between
processes.
Providing fault tolerance for such dynamic environments
is a challenging task.
Considering such a context, this paper proposes an
adaptive programming odel for fault-tolerant distributed computing, which
provides upper-layer applications with process state information according to
the current system synchrony (or QoS).
The underlying system model is hybrid, composed by a
synchronous part (where there are time bounds on processing speed and message
delay) and an asynchronous part (where there is no time bound).
However, such a composition can vary over time, and, in
particular, the system may become totally asynchronous (e.g., when the
underlying system QoS degrade) or totally synchronous.
Moreover, processes are not required to share the same
view of the system synchrony at a given time.
To illustrate what
can be done in this programming model and how to use it, the consensus problem
is taken as a benchmark problem.
This paper also presents an implementation of the model
that relies on a negotiated quality of service (QoS) for communication channels.
System Requirements
Software Requirements
Language : Java1.5
Front End Tool : Swing,
Operating System :
Windows XP.
Back
End : Sql Server
Hardware
Requirements
Processor : Intel Pentium III
Processor
Random Memory : 128MB
Hard Disk : 20GB
Processor Speed : 300 min
No comments:
Post a Comment