Skip to main content
SpringerLink
Log in
Book cover

Workshop on Job Scheduling Strategies for Parallel Processing

JSSPP 1996: Job Scheduling Strategies for Parallel Processing pp 126–139Cite as

Implementation of gang-scheduling on workstation cluster

  • Conference paper
  • First Online:

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

Abstract

The goal of this paper is to determine how efficiently we can implement an adequate parallel programming environment on a workstation cluster without modifying the existing operating system. We have implemented a runtime environment for parallel programs and gang-scheduling on a workstation cluster. In this paper, we report the techniques used to implement an efficient runtime environment and gangscheduling on a workstation cluster. The most important technique is “network preemption.” A unique feature of our approach is that the gang-scheduling is also written in a parallel language. Our evaluation shows that gang-scheduling on workstation clusters can be practical.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Thomas E. Anderson, David E. Culler, David A. Patterson, et al. A Case for NOW (Networks of Workstations). IEEE Micro, 15(1):54–64, February 1995.

    Article  Google Scholar 

  2. Remzi H. Arpaci, Andrea C. Dusseau, Amin M. Vahdat, Lok T. Liu, Thomas E. Anderson, and David A. Patterson. The Interaction of Parallel and Sequential Workloads on a Network of Workstations. UC Berekeley Technical Report CS-94-838, Computer Science Division, University of California, Berekeley, 1994.

    Google Scholar 

  3. Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, and Wen-King Su. Myrinet: A Gigabit-per-Second Local Area Network. IEEE Micro, 15(1):29–36, February 1995.

    Article  Google Scholar 

  4. Dror G. Feitelson and Larry Rudolph. Distributed Hierarchical Control for Parallel Processing. COMPUTER, 23(5):65–77, May 1990.

    Article  Google Scholar 

  5. Dror G. Feitelson and Larry Rudolph. Gang Scheduling Performance Benefits for Fine-Grain Synchronization. Journal of Parallel and Distributed Computing, 16(4):306–318, 1992.

    Article  Google Scholar 

  6. Atsushi Hori, Takashi Yokota, Yutaka Ishikawa, Shuichi Sakai, Hiroki Konaka, Munenori Maeda, Takashi Tomokiyo, Jörg Nolte, Hiroshi Matsuoka, Kazuaki Okamoto, and Hideo Hirono. Time Space Sharing Scheduling and Architectural Support. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Computer Science, pages 92–105. Springer-Verlag, April 1995.

    Google Scholar 

  7. Yutaka Ishikawa. MPC++: Massively Parallel, Message Passing, Meta-Level Programming C++. In Parallel Object Oriented Methods and Application'94, 1994.

    Google Scholar 

  8. Yutaka Ishikawa. The MPC++ Programming Language V1.0 Specification with Commentary Document Version 0.1. Technical Report TR-94014, RWC, June 1994.

    Google Scholar 

  9. Yutaka Ishikawa. Meta-Level Architecture for Extendable C++. Technical Report TR-94024, RWC, January 1995.

    Google Scholar 

  10. Yutaka Ishikawa, Atsushi Hori, Hiroshi Tezuka, Motohiko Matsuda, Hiroki Konaka, Munenori Maeda, Takashi Tomokiyo, and Jörg Nolte. MPC++. In Gregory V. Wilson and Paul Lu, editors, Parallel Programming Using C++. MIT Press, 1996.

    Google Scholar 

  11. John K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Proceedings of Third International Conference on Distributed Computing Systems, pages 22–30, 1982.

    Google Scholar 

  12. Scott Pakin, Mario Lauria, and Andrew Chien. High Performance Messaging on Workstations: Illinoi Fast Messages (FM) for Myrinet. In Supercomputing'95, December 1995.

    Google Scholar 

  13. Gregory F. Pfister and V. Alan Norton. ”Hot Spot” Contention and Combining in Multistage Interconnection Networks. IEEE Transactions on Computers, pages 943–948, October 1985.

    Google Scholar 

  14. Jim Pruyne and Miron Livny. Parallel Processing on Dynamic Resources with CARMI. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Computer Science, pages 259–278. Springer-Verlag, April 1995.

    Google Scholar 

  15. Andrew S. Tanenbaum. Modern Operating Systems. Prentice-Hall, 1992.

    Google Scholar 

  16. Gupta A. Ticker and Shigeru Urushibara. The Impact of Operating System Scheduling Policies and Synchronization Methods on the Performance of Parallel Applications. In ACM SIGMETRICS, pages 120–132, 1991.

    Google Scholar 

  17. Thorston von Eicken, Anindya Basu, and Werner Vogels. U-Net: A User Level Network Interface for Parallel and Distributed Computing. In Fifteenth ACM Sumposium on Operating Systems Principles, pages 40–53, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tsukuba Research Center, Real World Computing Partnership, Tsukuba Mitsui Building 16F, 1-6-1 Takezono, Tsukuba-shi, 305, Ibaraki, Japan

    Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa, Hiroki Konaka & Munenori Maeda

  2. Software Research Associates, Inc., Japan

    Noriyuki Soda

Authors
  1. Atsushi Hori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Tezuka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yutaka Ishikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Noriyuki Soda
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hiroki Konaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Munenori Maeda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dror G. Feitelson Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hori, A., Tezuka, H., Ishikawa, Y., Soda, N., Konaka, H., Maeda, M. (1996). Implementation of gang-scheduling on workstation cluster. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1996. Lecture Notes in Computer Science, vol 1162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022291

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61864-5

  • Online ISBN: 978-3-540-70710-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation