Abstract
In this paper, taking an algorithmic viewpoint, we explore the differences existing between the class of non real-time computing problems (ℵℜ) versus the class of real-time computing problems (ℜ). We show how a problem in class ℜ can be transformed into its counterpart in class ℵℜ. Claims of real-time behavior made for solutions to problems in class ℵℜ are examined. An example of a distributed computing problem arising in class is studied, along with its solution. It is shown why off-line strategies or scheduling algorithms that are not driven by real-time/timeliness requirements ℜ are incorrect for class ℜ. Finally, a unified approach to conceiving and measuring the efficiency of solutions to problems in classes ℵℜ and ℜ is proposed and illustrated with a few examples.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, J. Aspnes, C. Dwork, O. Waarts, “A theory of competitive analysis for distributed algorithms”, 35th Symposium on Foundations of Computer Science, Nov. 1994, 401–411.
M. Abadi, L. Lamport, “An old-fashioned recipe for real-time”, ACM Trans. on Programming Languages and Systems, vol. 16, 5, Sept. 1994, 1543–1571.
S. Baruah et al., “On the competitiveness of on-line real-time task scheduling”, IEEE Real-Time Systems Symposium, Dec. 1991, 106–115.
Y. Bartal et al., “New algorithms for an ancient scheduling problem”, 24th ACM STOC, May 1992, 51–58.
H. Brit, S. Moran, “Wait-freedom vs. bounded wait-freedom in public data structures”, Proc. of the 13th ACM Symp. on Principles of Distributed Computing, Aug. 1994, 52–60.
T. Chandra, V. Hadzilacos, S. Toueg, “The weakest failure detector for solving consensus”, Proc. of the 11th ACM Symp. on Principles of Distributed Computing, Aug. 1992, 147–158.
T. Chandra, V. Hadzilacos, S. Toueg, “Impossibility of group membership in asyncronous systems”, in preparation.
T. Chandra, S. Toueg, “Unreliable failure detectors for asynchronous systems”, Proc. of the 10th ACM Symp. on Principles of Distributed Computing, Aug. 1991, 325–340.
D. Dolev, C. Dwork, L. Stockmeyer, “On the minimal synchronism needed for distributed consensus”, Journal of the ACM, vol. 34, 1, Jan. 1987, 77–97.
X. Deng, C.H. Papadimitriou, “Competitive distributed decision-making”, 12th IFIP Congress (Elsevier North-Holland Pub.), vol. 1, 1992, 350–355.
M. Fischer, N. Lynch, M. Paterson, “Impossibility of distributed consensus with one faulty process”, Journal of the ACM, vol. 32, 2, April 1985, 374–382.
L. George, P. Mühlethaler, N. Rivierre, “Optimality and non-preemptive real-time scheduling revisited”, INRIA Research Rep. n 2516, March 1995.
M.P. Herlihy, “Impossibility and universality results for wait-free synchronization”, Proc. of the 7th ACM Symp. on Principles of Distributed Computing, Aug. 1988, 276–290.
J.F. Hermant, G. Le Lann, N. Rivierre, “A general approach to real-time message scheduling over distributed broadcast channels, to appear in Proc. of the IEEE/INRIA Conf. on Emerging Technologies and Factory Automation, Oct. 1995.
K. Jeffay, D.F. Stanat, C.U., Martel, “On non-preemptive scheduling of periodic and sporadic tasks”, IEEE Real-Time Systems Symposium, San-Antonio, Dec. 1991, 129–139.
H. Kopetz, P. Verissimo, “Real-time and dependability concepts”, in Distributed Systems, chapter 16, S.J. Mullender Ed. (Addison-Wesley Pub.), 1993.
C.L. Liu, J.W. Layland, “Scheduling algorithms for multiprogramming in a hard real-time environment”, Journal of the ACM, vol. 20, 1, Jan. 1973, 46–61.
G. Le Lann, “Scheduling in critical real-time systems: a manifesto”, Third Intl. Symp. on Formal Techniques in Real-Time and Fault-Tolerant systems, Lübeck (D), Sept. 1994, Lecture Notes in Computer Science n 863 (Springer-Verlag pub.), 511–528.
G. Le Lann, N. Rivierre, “Real-time communication over broadcast networks: the CSMA-DCR and the DOD/CSMA-CD protocols”, INRIA Research Rep. n 1863, March 1993, 35 p.
L. Lamport, R. Shostak, M. Pease, “The Byzantine generals problem”, ACM Trans. on Programming Lang. and Syst., vol. 4, 3, July 1982, 382–401.
N. Malcolm, W. Zhao, “Hard real-time communication in multiple-access networks”, Journal of Real-Time Systems (Klüwer Academic Pub.), vol. 8, 1, Jan. 1995, 35–77.
L. Sha, S.S. Sathaye, “A systematic approach to designing distributed real-time systems”, IEEE Computer, Sept. 1993, 68–78.
D.D. Sleator, R.E. Tarjan, “Amortized efficiency of list update and paging rules”, Com. of the ACM, vol. 28, 2, Feb. 1985, 202–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Lann, G. (1995). On real-time and non real-time distributed computing. In: Hélary, JM., Raynal, M. (eds) Distributed Algorithms. WDAG 1995. Lecture Notes in Computer Science, vol 972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022137
Download citation
DOI: https://doi.org/10.1007/BFb0022137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60274-3
Online ISBN: 978-3-540-44783-2
eBook Packages: Springer Book Archive