Filters








27,230 Hits in 6.1 sec

A Partial Irregular-Network Routing on Faulty k-ary n-cubes

Michihiro Koibuchi, Tsutomu Yoshinaga, Yasuhiko Nishimura
2006 Automated Software Engineering, IEEE International Conference  
Since an irregular-network routing usually performs poorly in k-ary n-cube networks, it is only used for progressive deadlock-recovery, and avoiding hard failures.  ...  This paper presents a partial irregular-network routing in order to provide a high fault-tolerance in k-ary n-cube networks.  ...  The former is known as a deadlock-free minimal routing with high adaptivity. The latter is taken from high-performance deadlock-free irregular-network routings.  ... 
doi:10.1109/iwias.2006.23 fatcat:5nxqmbk3nbhgbi66klzg76hrbe

A Generalized Theory Based on the Turn Model for Deadlock-Free Irregular Networks

Ryuta KAWANO, Ryota YASUDO, Hiroki MATSUTANI, Michihiro KOIBUCHI, Hideharu AMANO
2020 IEICE transactions on information and systems  
Recently proposed irregular networks can reduce the latency for both on-chip and off-chip systems with a large number of computing nodes and thus can improve the performance of parallel applications.  ...  The theorems remain a challenge of applying themselves to arbitrary topologies including fully irregular networks. In this paper, we advance the theorems to completely general ones.  ...  In this work, we propose a novel and generalized theorem, called HiRy * , to design deadlock-free adaptive routing methods for arbitrary network topologies.  ... 
doi:10.1587/transinf.2018edp7367 fatcat:7wvezuivkve75i3iu4fh2bdsdu

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks [article]

Maciej Besta, Jens Domke, Marcel Schneider, Marek Konieczny, Salvatore Di Girolamo, Timo Schneider, Ankit Singla, Torsten Hoefler
2020 arXiv   pre-print
Among others, we consider multipathing with both shortest and non-shortest paths, support for disjoint paths, or enabling adaptivity.  ...  In this work, to facilitate high-performance routing in modern networks, we analyze existing routing protocols and architectures, focusing on how well they exploit the diversity of minimal and non-minimal  ...  Some recent architectures focus on high-performance routing in low-diameter networks.  ... 
arXiv:2007.03776v3 fatcat:zwex5rqaobdttnpduurzww6gze

Session introduction: interconnection networks

E. Maehle
2003 Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings.  
Ould-Khaoua 'A Scalable Plane-Based Broadcast Algorithm for 3D-Mesh Networks' presents a new efficient broadcast algorithm for 3D-mesh topologies.  ...  Many topologies and routing algorithms have already been investigated and are implemented in real systems.  ...  Hsin-Chou Chi and Wen-Jen Wu present in 'Routing Tree Construction for Interconnection Networks with Irregular Topologies' a deadlock-free routing algorithm (TRAIN) based on a spanning tree with shortcut  ... 
doi:10.1109/empdp.2003.1183580 fatcat:y6sdu57vdfd3xkikc5gczh4qcm

String Figure: A Scalable and Elastic Memory Network Architecture

Matheus Ogleari, Ye Yu, Chen Qian, Ethan Miller, Jishen Zhao
2019 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)  
String Figure consists of (1) an algorithm to generate random topologies that achieve high network throughput and nearoptimal path lengths in large-scale memory networks, (2) a hybrid routing protocol  ...  Demand for server memory capacity and performance is rapidly increasing due to expanding working set sizes of modern applications, such as big data analytics, inmemory computing, deep learning, and server  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for their valuable feedback.  ... 
doi:10.1109/hpca.2019.00016 dblp:conf/hpca/OgleariYQMZ19 fatcat:tm6ddpt54jbk3ibp5ujk3kowzu

A Scalability Study of Enterprise Network Architectures

Brent Stephens, Alan L. Cox, Scott Rixner, T.S. Eugene Ng
2011 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems  
Additionally, requiring routing restrictions, such as deadlock-freedom or minimum-hop routing, can significantly reduce the network's ability to perform traffic engineering across the links.  ...  If the Ethernet subnets are made more scalable, the high cost of the IP routers can be eliminated.  ...  This, combined with allowing arbitrary topologies, allows Ethane and OpenFlow to perform traffic engineering.  ... 
doi:10.1109/ancs.2011.28 dblp:conf/ancs/StephensCRN11 fatcat:dmc2vkeym5h7tgkmkcncf6auyu

Adaptive Multi-topology IGP Based Traffic Engineering with Near-Optimal Network Performance [chapter]

Ning Wang, Kin-Hon Ho, George Pavlou
2008 Lecture Notes in Computer Science  
Our experiments based on real network topologies and traffic matrices show that our approach has a high chance of achieving nearoptimal network performance with only a small number of routing topologies  ...  Based on this optimized MT-IGP configuration, an adaptive traffic engineering algorithm performs dynamic traffic splitting adjustment for balancing the load across multiple routing topologies in reaction  ...  These results reveal that, for the GEANT network, AMPLE has very high chance of achieving near-optimal TE performance under any scenario of traffic matrix with four routing topologies.  ... 
doi:10.1007/978-3-540-79549-0_57 fatcat:27nxjgvuw5a5njqtndbfu2xonu

Flattened butterfly

