Abstract
System partitioning provides the users of high-performance parallel servers with the flexibility in resource allocation and dynamic reconfiguration as well as fault isolation. However, the bandwidth of links that connect different domains can be wasted while links within the same domains are congested. In this paper, we present a routing mechanism that can utilize the bandwidth of otherwise unused links to balance the message traffic and lead to lower message latencies for the latency-sensitive transactions. The performance of the proposed routing mechanism was studied using an analytical model with on-line transaction processing type workload parameters. The results indicated the proposed routing mechanism reduced the congestion on the direct paths significantly and lowered the queuing delay for the links. For example, when a 4-cluster system with a fully connected network with the bandwidth of 3.2GB/s per link is partitioned into two 2-cluster domains, the queuing delay was reduced from 53ns to 37ns and resulted in the improvement of CPI by 2%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
“HP Virtual Partitions”, a white paper from Hewlett-Packard Company, September 2000
Fumio Aono and Masayuki Kimura, “The Azusa 16-way Itanium Server”, IEEE Micro, Vol. 20, Issue. 5, 54–60, Sep–Oct 2000.
“AlphaServer GS80, GS160, and GS320 Systems Technical Summary”, Compaq.
“Cellular Multiprocessing Shared Memory”, White Paper, Unisys, September 2000.
“Distributed Shared Memory System Performance”, HAL internal document, February 1998.
Russell M. Clapp, “STinG Revisited: Performance of Commercial Database Benchmarks on a CC-NUMA Computer System”, in Proceedings of Fourth Workshop on Computer Architecture Evaluation using Commercial Workloads, Monterrey, Mexico, January 2001.
Don De Sota, “Characterization of I/O for TPC-C and TPC-H workloads”, in Proceedings of Fourth Workshop on Computer Architecture Evaluation using Commercial Workloads, Monterrey, Mexico, January 2001.
“The IBM NUMA-Q enterprise server architecture“, IBM, January 2000.
M. Boari, A. Corradi, C. Stefanelli and L. Leonardi, “Adaptive Routing for Dynamic Applications in Massively Parallel Architectures”, IEEE Parallel & Distributed Technology: Systems & Applications, Vol. 3 Issue 1, Spring 1995, pp61–74.
D. Lenoski and W.-D. Weber, “Scalable Shared-Memory Multiprocessing”, Morgan Kaufmann Publishers, 1995.
D. Dai and D. Panda, “Exploiting the benefits multiple-path network in DSM systems: architectural alternatives and performance evaluation”, IEEE Trans. on Computers, Vol. 48 Issue 2, Feb. 1999 pp236–244.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hitoshi, O., Bing-rung, T. (2002). Routing Mechanism for Static Load Balancing in a Partitioned Computer System with a Fully Connected Network. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds) High Performance Computing. ISHPC 2002. Lecture Notes in Computer Science, vol 2327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47847-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-47847-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43674-4
Online ISBN: 978-3-540-47847-8
eBook Packages: Springer Book Archive