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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights 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