Journal of Global Optimization

, Volume 9, Issue 3–4, pp 357–377 | Cite as

The master-slave paradigm in parallel computer and industrial settings

  • Sartaj Sahni
  • George Vairaktarakis


The master-slave paradigm finds important applications in parallel computer scheduling, semiconductor testing, machine scheduling, transportation, maintenance management and other industrial settings. In the master-slave model considered in this paper a set of jobs is to be processed by a system of processors. Each job consists of a preprocessing task, a slave task and a postprocessing task that must be executed in this order. The pre- and post-processing tasks are to be processed by a master processor while the slave task is processed by a slave processor. In this paper, we motivate the master-slave model and develop bounded performance approximation algorithms for the unconstrained makespan minimization problem as well as for multiple master systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Baker, Introduction to Sequencing and Scheduling, John Wiley, New York, 1974.Google Scholar
  2. [2]
    E. Coffman, Computer & Job/Shop Scheduling Theory, John Wiley, New York, 1976.Google Scholar
  3. [3]
    G. Chen and T. Lai, Preemptive scheduling of independent jobs on a hypercube, Information Processing Letters, 28, 201–206, 1988.Google Scholar
  4. [4]
    G. Chen and T. Lai, Scheduling independent jobs on partitionable hypercubes, Jr. of Parallel & Distributed Computing, 12, 74–78, 1991.Google Scholar
  5. [5]
    M. Dell'Amico, Shop problems with two machine and time lags, Operation Research, to appear.Google Scholar
  6. [6]
    M. Garey and D. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman and Co., New York, 1979.Google Scholar
  7. [7]
    R. Graham, E. Lawler, J. Lenstra, and A. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, 287–326, 1979.Google Scholar
  8. [8]
    S.M. Johnson, Discussion: Sequencing n jobs on two machines with arbitrary time lags, Management Science, 5, 299–303, 1959.Google Scholar
  9. [9]
    W. Kern and W. Nawijn, Scheduling multi-operation jobs with time lags on a single machine, University of Twente, 1993.Google Scholar
  10. [10]
    P. Krueger, T. Lai, and V. Dixit-Radiya, Job scheduling is more important than processor allocation for hypercube computers, IEEE Trans. on Parallel & Distributed Systems, 5, 5, 488–497, 1994.Google Scholar
  11. [11]
    C.-Y. Lee and G.L. Vairaktarakis, Minimizing makespan in hybrid flowshops, Operations Research Letters, 16, 149–158, 1994.Google Scholar
  12. [12]
    S. Leutenegger and M. Vernon, The performance of multiprogrammed multiprocessor scheduling policies, Proc. 1990 ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems, 226–236, 1990.Google Scholar
  13. [13]
    C.-Y. Lee, R. Uzsoy and L.A.M. Vega, Efficient algorithms for scheduling semiconductor burn-in operations, Operations Research, 40, 4, 764–775, 1992.Google Scholar
  14. [14]
    S. Majumdar, D. Eager, and R. Bunt, Scheduling in multiprogrammed parallel systems, Proc. 1988 ACM SIGMETRICS, 104–113, 1988.Google Scholar
  15. [15]
    C. McCreary, A. Khan, J. Thompson, and M. McArdle, A comparison of heuristics for scheduling DAGS on multiprocessors, 8th International Parallel Processing Symposium, 446–451, 1994.Google Scholar
  16. [16]
    L.G. Mitten, Sequencing n jobs on two machines with arbitrary time lags, Management Science, 5, 293–298, 1959.Google Scholar
  17. [17]
    A. Orman and C. Potts On the complexity of coupled-task scheduling, Discrete Applied Mathematics, To appear.Google Scholar
  18. [18]
    S. Sahni, Scheduling multipipeline and multiprocessor computers, IEEE Trans on Computers, C-33, 7, 637–645, 1984.Google Scholar
  19. [19]
    S. Sahni, Scheduling master-slave multiprocessor systems, Proceedings, First International EURO-PAR Conference, Lecture Notes In Computer Science, Vol. 966, Springer, 1995, pp 611–622.Google Scholar
  20. [20]
    W. Szwarc, On some sequencing problems, Naval Research Logistics Quarterly, 15, 127–155, 1968.Google Scholar
  21. [21]
    Y. Zhu and M. Ahuja, Preemptive job scheduling on a hypercube, Proc. 1990 International Conference on Parallel Processing, 301–304, 1990.Google Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Sartaj Sahni
    • 1
  • George Vairaktarakis
    • 2
  1. 1.Department of Computer and Information SciencesUniversity of FloridaGainesvilleUSA
  2. 2.College of Business Administration, Management DepartmentMarquette UniversityMilwaukeeUSA

Personalised recommendations