Skip to main content

Implementing and Analysing an Effective Explicit Coscheduling Algorithm on a NOW

  • Conference paper
  • First Online:

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

Abstract

Networks of workstations (NOWs) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicated. These two unique factors make scheduling policies on multiprocessor/multicomputer systems unsuitable for NOWs, but the coscheduling principle is still an important basis for parallel process scheduling in these environments. The main idea of this technique is to schedule the set of tasks composing a parallel application at the same time, to increase their communication performance. In this article we present an explicit coscheduling algorithm implemented in a Linux NOW, of PVM distributed tasks, based on Real Time priority assignment. The main goal of the algorithm is to execute efficiently distributed applications without excessively damaging the response time of local tasks. Extensive performance analysis as well as studies of the parameters and overheads involved in the implementation demonstrated the applicability of the proposed algorithm.

This work was supported by the CICYT under contract TIC98-0433

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

Buying options

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. Anderson, T., Culler, D., Patterson, D. and the Now team: A case for NOW (Networks of Workstations). IEEE Micro (1995) 54–64

    Google Scholar 

  2. Litzkow, M., Livny, M., Mutka, M.: Condor-A Hunter of Idle Workstations. Proceedings of the 8th Int’l Conference of Distributed Computing Systems (1988) 104–111

    Google Scholar 

  3. Russ, S., Robinson, J., Flachs, B., Heckel, B.: The Hector Distributed Run-Time Environment. IEEE trans. on Parallel and Distributed Systems, Vol.9 (11), (1988)

    Google Scholar 

  4. Du, X., Zhang, X.: Coordinating Parallel Processes on Networks of Workstations. Journal of Parallel and Distributed Computing (1997)

    Google Scholar 

  5. Crovella, M. et al.: Multiprogramming on Multiprocessors. Proceedings of 3rd IEEE Symposium on Parallel and Distributed Processing (1994) 590–597

    Google Scholar 

  6. Dusseau, A., Arpaci, R., Culler, D.: Effective Distributed Scheduling of Parallel Workloads. ACM SIGMETRICS’96 (1996)

    Google Scholar 

  7. Arpaci, R., Dusseau, A., Vahdat, A., Liu, L., Anderson, T., Patterson, D.: The Interaction of Parallel and Sequential Workloads on a Network of Workstations. ACM SIGMETRICS’95 (1995)

    Google Scholar 

  8. Zhang, X., Yan Y.: Modeling and Characterizing Parallel Computing Performance on Heterogeneous Networks of Workstations. Proc. Seventh IEEE Symp. Parallel and Distributed Processing (1995) 25–34

    Google Scholar 

  9. Ousterhout, J.: Scheduling Techniques for Concurrent Systems. Third International Conference on Distributed Computing Systems (1982) 22–30

    Google Scholar 

  10. Solsona, F., Gine, F., Hernández, P., Luque, E.: Synchronization Methods in Distributed Processing. Proceedings of the Seventeenth IASTED International Conference. Applied Informatics (1999) 471–473

    Google Scholar 

  11. Ferrari, D., Zhou, S.: An Empirical Investigation of Load Indices for Load Balancing Applications. Proc. Performance’ 87, 12th Int’l Symp. Computer Performance Modeling, Measurement, and Evaluation. North-Holland, Amsterdam (1987) 515–528

    Google Scholar 

  12. Mc. Voy, L., Staelin, C.: lmbench: Portable tools for performance analysis. Silicon Graphics. Inc, ftp://ftp.sgi.com/pub/lm-bench.tgz (1997)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solsona, F., Giné, F., Molina, F., Hernández, P., Luque, E. (2001). Implementing and Analysing an Effective Explicit Coscheduling Algorithm on a NOW. In: Palma, J.M.L.M., Dongarra, J., Hernández, V. (eds) Vector and Parallel Processing — VECPAR 2000. VECPAR 2000. Lecture Notes in Computer Science, vol 1981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44942-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44942-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41999-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics