In this paper, we have presented an efficient non-blocking coordinated checkpointing algorithm for distributed systems. The distinct advantages of the proposed algorithm are the following. It produces a consistent set of checkpoints, without the overhead of taking temporary checkpoints; the algorithm also makes sure that only few processes are required to take checkpoints in its any execution; ...

We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised. The supervisory controller is state feedback and disables discrete-event transitions in order to solve the non-blocking forbidden state problem. The non-blocking problem is defined under both strong and wea...

Necessary and su cient conditions for hybrid automata to be non-blocking and deterministic (local existence and uniqueness of executions, respectively) are developed. The problem of global existence of executions is discussed in the context of Zeno hybrid automata, that is, hybrid automata that can exhibit in nitely many discrete transitions in nite time.

As mobile clients travel, their costs to reach home filing services change, with serious performance implications. Current file systems mask these performance problems by reducing the safety of updates, their visibility, or both. This is the result of combining the propagation and notification of updates from clients to servers. Fluid Replication separates these mechanisms. Client updates are s...

In this paper, we define k-abortable objects, the first kind of abortable objects [2,7] that guarantee some degree of progress even under high contention. The definition is simple and natural: intuitively, an operation on a k-abortable object can abort only if k operations from distinct processes succeed during the execution of the aborted operation. We first show that k-abortable objects can e...

Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predicates. Stream queries are modeled as functions from streams to streams. Both timed and untimed settings are considered. Issues investigated include abstract definitions of computability of stream queries; the connection ...

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3 an inherent trade-off between the fast abort property of NBAC, i.e., aborting a transaction as soon as possible if some process votes “no,” and the fast commit property, i.e., committing a transactio...

A non-blocking supervisory control problem to meet bounded time constraints for nondeterministic real-time discrete event systems (DESs) is addressed. To this end, notions of trace controllability and time controllability are introduced for the non-deterministic real-time DESs with respect to a timed language specification representing a bounded time constraint. The existence conditions of a no...