Skip to main content

Affinity-Based Self Scheduling for Software Shared Memory Systems

  • Conference paper
High Performance Computing – HiPC’99 (HiPC 1999)

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

Included in the following conference series:

Abstract

In this paper, we propose an affinity-based self scheduling scheme (ABS) for software shared memory system. In this scheme, the static affinity between processor and initial data distribution is considered when scheduling, and the synchronization overhead is reduced greatly when load imbalance occurs. Comparized with previous schemes, ABS performs better in metacomputing environment.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hu, W., Shi, W., Tang, Z.: Jiajia: An svm system based on a new cache coherence protocol. In: Proc. of the High Performance Computing and Networking Europe 1999 (HPCN 1999), pp. 463–472 (April 1999)

    Google Scholar 

  2. Hummel, S.E., Schonberg, E., Flynn, L.E.: Factoring: A practical and robust method for scheduling parallel loops. Communication of ACM 35(8), 90–101 (1992)

    Article  Google Scholar 

  3. Liu, J., Saletore, V.A., Lewis, T.G.: Safe self-scheduling: A parallel loop scheduling scheme for shared memory multiprocessors. Int’l Journal of Parallel Programming 22(6), 589–616 (1994)

    Article  Google Scholar 

  4. Markatos, E., Le Blanc, T.: Using processor affinity in loop scheduling on shared memory multiprocessors. IEEE Trans. on Parallel and Distributed Systems 5(4), 379–400 (1994)

    Article  Google Scholar 

  5. Polychronopoulos, C., Kuck, D.: Guided self-scheduling: A practical self-scheduling scheme for parallel supercomputers. IEEE Transcations on Computers 36(12), 1425–1439 (1987)

    Article  Google Scholar 

  6. Shi, W., Tang, Z., Hu, W.: A more practical loop scheduling for home-based software dsms. In: Proc. of the ACM-SIGARCH Workshop on Scheduling Algorithms for Parallel and Distributed Computing-From Theory to Practice (June 1999)

    Google Scholar 

  7. Tang, P., Yew, P.-C.: Processor self-scheduling for multiple nested parallel loops. In: Proc. of the 1985 Int’l Conf. on Parallel Processing (ICPP 1986), pp. 528–535 (August 1986)

    Google Scholar 

  8. Tzen, T.H., Ni, L.M.: Trapezoid self-scheduling:a practical scheduling scheme for parallel compilers. IEEE Trans. on Parallel and Distributed Systems 4(l), 87–98 (1993)

    Article  Google Scholar 

  9. Yan, Y., Jin, C., Zhang, X.: Adaptively scheduling parallel loops in distributed shared memorysystems. IEEE Trans, on Parallel and Distributed Systems 8(1), 70–81 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shi, W., Tang, Z. (1999). Affinity-Based Self Scheduling for Software Shared Memory Systems. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46642-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66907-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics