Filters








1,085 Hits in 4.5 sec

GOAL: a load-balanced adaptive routing algorithm for torus networks

Arjun Singh, W.J. Dally, A.K. Gupta, B. Towles
30th Annual International Symposium on Computer Architecture, 2003. Proceedings.  
We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL -Globally Oblivious Adaptive Locally -that provides high throughput on adversarial traffic patterns, matching or exceeding  ...  GOAL achieves global load balance by randomly choosing the direction to route in each dimension. Local load balance is then achieved by routing in the selected directions adaptively.  ...  In this paper, we introduce Globally Oblivious Adaptive Locally (GOAL) -a non-minimal, adaptive routing algorithm for torus networks that strikes a balance between the conflicting goals of locality and  ... 
doi:10.1109/isca.2003.1207000 dblp:conf/isca/SinghDGT03 fatcat:wbujt2oowbbvlkf6kwzkn6ayyu

GOAL

Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles
2003 Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03  
We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL -Globally Oblivious Adaptive Locally -that provides high throughput on adversarial traffic patterns, matching or exceeding  ...  GOAL achieves global load balance by randomly choosing the direction to route in each dimension. Local load balance is then achieved by routing in the selected directions adaptively.  ...  In this paper, we introduce Globally Oblivious Adaptive Locally (GOAL) -a non-minimal, adaptive routing algorithm for torus networks that strikes a balance between the conflicting goals of locality and  ... 
doi:10.1145/859618.859641 fatcat:fjso4ypbpjbfdpuwiznezphr3m

Globally Adaptive Load-Balanced Routing on Tori

A. Singh, W.J. Dally, B. Towles, A.K. Gupta
2004 IEEE computer architecture letters  
It further load balances the network by routing in the selected directions adaptively.  ...  We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information.  ...  ACKNOWLEDGMENT We would like to thank Steve Scott of Cray Inc. for suggesting an improvement to our algorithm.  ... 
doi:10.1109/l-ca.2004.8 fatcat:wp7rjlroiba4zb6xhk3ad7znqy

Optimizing Matrix Transpose on Torus Interconnects [chapter]

Venkatesan T. Chakaravarthy, Nikhil Jain, Yogish Sabharwal
2010 Lecture Notes in Computer Science  
In this paper, we focus on torus interconnection networks and propose application-level routing techniques that improve load balancing, resulting in better performance.  ...  We overcome this issue by employing the routing only for selected set of communicating pairs.  ...  Our goal is to use minimal application-level routing on top of the hardware-level adaptive routing and obtain load balancing.  ... 
doi:10.1007/978-3-642-15291-7_41 fatcat:w4b6pfhfsbdfngvfs4kq3qwese

Adaptive channel queue routing on k-ary n-cubes

Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks.  ...  The only other algorithm that uses global congestion in its routing decision is the Globally Adaptive Load-Balance (GAL) algorithm introduced in [13].  ...  Table 1 shows how these two algorithms incorporate the plus points of a minimal adaptive algorithm (MIN AD) and a load-balancing one called GOAL.  ... 
doi:10.1145/1007912.1007915 dblp:conf/spaa/SinghDGT04 fatcat:jhkjqsxwffdkldpyxbxjseooam

Evaluation Scheme for NoC-based CMP with Integrated Processor Management System

Dawid Zydek, Henry Selvaraj, Leszek Koszałka, Iwona Poźniak-Koszałka
2010 International Journal of Electronics and Telecommunications  
Analyzed results reveal that CMP with a PA controlled by IFF allocation algorithm for mesh systems and torus-based NoC driven by DORLB routing with express-virtual-channel flow control achieved the best  ...  As decision making criteria, we consider energy efficiency of Processor Allocator (PA) and NoC, as well as NoC traffic characteristic (load balance).  ...  Fig. 8 . 8 VC count of each router in the network in IFF-Torus case for DOR, DOR-LB and Adaptive-M3 routing algorithms.  ... 
doi:10.2478/v10177-010-0021-4 fatcat:cqeqzba2vrgi7lovnnxw475svq

ROMM routing on mesh and torus networks

Ted Nesson, S. Lennart Johnsson
1995 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95  
ROMM routing o ers a potential for improved performance compared to both fully randomized algorithms and deterministic oblivious algorithms, under both light and heavy loads.  ...  Here we present analytical and empirical results for ROMM routing on wormhole routed mesh and torus networks.  ...  Minimizing the potential for high congestion of communication links is an important goal in the design of routing algorithms and networks.  ... 
doi:10.1145/215399.215455 dblp:conf/spaa/NessonJ95 fatcat:zoycksfk7jf43al2fpdpw3zlmu

