The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title:	Least space-time first scheduling algorithm : scheduling complex tasks with hard deadline on parallel machines
Author:	Cheng, Bo-Chao
View Online:	njit-etd1997-015 (xii, 89 pages ~ 4.8 MB pdf)
Department:	Department of Computer and Information Science
Degree:	Doctor of Philosophy
Program:	Computer Science
Document Type:	Dissertation
Advisory Committee:	Stoyenko, Alexander D. (Committee chair) Baruah, Sanjoy Kumar (Committee member) Ichikawa, Tadao (Committee member) Laplante, Phillip A. (Committee member) Liu, C. L. (Committee member) Marlowe, Thomas J. (Committee member) McHugh, James A. (Committee member) Ng, Peter A. (Committee member) Sha, Lui (Committee member)
Date:	1997-01
Keywords:	Real-Time Data Processing Computer Algorithms Computer Software--Development
Availability:	Unrestricted
Abstract:	Both time constraints and logical correctness are essential to real-time systems and failure to specify and observe a time constraint may result in disaster. Two orthogonal issues arise in the design and analysis of real-time systems: one is the specification of the system, and the semantic model describing the properties of real-time programs; the other is the scheduling and allocation of resources that may be shared by real-time program modules. The problem of scheduling tasks with precedence and timing constraints onto a set of processors in a way that minimizes maximum tardiness is here considered. A new scheduling heuristic, Least Space Time First (LSTF), is proposed for this NP-Complete problem. Basic properties of LSTF are explored; for example, it is shown that (1) LSTF dominates Earliest-Deadline-First (EDF) for scheduling a set of tasks on a single processor (i.e., if a set of tasks are schedulable under EDF, they are also schedulable under LSTF); and (2) LSTF is more effective than EDF for scheduling a set of independent simple tasks on multiple processors. Within an idealized framework, theoretical bounds on maximum tardiness for scheduling algorithms in general, and tighter bounds for LSTF in particular, are proven for worst case behavior. Furthermore, simulation benchmarks are developed, comparing the performance of LSTF with other scheduling disciplines for average case behavior. Several techniques are introduced to integrate overhead (for example, scheduler and context switch) and more realistic assumptions (such as inter-processor communication cost) in various execution models. A workload generator and symbolic simulator have been implemented for comparing the performance of LSTF (and a variant -- LSTF+) with that of several standard scheduling algorithms. LSTF's execution model, basic theories, and overhead considerations have been defined and developed. Based upon the evidence, it is proposed that LSTF is a good and practical scheduling algorithm for building predictable, analyzable, and reliable complex real-time systems. There remain some open issues to be explored, such as relaxing some current restrictions, discovering more properties and theorems of LSTF under different models, etc. We strongly believe that LSTF can be a practical scheduling algorithm in the near future.