A Flat Neighborhood Network (FNN) is a new interconnection network architecture that can provide very low latency and high bisection bandwidth at a minimal cost for large clusters. However, unlike more traditional designs, FNNs generally are not symmetric. Thus, although an FNN by definition offers a certain base level of performance for random communication patterns, both the network design and communication (routing) schedules can be optimized to make specific communication patterns achieve significantly more than the basic performance. The primary mechanism for design of both the network and communication schedules is a set of genetic search algorithms (GAs) that derive good designs from specifications of particular communication patterns. This paper centers on the use of these GAs to compile the network wiring pattern, basic routing tables, and code for specific communication patterns that will use an optimized schedule rather than simply applying the basic routing.
|Title of host publication||Languages and Compilers for Parallel Computing - 13th International Workshop, LCPC 2000, Revised Papers|
|Editors||Jeanne Ferrante, Samuel P. Midkiff, Jose E. Moreira, Manish Gupta, Siddhartha Chatterjee, Jan Prins, William Pugh, Chau-Wen Tseng|
|Number of pages||15|
|State||Published - 2001|
|Event||13th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2000 - Yorktown Heights, United States|
Duration: Aug 10 2000 → Aug 12 2000
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||13th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2000|
|Period||8/10/00 → 8/12/00|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)