This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some Results of the Earliest Deadline Scheduling Algorithm
October 1989 (vol. 15 no. 10)
pp. 1261-1269

[1] J. Blazewicz, "Deadline scheduling of tasks--A survey,"Foundation Contr. Eng., pp. 203-216, 1977.
[2] R. H. Campbell, K. H. Horton, and G. G. Belford, "Simulation of a fault-tolerant deadline mechanism." inProc. FTCS-9, 1979, pp. 95-101.
[3] H. Chetto and M. Chetto, "On the acceptation of non-periodic time critical tasks indistributed systems," inProc. 7th IFAC Workshop Distribteted Computer Control Sytems (DCCS-86), Maychoss, West Germany, Oct. 30-Sept. 2, 1986.
[4] H. Chetto and M. Chetto, "How to insure feasibility in a distributed system for real time control," inHigh Performance Computer Systems, E. Gelenbe, Eds. Amsterdam, The Netherlands: North-Holland.
[5] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[6] M. J. Gonzales, "Deterministic processor scheduling,"ACM Comput. Surveys, vol. 9, no. 3, Sept. 1977.
[7] H. Hecht, "Fault-tolerant software for real-time applications,"ACM Comput. Surveys, vol. 8, no. 4, pp. 391-407, Dec. 1976.
[8] W. Horn, "Some simple scheduling algorithms,"Naval Res. Logist. Quart.vol. 21, pp. 177-185, 1974.
[9] Scientific Supercomputer Subcommittee, "Software for supercomputers,"Computer, vol. 21, no. 12, pp. 70-74, Dec. 1988.
[10] J. Labetoulle, "Some theorems on real time scheduling," inComputer Architectures and Networks, E. Gelenbe and R. Mahl, Eds. Amsterdam, The Netherlands: North-Holland, pp. 285-298.
[11] E. L. Lawler and C. U. Martel, "Scheduling periodically occurring tasks on multiple processors,"Inform. Processing Lett., vol. 12, no. 1, pp. 9-12, Feb. 1981.
[12] J. Y. T. Leung, and M. L. Merril, "A note on preemptive scheduling of periodic real-time tasks,"Inform. Processing Lett., vol. 20, no. 3, pp. 115-118, 1980.
[13] A. L. Liestman and R. H. Campbell, "A fault-tolerant scheduling problem,"IEEE Trans. Software Eng., vol. SE-12, no. 11, pp. 1089-1095, Nov. 1986.
[14] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[15] K. Ramamritham and J. Stankovic, "Dynamic task scheduling in hard real-time distributed systems,"IEEE Software, vol. 1, no. 3, pp. 65- 75, July 1984.
[16] B. Randell, P.A. Lee, and P.C. Treleaven, "Reliability Issues in Computer System Design,"ACM Computing Surveys, Vol. 28, No. 2, Apr. 1978, pp. 123-165.
[17] O. Serlin, "Scheduling of time critical processes," inProc. Spring Joint Computer Conf., 1972, pp. 925-932.
[18] A. Y. Wei, K. Hiraishi, R. Cheng, and R. H. Campbell, "Application of the fault-tolerant deadline mechanism to a satellite on-board computer system," inProc. FTCS-10, 1980, pp. 107-109.
[19] W. Zhao and K. Ramamritham. "Distributed scheduling using bidding and focussed addressing," inProc. Real-Time Systems Symp., San Diego, CA, Dec. 3-6, 1985, pp. 112-122.

Index Terms:
Deadline rnechanism; idle time; preemptive scheduling; real-time
Citation:
H. Chetto, M. Chetto, "Some Results of the Earliest Deadline Scheduling Algorithm," IEEE Transactions on Software Engineering, vol. 15, no. 10, pp. 1261-1269, Oct. 1989, doi:10.1109/TSE.1989.559777
Usage of this product signifies your acceptance of the Terms of Use.