Research in Real-Time Scheduling

In this paper we give a survey of our recent work in real-time scheduling. This includes message routing in distributed real-time systems, minimizing mean flow time and number of late tasks in the imprecise computation model, developing efficient feasibility tests, on-line scheduling of real-time tasks, minimizing number of late tasks in the classical task system model, developing and analyzing a new model of task system that can incorporate parallel algorithms, minimizing mean flow time with release time and precedence constraints, and a host of other scheduling problems. Our work has focused on the study of complexity results, efficient algorithms, worst-case analysis of fast heuristics, and possibility and impossibility results for the existence of optimal on-line algorithms.

[1]  Charles U. Martel,et al.  Scheduling Periodically Occurring Tasks on Multiple Processors , 1981, Inf. Process. Lett..

[2]  Sartaj Sahni,et al.  Nearly On Line Scheduling of a Uniform Processor System with Release Times , 1979, SIAM J. Comput..

[3]  Joseph Y.-T. Leung,et al.  Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length , 1989, SIAM J. Discret. Math..

[4]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[5]  Joseph Y.-T. Leung,et al.  Minimizing Schedule Length Subject to Minimum Flow Time , 1989, SIAM J. Comput..

[6]  Joseph Y.-T. Leung,et al.  Minimizing Mean Flow Time with Release Time Constraint , 1990, Theor. Comput. Sci..

[7]  Jane W.-S. Liu,et al.  Algorithms for scheduling periodic jobs to minimize average error , 1988, Proceedings. Real-Time Systems Symposium.

[8]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[9]  Wei-Kuan Shih,et al.  Scheduling tasks with ready times and deadlines to minimize average error , 1989, OPSR.

[10]  Jane W.-S. Liu,et al.  Scheduling Periodic Jobs That Allow Imprecise Results , 1990, IEEE Trans. Computers.

[11]  C. Y. Liu,et al.  On the complexity of preemptive open-shop scheduling problems , 1985 .

[12]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[13]  Wei Kuan Shih,et al.  Fast algorithms for scheduling imprecise computations , 1989, RTSS 1989.

[14]  D. Teichroew,et al.  Optimal Short Term Financing Decision , 1965 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on a Single Machine with Precedence Constraints , 1990, INFORMS J. Comput..

[17]  Joseph Y.-T. Leung,et al.  On-line routing of real-time messages , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[18]  Jane W.-S. Liu,et al.  Imprecise Results: Utilizing Partial Comptuations in Real-Time Systems , 1987, RTSS.

[19]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[20]  B. J. Lageweg,et al.  Computer aided complexity classification of deterministic scheduling problems , 1981 .

[21]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

[22]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[23]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

[24]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[25]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[26]  Joseph Y.-T. Leung,et al.  Preemptive Scheduling to Minimize Mean Weighted Flow Time , 1990, Inf. Process. Lett..

[27]  Joseph Y.-T. Leung,et al.  Minimizing the number of late jobs on unrelated machines , 1991, Oper. Res. Lett..

[28]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[29]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[30]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[31]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[32]  E. L. Lawler,et al.  Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs : (preprint) , 1979 .

[33]  Jane W.-S. Liu,et al.  Scheduling Real-Time, Periodic Jobs Using Imprecise Results , 1987, RTSS.

[34]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[35]  Joseph Y.-T. Leung,et al.  Minimizing the number of late tasks with error constraint , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[36]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..