John Kim, William J. Dally, Dennis Abts
2007 SIGARCH Computer Architecture News  
This paper introduces the flattened butterfly, a cost-efficient topology for highradix networks.  ...  On benign (load-balanced) traffic, the flattened butterfly approaches the cost/performance of a butterfly network and has roughly half the cost of a comparable performance Clos network.  ...  Acknowledgments The authors would like to thank the anonymous reviewers and CVA members for their insightful comments.  ... 
doi:10.1145/1273440.1250679 fatcat:ynemsajd7jajzaz36b6lpzh6ji

Flattened butterfly

John Kim, William J. Dally, Dennis Abts
2007 Proceedings of the 34th annual international symposium on Computer architecture - ISCA '07  
This paper introduces the flattened butterfly, a cost-efficient topology for highradix networks.  ...  On benign (load-balanced) traffic, the flattened butterfly approaches the cost/performance of a butterfly network and has roughly half the cost of a comparable performance Clos network.  ...  Acknowledgments The authors would like to thank the anonymous reviewers and CVA members for their insightful comments.  ... 
doi:10.1145/1250662.1250679 dblp:conf/isca/KimDA07 fatcat:q7zie2mb2fdghejrj7epaf6d6i

LAPSES: a recipe for high performance adaptive router design

A.S. Vaidya, A. Sivasubramaniam, C.R. Das
1999 Proceedings Fifth International Symposium on High-Performance Computer Architecture  
Earlier research has shown that adaptive routing can help in improving network performance.  ...  This paper proposes a three step recipe -Look-Ahead routing, intelligent Path Selection, and an Economic Storage implementation, called the LAPSES approach -for cost-effective high performance pipelined  ...  Full-table routing has the flexibility of supporting arbitrary network topologies limited only by the number of ports in the router.  ... 
doi:10.1109/hpca.1999.744375 dblp:conf/hpca/VaidyaSD99 fatcat:lmc35t4t2rbahazgofmhwcetru

Factors in the performance of the AN1 computer network

Susan S. Owicki, Anna R. Karlin
1992 Performance Evaluation Review  
We will seek users for our prototype systems among those with whom we have common research interests, and we will encourage collaboration with university researchers.  ...  Our current work includes exploring high-performance personal computing, distributed computing, programming environments, system modelling techniques, specification technology, and tightly-coupled multiprocessors  ...  The impact of topology on performance is striking. Many standard high-flux networks (such as the hypercube) are adversely affected by up*/down* routing.  ... 
doi:10.1145/149439.133102 fatcat:3hd4wnmzejhyzomukl67stxk3q

Factors in the performance of the AN1 computer network

Susan S. Owicki, Anna R. Karlin
1992 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems - SIGMETRICS '92/PERFORMANCE '92  
We will seek users for our prototype systems among those with whom we have common research interests, and we will encourage collaboration with university researchers.  ...  Our current work includes exploring high-performance personal computing, distributed computing, programming environments, system modelling techniques, specification technology, and tightly-coupled multiprocessors  ...  The impact of topology on performance is striking. Many standard high-flux networks (such as the hypercube) are adversely affected by up*/down* routing.  ... 
doi:10.1145/133057.133102 dblp:conf/sigmetrics/OwickiK92 fatcat:ucs2ymvhhvet7efin2joxhzedi

A Framework for End-to-End Simulation of High-performance Computing Systems

Wolfgang E. Denzel, Jian Li, Peter Walker, Yuho Jin
2009 Simulation (San Diego, Calif.)  
Among other things, it features several network topologies, flexible routing schemes, arbitrary application task placement, point-to-point statistics collection, and data visualization.  ...  With a few case studies, we demonstrate the usefulness of this tool for assisting high-level system design as well as for performance projection and application tuning of future HPC systems.  ...  The authors would also like to thank Lydia Chen, Don DeSota, and Javier Navaridas for valuable discussions and contributions to the work presented in this paper.  ... 
doi:10.1177/0037549709340840 fatcat:fizrw5yihve3baqtgozkqg7woi

Trace-driven Co-simulation of High-Performance Computing Systems using OMNeT++

Cyriel Minkenberg, German Rodriguez Herrera
2009 Proceedings of the Second International ICST Conference on Simulation Tools and Techniques  
A set of additional tools is provided to translate generic topology files to OMNeT's ned format, import route files at run time, perform routing optimizations, and generate particular topologies.  ...  In the context of developing next-generation high-performance computing systems, there is often a need for an "endto-end" simulation tool that can simulate the behaviour of a full application on a reasonably  ...  In addition, as it was designed to simulate a specific system, it does not provide support for arbitrary network topologies.  ... 
doi:10.4108/icst.simutools2009.5521 dblp:conf/simutools/MinkenbergH09 fatcat:ge5setiiknaapf3vjolvfviqc4

Adaptive-trail routing and performance evaluation in irregular networks using cut-through switches

Wenjian Qiao, L.M. Ni, T. Rokicki
1999 IEEE Transactions on Parallel and Distributed Systems  
For cost and performance reasons, irregular topologies should be supported in such a switch-based network.  ...  Due to the arbitrary topologies of networks, it is critical to develop an efficient deadlock-free routing algorithm.  ...  networks with arbitrary topologies.  ... 
doi:10.1109/71.809573 fatcat:zdhbiokdibgwvfi37quwtztvem
« Previous Showing results 1 — 15 out of 27,230 results