This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations
February 1993 (vol. 19 no. 2)
pp. 139-154

The author presents a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline. A given set of precedence relations and a given set of exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion relations on multiprocessors in hard-real-time systems.

[1] J. Blazewicz, "Deadline scheduling of tasks with ready times and resource constraints,"Inform. Proc. Lett., vol. 8, pp. 60-63, Feb. 1979.
[2] J. Blazewicz, J. K. Lenstra, and A. H. G. R. Kan, "Scheduling subject to resource constraints: Classification and complexity,"Discrete Appl. Math., vol. 5, pp. 11-24, 1983.
[3] P. Bratley, M. Florian, and P. Robillard, "Scheduling with earliest start and due date constraints,"Nav. Res. Log. Quart., vol. 18, pp. 511-519, Dec. 1971.
[4] E. G. Coffman, Jr.,Computer and jobshop scheduling theory. New York: Wiley-Interscience, 1976.
[5] S. R. Faulk and D. L. Parnas, "On synchronization in hard-real-time systems,"Commun. ACMvol. 31, no. 3, Mar. 1988.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[7] M. J. Gonzales, "Deterministic processor scheduling,"ACM Comput. Surveys, vol. 9, no. 3, Sept. 1977.
[8] D. Gunsfield, "Bounds for naive multiple machine scheduling with release times and deadlines,"J. Algorithms, vol. 5, pp. 1-6, 1984.
[9] E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Recent developments in deterministic sequencing and scheduling: a survey," inProc. NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, Durham, England inDeterministic and stochastic scheduling. M. A. H. Dempsteret al., Eds., Dordrecht: D. Reidal Publ. Co., July 1981.
[10] D. W. Leinbaugh, "Guaranteed response time in a hard real-time environment,"IEEE Trans. Software Eng., vol. SE-6, pp. 85-91, Jan. 1980.
[11] G. K. Manacher, "Production and stabilization of real-time task schedules,"J. Ass. Comput. Mach., vol. 14, July 1967.
[12] C. Martel, "Preemptive scheduling with release times, deadlines, and due times,"J. ACM, vol. 29, no. 3, pp. 812-829, July 1982.
[13] A. K. Mok and M. L. Detouzos, "Multiprocessor scheduling in a hard real-time environment," inProc. 7th IEEE Texas Conf. on Computing Systems, Nov. 1978.
[14] A. K. Mok, "Fundamental design problems of distributed systems for the hard-real-time environment," Ph.D thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, May 1983.
[15] A. K. Mok, "The design of real-time programming systems based on process models," inProc. IEEE Real-Time Systems Symp., Dec. 1984.
[16] B. Simons, "Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines,"SIAM J. Comput., vol. 12, pp. 294-299, May 1983.
[17] J. Xu and D. L. Parnas, "Scheduling processes with release times, deadlines, precedence, and exclusion relations,"IEEE Trans. Software Eng., vol. 16, pp. 360-369, Mar. 1990.
[18] J. Xu and D. L. Parnas, "On satisfying timing constraints in hard-real-time systems,"IEEE Trans. Software Eng., vol. 19, no. 1, pp. 70-84, Jan. 1993.
[19] J. Xu and D. L. Parnas, "Pre-run-time scheduling of processes with exclusion relations on nested or overlapping critical sections," inProc. 11th Annu. IEEE Int. Phoenix Conf. on Computers and Communications (IPCCC-92), Scottsdale, AZ, April 1-3, 1992, pp. 774-782.
[20] W. Zhao, K. Ramamritham, and J. Stankovic, "Scheduling tasks with resource requirements in hard real-time systems,"IEEE Trans. Software Eng., vol. SE-13, pp. 564-577, May 1987.
[21] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints,"IEEE Trans. Comput., Aug. 1987.

Index Terms:
multiprocessor scheduling; release times; deadlines; precedence; exclusion relations; nonpreemptive schedule; automated pre-run-time scheduling; hard-real-time systems; multiprocessing systems; real-time systems; scheduling
Citation:
J. Xu, "Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations," IEEE Transactions on Software Engineering, vol. 19, no. 2, pp. 139-154, Feb. 1993, doi:10.1109/32.214831
Usage of this product signifies your acceptance of the Terms of Use.