Skip to main content
SpringerLink
Log in

The master-slave paradigm in parallel computer and industrial settings

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Baker, Introduction to Sequencing and Scheduling, John Wiley, New York, 1974.

    Google Scholar 

  2. E. Coffman, Computer & Job/Shop Scheduling Theory, John Wiley, New York, 1976.

    Google Scholar 

  3. G. Chen and T. Lai, Preemptive scheduling of independent jobs on a hypercube, Information Processing Letters, 28, 201–206, 1988.

    Google Scholar 

  4. G. Chen and T. Lai, Scheduling independent jobs on partitionable hypercubes, Jr. of Parallel & Distributed Computing, 12, 74–78, 1991.

    Google Scholar 

  5. M. Dell'Amico, Shop problems with two machine and time lags, Operation Research, to appear.

  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. 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. S.M. Johnson, Discussion: Sequencing n jobs on two machines with arbitrary time lags, Management Science, 5, 299–303, 1959.

    Google Scholar 

  9. W. Kern and W. Nawijn, Scheduling multi-operation jobs with time lags on a single machine, University of Twente, 1993.

  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. C.-Y. Lee and G.L. Vairaktarakis, Minimizing makespan in hybrid flowshops, Operations Research Letters, 16, 149–158, 1994.

    Google Scholar 

  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.

  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. S. Majumdar, D. Eager, and R. Bunt, Scheduling in multiprogrammed parallel systems, Proc. 1988 ACM SIGMETRICS, 104–113, 1988.

  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.

  16. L.G. Mitten, Sequencing n jobs on two machines with arbitrary time lags, Management Science, 5, 293–298, 1959.

    Google Scholar 

  17. A. Orman and C. Potts On the complexity of coupled-task scheduling, Discrete Applied Mathematics, To appear.

  18. S. Sahni, Scheduling multipipeline and multiprocessor computers, IEEE Trans on Computers, C-33, 7, 637–645, 1984.

    Google Scholar 

  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.

  20. W. Szwarc, On some sequencing problems, Naval Research Logistics Quarterly, 15, 127–155, 1968.

    Google Scholar 

  21. Y. Zhu and M. Ahuja, Preemptive job scheduling on a hypercube, Proc. 1990 International Conference on Parallel Processing, 301–304, 1990.

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, University of Florida, 32611, Gainesville, FL, USA

    Sartaj Sahni

  2. College of Business Administration, Management Department, Marquette University, 53233, Milwaukee, WI, USA

    George Vairaktarakis

Authors
  1. Sartaj Sahni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Vairaktarakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by the National Science Foundation under grant MIP-9103379 and the Army Research Office under grant DAA H04-95-1-0111.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sahni, S., Vairaktarakis, G. The master-slave paradigm in parallel computer and industrial settings. J Glob Optim 9, 357–377 (1996). https://doi.org/10.1007/BF00121679

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00121679

Keywords

Search

Navigation