A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints

Authors:
L. George;P. Minet
Affiliations:
-;-
Venue:
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Year:
1997

Citing 0
Cited 4

Replica Consistency in Lazy Master Replicated Databases

Distributed and Parallel Databases
Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Preserving the consistency of distributed objects with real-time transactions

NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Scaling up the preventive replication of autonomous databases in cluster systems

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A solution for a hard real-time scheduling problem in a distributed system is designed and proved. The constraints of our problem are first to preserve consistency even in presence of concurrency and second to preserve the releases order of tasks, provided that tasks release times differ more than clock precision. That is achieved by a FIFO based scheduling. The feasibility conditions resulting from the worst-case response time analysis of each task set are given. The solution complexity is shown to be pseudo-polynomial.