Skip to main content
SpringerLink
Log in

Bounds and algorithms for a practical task allocation model (extended abstract)

  • Session 10a: Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1996)

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

Included in the following conference series:

Abstract

A parallel computational model is defined which addresses I/O contention, latency, and pipe-lined message passing between tasks allocated to different processors and can be used for modeling parallel task-allocation on a network of workstations or on a multi-stage interconnected parallel machine. To study the performance bounds more closely, basic properties are developed for when the precedence constraints form a directed tree. Approximation algorithms are presented for scheduling directed one-level task trees on an unlimited number of processors and also on a fixed number of k, k > 1, processors, where the approximation ratios are 3 and 3 + k−2/k, respectively. The case of equal task execution times is also considered.

Research supported in part by NSC Grant 85-2213-E-001-003.

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. D. Anger, J. J. Hwang, and Y. C. Chow. Scheduling with sufficient loosely coupled processors. Journal of Parallel and Distributed Comput., 9:87–92, 1990.

    Article  Google Scholar 

  2. 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 

  3. P. Chrétienne. A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. European J. Operational Research, 43:225–230, 1989.

    Article  Google Scholar 

  4. P. Chrétienne. Task scheduling with interprocessor communication delays. European J. Operational Research, 57:348–354, 1992.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  7. J. Y. Colin and P. Chrétienne. C.P.M. scheduling with small communication delays and task duplication. Oper. Res., 39(3):680–684, 1991.

    Google Scholar 

  8. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1–12, 1993.

    Google Scholar 

  9. O. El-Dissouki and W. Huen. Distributed enumeration on network computers. IEEE Trans. on Computers, C-29(9):818–825, 1980.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. P. B. Gibbons, Y. Matias, and V. Ramachandran. The QRQW PRAM: Accounting for contention in parallel algorithms. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 638–648, 1994. SIAM J. Comput., to appear.

    Google Scholar 

  12. J. J. Hwang, Y. C. Chow, F. D. Anger, and C. Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing, 18(2):244–257, 1989.

    Article  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. V. M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. on Computers, 37(11):1284–1397, 1988.

    Article  Google Scholar 

  15. 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 

  16. P. R. Ma, E. Y. Lee, and M. Tsuchiya. A task allocation model for distributed computing systems. IEEE Trans. on Computers, C-31(1):41–47, 1982.

    Google Scholar 

  17. 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 

  18. C. Papadimitriou and M. Yannakakis. Towards on an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19:322–328, 1990.

    Article  Google Scholar 

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

    Google Scholar 

  20. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, pages 103–111, 1990.

    Google Scholar 

  21. L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 944–971. North Holland, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tsan-sheng Hsu

  2. Division of Science and Mathematics, University of Minnesota, Morris, 56267, Morris, Minnesota, 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

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsu, Ts., Lopez, D.R. (1996). Bounds and algorithms for a practical task allocation model (extended abstract). In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009516

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation