Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Coscheduling through synchronized scheduling servers—A prototype and experiments

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

  • 113 Accesses

Abstract

Predictable network computing still involves a number of open questions. One such question is providing a controlled amount of CPU time to distributed processes. Mechanisms to control the CPU share given to a single process have been proposed before. Directly applying this work to distributed programs leads to unacceptable performance, since the execution of processes on distributed machines is not coordinated in time. This paper discusses how coscheduling can be achieved with share-controlling scheduling servers. The performance impact of scheduling control is evaluated for BSP-style programs. These experiments show that synchronization mechanisms are indispensable and that coscheduling can be achieved for unmodified programs, but also that a performance overhead has to be paid for the control over CPU share.

This research was sponsored by Deutsche Forschungsgemeinschaft (German Research Council), by the Defense Advanced Research Projects Agency and Rome Laboratory, Air Force Materiel Command, USAF, under agreement number F30602-96-1-0320; and by the National Science Foundation under grant number CCR-94-11590.

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. T. E. Anderson, D. 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. A. C. Arpaci-Dusseau, D. E. Culler, and A. M. Mainwaring. Scheduling with Implicit Information in Distributed Systems. In Proc. of SIGMETRICS’98/PERFORMANCE’98 Joint Conf. on Measurement and Modeling of Computer Systems, pages 233–243. ACM, June 1998.

    Google Scholar 

  3. S. Balji, R. Menon, F. Ansari, J. Keinig, and A. Sheth. UTIME—Micro-Second Resolution Timers for Linux. Project homepage at http://hegel.ittc.ukans. edu/projects/utime/index.html, April 1998.

    Google Scholar 

  4. A. Baratloo, A. Itzkovitch, Z. Kedem, and Y. Zhao. Just-in-time Transparent Resource Management in Distributed Systems. Technical Report 1998-762, Courante Institute of Mathematical Sciences, New York University, March 1998.

    Google Scholar 

  5. H.-H. Chu and K. Nahrstedt. A Soft Real Time Scheduling Server in UNIX Operating System. In R. Steinmetz and L. C. Wolf, editors, Proc. of Interactive Distributed Multimedia Systems and Telecommunication Services, pages 153–162, Darmstadt, Germany, September 1997.

    Google Scholar 

  6. A. C. Dusseau, R. H. Arpaci, and D. E. Culler. Effective Distributed Scheduling of Parallel Workloads. In Proc. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 25–36, Philadelphia, PA, May 1996.

    Google Scholar 

  7. A. Hori, F. B. O’Carroll, H. Tezuka, and Y. Ishikawa. Gang Scheduling vs. Coscheduling: A Comparison with Data-Parallel Workloads. In H. R. Arabnia, editor, Proc. Intl. Conf. on Parallel and Distributed Processing Techniques and Applications, volume 2, pages 1050–1057, Las Vegas, NV, July 1998. CSREA.

    Google Scholar 

  8. J. Kamada, M. Yuharo, and E. Ono. User-level Realtime Scheduler Exploiting Kernel-level Fixed Priority Scheduler. In International Symposium on Multimedia Systems, Yokohama, Japan, March 1996.

    Google Scholar 

  9. H. Karl. A Prototype for Controlled Gang-Scheduling. Technical Report Informatik Bericht 112, Institut für Informatik, Humboldt-Universität, Berlin, Germany, August 1998.

    Google Scholar 

  10. C. Lee, R. Rajkumar, and C. Mercer. Experiences with Processor Reservation and Dynamic QOS in Real-Time Mach. In Proc. of Multimedia Japan, April 1996.

    Google Scholar 

  11. M. Malek. A Consensus-Based Framework and Model for the Design of Responsive Computing Systems. In G. M. Koob and C. G. Lau, editors, Foundations of Dependable Computing: Models and Frameworks for Dependable Systems, chapter 1.1, pages 3–21. Kluwer Academic Publishers, Boston, MA, 1994.

    Google Scholar 

  12. J. K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Proc. 3rd Intl. Conf. Distributed Computing Systems, pages 22–30, October 1982.

    Google Scholar 

  13. A. Polze. How to Partition a Workstation. In Proc. Eight IASTED/ISMM Intl. Conf. on Parallel and Distributed Computing and Systems, pages 184–187, Chicago, IL, October 1996.

    Google Scholar 

  14. P. G. Sobalvarro, S. Pakin, W. E. Weihl, and A. A. Chien. Dynamic Coscheduling on Workstation Clusters. Technical Report 1997-017, DEC Systems Research Center, Palo Alto, CA, March 1997.

    Google Scholar 

  15. L. G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8):103–111, August 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-University of Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Holger Karl

Authors
  1. Holger Karl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Karl, H. (1999). Coscheduling through synchronized scheduling servers—A prototype and experiments. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097997

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation