Skip to main content

Part of the book series: Series in Computer Science ((SCS))

  • 130 Accesses

Abstract

In the last two chapters, we used coarse-grain parallelism to evaluate performance of the hierarchical task queue organization. This chapter studies its performance under fine-grain parallelism. We use two workload models: lock accessing and barrier synchronization. The lock accessing workload models tasks with a critical section protected by a lock. In barrier synchronization, tasks iterate through a computation phase and a communication phase. Using these two workloads, we study the impact of spinning and blocking synchronization methods on the performance of the hierarchical and distributed organizations. The centralized organization is not considered here because it is not a scalable organization.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Dandamudi, S. (2003). Performance with Synchronization Workloads. In: Hierarchical Scheduling in Parallel and Cluster Systems. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0133-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0133-6_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-4938-9

  • Online ISBN: 978-1-4615-0133-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics