The effects of network contention on processor allocation strategies
Citations Over TimeTop 11% of 2002 papers
Abstract
Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important. Our simulation considers both mesh- and MIN-based wormhole parallel computers, the communication characteristics of individual applications, and the impact due to communication software latency. We show that for systems with high software latency, there is no need of contention-free processor allocation policies. However, if the software latency is very small or the message size is very long, contention-free allocation policies should be developed.
Related Papers
- → Peer-to-Peer Models for Resource Discovery in Large-Scale Grids: A Scalable Architecture(2007)23 cited
- → Scalable Multi-purpose Network Representation for Large Scale Distributed System Simulation(2012)21 cited
- RESEARCH ON THE SCALABILITY OF THE LARGE SCALE PARALLEL APPLICATION PROGRAMS(2000)
- Relationships between latency scalability and execution time(2014)