Compiler techniques for flat neighborhood networks

H. G. Dietz, T. I. Mattox

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageEnglish
Title of host publicationLanguages and Compilers for Parallel Computing - 13th International Workshop, LCPC 2000, Revised Papers
EditorsJeanne Ferrante, Samuel P. Midkiff, Jose E. Moreira, Manish Gupta, Siddhartha Chatterjee, Jan Prins, William Pugh, Chau-Wen Tseng
Number of pages15
StatePublished - 2001
Event13th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2000 - Yorktown Heights, United States
Duration: Aug 10 2000Aug 12 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2000
Country/TerritoryUnited States
CityYorktown Heights

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Compiler techniques for flat neighborhood networks'. Together they form a unique fingerprint.

Cite this