Locality-preserving randomized oblivious routing on torus networks

Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta
2002 Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02  
We introduce Randomized Local Balance (RLB), a routing algorithm that strikes a balance between locality and load balance in torus networks, and analyze RLB's performance for benign and adversarial traffic  ...  While RLB algorithms have somewhat lower guaranteed bandwidth than VAL they have much lower latency at low offered loads (upto 3.65 times less for RLBth).  ...  In this paper, we introduce Randomized Local Balance (RLB) -a randomized oblivious routing algorithm for torus networks that strikes a balance between the conflicting goals of locality and load balance  ... 
doi:10.1145/564870.564873 dblp:conf/spaa/SinghDTG02 fatcat:a4g3h7lpvfbhnn572ctt3chuii

Locality-preserving randomized oblivious routing on torus networks

Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta
2002 Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02  
We introduce Randomized Local Balance (RLB), a routing algorithm that strikes a balance between locality and load balance in torus networks, and analyze RLB's performance for benign and adversarial traffic  ...  While RLB algorithms have somewhat lower guaranteed bandwidth than VAL they have much lower latency at low offered loads (upto 3.65 times less for RLBth).  ...  In this paper, we introduce Randomized Local Balance (RLB) -a randomized oblivious routing algorithm for torus networks that strikes a balance between the conflicting goals of locality and load balance  ... 
doi:10.1145/564871.564873 fatcat:7ud6yd2kabhmxohx6titpg7d7a

Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks

Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique, Mithuna Thottethodi
2005 SIGARCH Computer Architecture News  
Existing routing algorithms for mesh networks fail to satisfy one or more of design goals mentioned above.  ...  Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks.  ...  Vijaykumar, Michael Powell, Ethan Schuchman, Zeshan Chishti, Jahangir Hasan and Ankit Jalote for the useful discussions on this work.  ... 
doi:10.1145/1080695.1070006 fatcat:aoewowwtsrbylft6zqz7fjqvue

Page 556 of Mathematical Reviews Vol. , Issue 97A [page]

1997 Mathematical Reviews  
For mesh connected networks of arbitrary dimension extended by a single 1-bit bus, they design almost optimal strongly adaptive token distribution algorithms.  ...  We present the first algorithms, deterministic and probabilistic, based on this model for the per- mutation routing problem on a chain, on a square mesh, and on a square torus.” 97a:68016 68M10 68Q10 Meyer  ... 

Low latency network and distributed storage for next generation HPC systems: the ExaNeSt project

R Ammendola, A Biagioni, P Cretaro, O Frezza, F Lo Cicero, A Lonardo, M Martinelli, P S Paolucci, E Pastorelli, F Pisani, F Simula, P Vicini (+5 others)
2017 Journal of Physics, Conference Series  
, low latency and high performance network and equipped with a distributed storage architecture.  ...  With processor architecture evolution, the HPC market has undergone a paradigm shift.  ...  The fully adaptive star-channel routing algorithm provides a better use of the available network resources, resulting in higher sustained load and lower latency (figure 11) than those achievable by using  ... 
doi:10.1088/1742-6596/898/8/082045 fatcat:7tytbz7ao5gwxh6oxoxrxcrmxm

Review of Network on Chip Routing Algorithms

Khurshid Ahmad, Muhammad Sethi
2020 EAI Endorsed Transactions on Context-aware Systems and Applications  
Network on chip (NoC) is a communication network for a multiprocessor system on chip (MPSoC). In NoC architecture node/ component of MPSOC are communicating through a network.  ...  The performance of NoC architecture depends on topology, routing algorithm and switching technique.  ...  Congestion oblivious algorithm is unable to balance the load over the network and can't consider the congestion status of the network.  ... 
doi:10.4108/eai.23-12-2020.167793 fatcat:c6mclrcc6fdwlptq3sh4s33qdy

Dodec: Random-Link, Low-Radix On-Chip Networks

Haofan Yang, Jyoti Tripathi, Natalie Enright Jerger, Dan Gibson
2014 2014 47th Annual IEEE/ACM International Symposium on Microarchitecture  
Conventional topologies such as a 2D mesh have drawbacks including high diameter as the network scales and poor load balancing for the center nodes.  ...  We propose a methodology to design random topologies for on-chip networks. Random topologies provide better scalability in terms of network diameter and provide inherent load balancing.  ...  We thank Peter Klausler for positing the idea of a dodecahedronshaped on-chip network.  ... 
doi:10.1109/micro.2014.19 dblp:conf/micro/YangTJG14 fatcat:4r33bidfevbzlds3aogoa4vnsu

Adaptive alternate routing in WDM networks and its performance tradeoffs in the presence of wavelength converters

Iyad Katib, Deep Medhi
2009 Optical Switching and Networkning Journal  
routing (AAR) scheme for wavelength-routed all-optical WDM networks.  ...  A major benefit of AAR is that it can operate and adapt without requiring an exchange of network status, i.e., it is an information-less adaptive routing scheme.  ...  Thus, a major goal, within this context, is to understand how well the schemes adapt under a variety of conditions. Algorithm 2 Adaptive Alternate Routing INPUT: The node pair u.  ... 
doi:10.1016/j.osn.2009.03.001 fatcat:ebpdjhjkjrbxznps42mscupsxi
« Previous Showing results 1 — 15 out of 1,085 results