I/O node placement for performance and reliability in torus networks Conference Paper

abstract

• When a cluster system interconnects processor and I/O nodes through a network, an optimal placement of I/O nodes is critical to improve the overall system performance by reducing its communication latency. In this paper, we propose an efficient and scalable I/O node placement scheme, called a relaxed quasi-perfect, for torusbased interconnection networks using Lee distance errorcorrecting code. It provides a more general placement than the previous quasi-perfect placement [I]. We also suggest a fault-tolerant scheme using our I/O placement model for a guaranteed performance. Simulation results show that our scheme provides 53% speed-up over the quasi-perfect. Also the fault tolerant scheme provides a graceful slowdown especially until the number of faulty I/O nodes becomes less than half of the initial I/O nodes.

authors

• Kim, Eun

published proceedings

• PROCEEDINGS OF THE 18TH IASTED INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS

author list (cited authors)

• Azeez, B., Kim, H., Jin, Y., & Kim, E. J.

complete list of authors

• Azeez, Babatunde||Kim, Hogil||Jin, Yuho||Kim, Eun Jung

publication date

• December 2006

published in

• Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems  Journal

keywords

• Fault Tolerance
• Resource Allocation
• Torus Interconnection Networks

International Standard Book Number (ISBN) 13

• 978-0-88986-638-6

start page

• 522

end page

• +