Preserving the consistency of distributed objects with real-time transactions
Article No.: 50, Pages 1 - 6
Abstract
In this paper, we study the problem of maintaining the consistency of distributed objects in real-time. Sporadic transactions sent by a set of clients must be processed by a set servers with a bounded end-to-end response time. We propose in this article a solution, following the state machine approach, based on a particular non-preemptive scheduling denoted EDF* (Earliest Deadline First *). The scheduling on the servers is based on timestamps set by the clients and on an end-to-end deadline to respect. The clock of clients and servers are ε synchronized. We establish in this article the feasibility conditions of the distributed real-time system that permits to grant the consistency of distributed objects and the respect of end-to-end deadlines associated to transactions in charge of read/write access to the objects.
References
[1]
L. George and P. Minet. A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints. 17th IEEE International Conference on Distributed Computing Systems, ICDCS '97, Baltimore, USA, May 1997.
[2]
L. George, N. Rivierre, and M. Spuri. Preemptive and non-preemptive scheduling real-time uniprocessor scheduling. INRIA Research Report, No. 2966, September 1996.
[3]
P. Bernstein, V. Hadzilacos, and N. Goodmann. Concurrency Control and Recovery in Database Systems. Addison Wesley Pub., ISBN 0-201-10715-5, p. 370, 1987.
[4]
G. Le Lann. A methodology for designing and dimensioning critical complex computing systems. IEEE Intl. symposium on the Engineering of Computer Based Systems, pp 332--339, March Friedrichshafen, Germany, 1996.
[5]
F. B Schneider, Implementing fault tolerant services using the state machine approach: a tutorial, ACM computing surveys, Vol 2, N4, December 1990.
[6]
K. Birman, T. Joseph, Reliable Communication in the Presence of Failures, ACM Trans. on Computer Systems, 5(1), pp47--76, February 1987.
[7]
J. M. Chang, N. Maxemchuck, Reliable Broadcast Protocols, ACM Trans. on Computer Systems, Vol. 2(3), pp251--273, August 1984.
[8]
V. Hadzilacos, S. Toueg, A modular approach to fault-tolerant broadcasts and related problems, Technical Report TR 94--1425, Ithaca, NY14853, May 1994.
[9]
J. Liu, Real-time systems, published by Prentice Hall, 2000.
[10]
J. Liu, W. Layland, Scheduling algorithms for multi-programming in a hard real time environment, Journal of ACM, Vol. 20, No 1, pp. 46--61, January 1973.
[11]
E. Anceaume, L. George, J. F. Hermant, G. Le Lann, P. Minet, N. Rivierre, "Algorithmique TR/TD/TF ORECA: spécifications des algorithmes et des oracles de faisabilité", Lot 3 du contrat DRET 94--395, 140 p., diffusion restreinte, Janvier 1996.
[12]
M. Fischer, N. Lynch, M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, Vol. 32(2), April 1985.
[13]
L. George, P. Minet, "A uniform reliable multicast protocol with guaranteed response times", Vol. 1474, pp 65--82, Lecture Notes in Computer Science, Springer-Verlag, October 1998.
[14]
S. Martin, "Maîtrise de la dimension temporelle de la qualité de service dans les réseaux", Thèse de l'université de Paris 12, Juillet 2004.
[15]
K. Jeffay, D. F. Stanat, C. U. Martel, On non-preemptive scheduling of periodic and sporadic tasks, IEEE Real-Time Systems Symposium, pp. 129--139, San Antonio, USA, December 1991.
[16]
S. Semghouni, L. Amantona, B. Sadeg, A. Berreda, On new scheduling policy for the improvement of firm RTDBSs performances, Data and Knowledge Engineering, Volume 63, Issue 2, November 2007.
[17]
J. R. Harjtsa, K. Ramamritham, R. Gupta, The PROMPT real-time commit protocol, Parallel and Distributed Systems, IEEE Transactions on Volume 11, Issue 2, Feb 2000.
[18]
J. Gray, Notes on database operating systems, Operating systems: an advanced course, Springer Verlag, 1978.
[19]
D. Skeen, Nonblocking commit protocols, Proc. ACM SIGMOD, Int. Conf. on Management of Data, June 1981.
Index Terms
- Preserving the consistency of distributed objects with real-time transactions
Recommendations
Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling
ECRTS '13: Proceedings of the 2013 25th Euromicro Conference on Real-Time SystemsA number of preemptive real-time scheduling algorithms, such as Earliest Deadline First (EDF), are known to be optimal on uni-processor systems under specified assumptions. However, no uni-processor optimal algorithm exists under the non-preemptive ...
An Analysis of EDF Schedulability on a Multiprocessor
A new schedulability test is derived for preemptive deadline scheduling of periodic or sporadic real-time tasks on a single-queue m-server system. The new test allows the task deadline to be more or less than the task period, and is based on a new ...
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
Real-Time Systems (Euromicro RTS-03)The priority-driven scheduling of periodic and sporadic task systems upon identical multiprocessor platforms is considered, under the restrictions that (i) each job may be assigned exactly one priority throughout its lifetime, and (ii) each job may ...
Comments
Information & Contributors
Information
Published In
June 2008
399 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Lyon 1 University
- SIGAPP: ACM Special Interest Group on Applied Computing
- Mairie de Villeurbanne
- Conseil Général du Rhône
- INSA Lyon: Institut National des Sciences Appliquées de Lyon
- Conseil Régional Rhône-Alpes
- Mutuelle d'assurance MAIF
- I.U.T.A LYON 1: Institute of Technology Lyon 1
- Ministère de l'Enseignement Supérieur et de la Recherche
- Lyon 2 University
- ISTASE: High-Level Engineering School in Telecommunication
- France Telecom
- LIRIS: Lyon Research Center for Images and Intelligent Information Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 June 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 86Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in