Skip to main content
SpringerLink
Log in

Scheduling multiple divisible loads in homogeneous star systems

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper we analyze scheduling multiple divisible loads on a star-connected system of identical processors. It is shown that this problem is computationally hard. Some special cases appear to be particularly difficult, so it is not even known if they belong to the class NP. Exponential algorithms and special cases solvable in polynomial time are presented.

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

  • Bharadwaj, V., Ghose, D., Mani, V., & Robertazzi, T. (1996). Scheduling divisible loads in parallel and distributed systems. Los Alamitos: IEEE Computer Society Press.

    Google Scholar 

  • Drozdowski, M. (1997). Monographs : Vol. 321. Selected problems of scheduling tasks in multiprocessor computer systems. Poznan University of Technology Press: Poznan. Downloadable from http://www.cs.put.poznan.pl/mdrozdowski/txt/h.ps.

    Google Scholar 

  • Drozdowski, M., Lawenda, M., & Guinand, F. (2006). Scheduling multiple divisible loads. International Journal of High Performance Computing, 20(1), 19–30.

    Article  Google Scholar 

  • England, D., Veeravalli, B., & Weissman, J. B. (2007). A robust spanning tree topology for data collection and dissemination in distributed environments. IEEE Transactions on Parallel and Distributed Systems, 18(5), 608–620.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman.

    Google Scholar 

  • Robertazzi, T. (2003). Ten reasons to use divisible load theory. IEEE Computer, 36(5), 63–68.

    Google Scholar 

  • Rothkopf, M. H. (1966). Scheduling independent tasks on parallel processors. Management Science, 12, 347–447.

    Google Scholar 

  • Sohn, J., & Robertazzi, T. (1994). A muli-job load sharing strategy for divisible jobs on bus networks (Technical Report 697). Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, New York.

  • Veeravalli, B., & Barlas, G. (2002). Efficient scheduling strategies for processing multiple divisible loads on bus networks. Journal of Parallel and Distributed Computing, 62, 132–151.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965, Poznań, Poland

    M. Drozdowski

  2. Poznań Supercomputing and Networking Center, Noskowskiego 10, 61-704, Poznań, Poland

    M. Lawenda

Authors
  1. M. Drozdowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Lawenda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Drozdowski.

Additional information

M. Drozdowski’s research partially supported by Polish Ministry of Science and Higher Education.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drozdowski, M., Lawenda, M. Scheduling multiple divisible loads in homogeneous star systems. J Sched 11, 347–356 (2008). https://doi.org/10.1007/s10951-007-0051-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-007-0051-7

Keywords

Search

Navigation