IBM Journal of Research and Development
IBM Skip to main content
  Home     Products & services     Support & downloads     My account  

  Select a country  
Journals Home  
  Systems Journal  
Journal of Research
and Development
    Current Issue  
    Recent Issues  
    Papers in Progress  
    Search/Index  
    Orders  
    Description  
    Patents  
    Recent publications  
    Author's Guide  
  Staff  
  Contact Us  
  Related links:  
     IBM Research  

IBM Journal of Research and Development  
Volume 19, Number 5, Page 435 (1975)
Nontopical Issue
  Full article: arrowPDF   arrowCopyright info





   

Computation of Lower Bounds for Multiprocessor Schedules

by E. B. Fernandez, T. Lang
A multiprocessing system composed of identical units is considered. This system is executing a set of partially ordered tasks, with known execution times, using a non-preemptive scheduling strategy. Lower bounds on the number of processors required to compute the tasks before a deadline, and on the minimum time to execute the tasks with a fixed number of processors, are of great value for the determination of the corresponding optimal schedules. In this paper, methods for the efficient computation of the lower bounds obtained by Fernández and Bussell are discussed. Computational improvements for the case of general partial orders are reported, and further reductions of the number of operations are shown to be possible for special graphs (trees, independent chains, independent tasks).
Related Subjects: Analytical models; Operating systems