Name
Abstract | ||
|---|---|---|
Interconnection is a major challenge in parallel computer systems. In this paper, we introduce a novel scheme for designing interconnection multistage networks (MINs) with a reduced number of switches while retaining the networks' routability. We formalize the problem of multistage network design as a combinatorial search problem and we use Permutation Decision Diagrams (PiDD) to effectively explore the search space. Our method starts with a classical blocking multistage network (e.g., Shuffle-Exchange, Butterfly) and it explores all inter-stage permutation patterns and the minimum number of extra stages. We call the MINs produced by our scheme Minimum Switching Networks (MSNs), which are optimal with respect to the number of switches to build quasi and rearrangeable multistage networks. Empirical results on 8x8 permutation networks show the potential of our method. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/SBESC.2018.00042 | 2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC) |
Keywords | DocType | ISSN |
Interconnections,Multistage Networks,Set of Permutations,PiDD | Conference | 2324-7886 |
ISBN | Citations | PageRank |
978-1-7281-0240-5 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ricardo Ferreira | 1 | 49 | 13.81 |
| Michael Canesche | 2 | 1 | 2.71 |
| Kristtopher Coelho | 3 | 0 | 0.68 |
| Jose Nacif | 4 | 0 | 0.68 |