Applying search algorithms to obtain the optimal configuration of nDT torus nodes. (2nd February 2017)

• Record Type: Journal Article
• Authors: Andújar‐Muñoz, Francisco‐José; Villar-Ortiz, Juan‐Antonio; Sánchez‐García, José‐Luis; Alfaro‐Cortés, Francisco‐José
• Other Names: Plale Beth guestEditor.; Chen Maio guestEditor.; Escudero‐Sahuquillo Jesús guestEditor.; Garcia Pedro Javier guestEditor.
• Is Part Of: Concurrency and computation. Volume 29:Number 13(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-02-02
• Subjects: interconnection networks -- search algorithms -- switch architecture -- torus topology; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4074
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: An nDT torus is a topology where each node comprises 2 identical (n+1)‐port communication cards interconnected by 1 port. By using the current switches or communication cards, this node architecture allows to build torus networks having a greater number of dimensions than networks including only 1 card per node. There are multiple ways to use the ports of the 2 cards to connect a node to other nodes on the nDT torus, and therefore, checking all the configurations is only an affordable problem for small values of n. In this paper, we use artificial intelligence and data mining techniques to obtain the optimal port configuration of all the nodes in the network. We include a performance evaluation that shows nDT torus effectively increases the performance compared with the equivalent torus in resources, with synthetic and application trace–based workloads. We also apply these techniques to 3DT and 5DT tori to confirm the increase in the number of dimensions that does not affect to performance of the nDT torus.