Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1998: Computing and Combinatorics pp 241–250Cite as

Executing Divisible Jobs on a Network with a Fixed Number of Processors

Extended Abstract

  • Conference paper
  • First Online:

  • 348 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Abstract

In real practice, a job sometimes can be divided into s independent tasks to be distributed for execution on a network with a fixed number of processors. The overall finish time can vary widely depending on variables such as latency, data partitioning and/or data combining times, the individual execution times, the amount of data to be transferred, and the sending out of more tasks than needed. This paper studies the problem of finding an optimal task scheduling for a divisible job such that the overall finish time is minimized.

We first prove the studied problem is NP-complete and give a simple 3-OPT approximation algorithm. Then we develop a (2 + ε)-OPT linear-time approximation algorithm by generalizing our simple algorithm, where ε is an arbitrarily small constant. A linear-time 2-OPT approximation algorithm is given when we divide the tasks evenly. Algorithms to find optimal solutions are then given for two special cases: 1) when the network has exactly two processors and 2) when the evenly divided tasks have symmetric behaviors. These cases happen frequently in real practice.

Research supported in part by NSC of Taiwan, ROC Grant 87-2213-E-001-022.

Research supported in part by Academia Sinica, Taipei and the University of Minnesota, Morris.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Bampis, F. Guinand, and D. Trystram. Some models for scheduling parallel programs with communication delays. Discrete Applied Mathematics, 72:5–24, 1997.

    Article  MathSciNet  Google Scholar 

  2. J. Bĺażewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz. Scheduling Computer and Manufacturing Processes. Springer, 1996.

    Google Scholar 

  3. T. C. E. Cheng and C. C. S. Sin. A state-of-the-art review of parallel-machine scheduling research. European J. Operational Research, 47:271–292, 1990.

    Article  Google Scholar 

  4. P. Chrétienne. Tree scheduling with communication delays. Discrete Applied Mathematics, 49:129–141, 1994.

    Article  MathSciNet  Google Scholar 

  5. P. Chrétienne, E. G. Coffman, Jr., J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley & Sons Ltd, 1995.

    Google Scholar 

  6. Y. Cohen, M. S. Landy, and M. Pavel. Hierarchical coding of binary images. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-7(3):284–298, 1985.

    Article  Google Scholar 

  7. M. R. Garey and D. S. Johnson. COMPUTERS AND INTRACTABILITY A Guide to the Theory ofNP-Completeness. W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  8. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 User’s Guide and Reference Manual. Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831, USA, May 1993.

    MATH  Google Scholar 

  9. R. L. Graram. Bounds on multiprocessing timing anomalies. SIAM Journal on Appl. Math., 17(2):416–429, 1969.

    Article  MathSciNet  Google Scholar 

  10. D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximatiom approach. SIAM Journal on Computing, 17(3):539–551, 1988.

    Article  MathSciNet  Google Scholar 

  11. L. Hollermann, T.-s. Hsu, D. R. Lopez, and K. Vertanen. Scheduling problems in a practical allocation model. Journal of Combinatorial Optimization, 1(2):129–149, 1997.

    Article  MathSciNet  Google Scholar 

  12. T.-s. Hsu and D. R. Lopez. Bounds and algorithms for a practical task allocation model (extended abstract). In Proceedings of 7th International Symposium on Algorithms and Computation, volume LNCS #1178, pages 397–406. Springer-Verlag, 1996.

    Google Scholar 

  13. V. M. Lo. Task Assignment in Distributed Systems. PhD thesis, Univ. of Illinois at Urbana-Champaign, USA, October 1983.

    Google Scholar 

  14. D. R. Lopez. Models and Algorithms for Task Allocation in a Parallel Environment. PhD thesis, Texas A&M University, Texas, USA, December 1992.

    Google Scholar 

  15. H. S. Malvar. Lapped transforms for efficient transformation/subband coding. IEEE Trans. on Acoustics, Speech and Signal Processing, 38(6):969–978, 1990.

    Article  Google Scholar 

  16. M. G. Norman and P. Thanisch. Models of machines and computation for mapping in multicomputers. ACM Computing Surveys, 25(3):263–302, 1993.

    Article  Google Scholar 

  17. S. A. Rees and J. P. Black. An experimental investigation of distributed matrix multiplication techniques. Software — Practice and Experience, 21(10):1041–1063, 1991.

    Article  Google Scholar 

  18. H. S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. on Software Eng., SE-3(1):85–93, 1977.

    Article  MathSciNet  Google Scholar 

  19. P. Strobach. Tree-structured scene adaptive coder. IEEE Trans. on Communications, 38(4):477–486, 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, Nankang, Taipei, 11529, Taiwan

    Tsan-sheng Hsu

  2. Division of Science and Mathematics, University of Minnesota, Morris, Morris, Minnesota, 56267, USA

    Dian Rae Lopez

Authors
  1. Tsan-sheng Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dian Rae Lopez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Wen-Lian Hsu

  2. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsu, Ts., Lopez, D.R. (1998). Executing Divisible Jobs on a Network with a Fixed Number of Processors. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64824-6

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation