Skip to main content
SpringerLink
Log in

Scheduling PVM tasks

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

Abstract

This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplify programming.

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. Sunderam V S. PVM: A framework for parallel distributed computing.Concurrency: Practice and Experience, 1990, 2(4): 315–339.

    Article  Google Scholar 

  2. Sunderam V S, Geist G A, Dongarra J, Manchek R. The PVM concurrent computing system: Evolution, experience and trends.Parallel Computing, 1994, 20: 531–545.

    Article  MATH  Google Scholar 

  3. Flower J, Kolawa A. The express programming environment. Parasoft Corporation Report, July 1990.

  4. Sullivan M, Anderson D. Marionette: A system for parallel distributed programming using the master/slave model. InProc. 9th Int’l. Conf. on Distributed Computing Systems, June 1989, pp. 181–188.

  5. Dikken L, Liden F, Vesseur I, Sloot P. Dynamic PVM. InInternational Conference on High Performance Computing and Networking, April 1994, pp. 273–277.

  6. Schmidt B K, Sunderam V S. Empirical analysis of overheads in cluster environments.Concurrency: Practice and Experience, 1994, 6(1): 1–32.

    Article  Google Scholar 

  7. Ju J, Yang K, Xu G. Using resource utilization as load index of load balancing.Journal of Advanced Software Research, April 1996.

  8. Bertsekas D P, Tsitsiklis J N. Parallel and Distributed Computation Numerical Methods. Prentice Hall, 1989.

  9. Fox G C. Solving Problems on Concurrent Processors. Prentice Hall, New Jersey, 1988.

    Google Scholar 

  10. Magee J N, Cheung S C. Parallel algorithm design for workstation clusters.Software-Practice and Experience, 1990, 21(3): 235–250.

    Article  Google Scholar 

  11. Singh A, Schaeffer Jet al. A template based approach to the generation of distributed applications using a network of workstations.IEEE Trans. Parallel and Distributed Systems, 1991, 2(1): 52–66.

    Article  Google Scholar 

  12. Brown T, Xiong R. A parallel quicksort algorithm.Journal of Parallel and Distributed Computing, 1993, 19: 83–89.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Jilin University, 130023, Changchun

    Ju Jiubin, Wang Yong & Yin Yu

Authors
  1. Ju Jiubin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wang Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the 863 High-Tech Programme of The National Science and Technology Commission.

Ju Jiubin graduated from the Department of Radio and Electronics, Jilin University in 1960. He is now a Professor in the Department of Computer Science, Jilin University in 1960. He is now a Professor in the Department of Computer Science, Jilin University. His research interests include distributed computing systems and computer networks.

Wang Yong received his B.S. degree from Harbin Institute of Ship Engineering in 1990 and his M.S. degree in Computer Science from Jilin University in 1995. His research interests include distributed computing systems and computer networks.

Yin Yu received her B.S. and M.S. degree from the Department of Computer Science, Jilin University in 1993 and 1996 respectively. Her research interests include distributed computing systems and computer networks.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ju, J., Wang, Y. & Yin, Y. Scheduling PVM tasks. J. of Comput. Sci. & Technol. 12, 167–176 (1997). https://doi.org/10.1007/BF02951336

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation