Skip to main content
Springer Nature Link
Log in

Distributing and scheduling divisible task on parallel communicating processors

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper we propose a novel scheme for scheduling divisible task on parallel processors connected by system interconnection network with arbitrary topology. The divisible task is a computation that can be divided into arbitrary independent subtasks solved in parallel. Our model takes into consideration communication initial time and communication delays between processors. Moreover, by constructing the corresponding Network Spanning Tree (NST) for a network, our scheme can be applied to all kinds of network topologies. We present the concept of Balanced Task Distribution Tree and use it to design the Equation Set Creation Algorithm in which the set of linear equations is created by traversing the NST in post-order. After solving the created equations, we get the optimal task assignment scheme. Experiments confirm the applicability of our scheme in real-life situations

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Blazewicz J, Drozdowski M, Markiewicz M. Divisible task scheduling — Concept and verification.Parallel Computing, 1999, 25: 87–98.

    Article  MATH  MathSciNet  Google Scholar 

  2. Drozdowski M. Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems. Poznan University of Technology Press, 1997.

  3. Culler D Eet al. LogP: A practical model of parallel computation.Communications of the ACM, 1996, 39(11): 78–85.

    Article  Google Scholar 

  4. Mani V, Ghose D. Distributed computation in linear networks: Closed-form solutions.IEEE Transactions on Aerospace and Electronic Systems, 1994, 30(2): 471–483.

    Article  Google Scholar 

  5. Bharadwaj V, Ghose D, Mani V. Optimal sequencing and arrangement in distributed single-level tree networks with communication delays.IEEE Transactions on Parallel and Distributed Systems, 1994, 5(9): 968–976.

    Article  Google Scholar 

  6. Bataineh S, Hsiung T, Robertazzi T G. Closed form solutions for bus and tree networks of processors.IEEE Transactions on Computers, 1994, 43(10): 1184–1196.

    Article  MATH  Google Scholar 

  7. Blazewicz J, Drozdowski M. Scheduling divisible jobs with communication startup costs.Discrete Applied Mathematics, 1997, 76(1–3).

  8. Park J L, Choi H. Circuit-switched broadcasting in torus mesh networks.IEEE Transactions on Parallel and Distributed Systems, 1996, 7(2): 184–190.

    Article  Google Scholar 

  9. Blazewicz J, Drozdowski M. Performance limits of two-dimensional network of load-sharing processors.Foundations of Computing and Decision Sciences, 1996, 21(1): 3–15.

    MATH  MathSciNet  Google Scholar 

  10. Drozdowski M, Glazek W. Scheduling divisible loads in a three-dimensional mesh of processors.Parallel Computing, 1999, 25: 381–404.

    Article  MATH  MathSciNet  Google Scholar 

  11. Blazewicz J, Drozdowski M. Scheduling divisible jobs on hypercubes.Parallel Computing, 1995, 21: 1945–1956.

    Article  MathSciNet  Google Scholar 

  12. Blazewicz J, Drozdowski M. Scheduling a divisible task in a two-dimensional toroidal mesh.Discrete Applied Mathematics, 1999, 94: 35–50.

    Article  MATH  MathSciNet  Google Scholar 

  13. Cheng Y C, Robertazzi T G. Distributed computation for a tree network with communication delays.IEEE Transactions on Aerospace and Electronic Systems, 1990, 26(3): 511–516.

    Article  Google Scholar 

  14. Bharadwaj V, Ghose D, Mani V. Multi-installment techniques in tree networks.IEEE Transactions on Aerospace and Electronic Systems, 1995, 31(2): 555–567.

    Article  Google Scholar 

  15. Sohn J, Robertazzi T G. A multi-job load sharing strategy for divisible jobs on bus networks. CEAS Technical Report 697, University of Stony Brook, 1994.

Download references

Author information

Authors and Affiliations

  1. State Key Lap for Novel Software Technology, Nanjing University, 210093, Nanjing, P. R. China

    Li Guodong

  2. Department of Computer Science and Technology, Nanjing University, 210093, Nanjing, P. R. China

    Zhang Defu

Authors
  1. Li Guodong
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhang Defu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Li Guodong.

Additional information

Li Guodong received the B.S. degree in computer science from Zhongshan University, China, in 1997. and the M.S. degree in computer science from Nanjing University, China, in 2001. Currently, he is a teaching assistant and research assistant in the Department of Computer Science and Technology, Nanjing University. His research interests include parallel and distributed computing, graph theory. He is a member of IEEE and the IEEE Computer Society.

Zhang Defu received his B.S. degree in mathematics from Nanjing University, China, in 1962. He is a professor in the Department of Computer Science and Technology, Nanjing University. His main research areas include parallel and distributed systems, parallel numerical algorithms. Professor Zhang has coauthored more than 90 papers. He has served on the program committees of several conferences, organized several workshops, and guest-edited special issues.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, G., Zhang, D. Distributing and scheduling divisible task on parallel communicating processors. J. Compt. Sci. & Technol. 17, 788–796 (2002). https://doi.org/10.1007/BF02960769

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords