A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Locality-preserving randomized oblivious routing on torus networks
2002
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02
Preserved Fulltext
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 ...
Our results show that RLB outperforms deterministic algorithms (25% more bandwidth than Dimension Order Routing) and minimal oblivious algorithms (50% more bandwidth than 2 phase ROMM [9]) on worst-case ...
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
Locality-preserving randomized oblivious routing on torus networks
2002
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
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 ...
Our results show that RLB outperforms deterministic algorithms (25% more bandwidth than Dimension Order Routing) and minimal oblivious algorithms (50% more bandwidth than 2 phase ROMM [9]) on worst-case ...
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
ROMM routing on mesh and torus networks
1995
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here we present analytical and empirical results for ROMM routing on wormhole routed mesh and torus networks. ...
ROMM is a class of Randomized, Oblivious, Multi{phase, Minimal routing algorithms. ...
on mesh and torus networks, we have selected four representative routing tasks. ...
doi:10.1145/215399.215455
dblp:conf/spaa/NessonJ95
fatcat:zoycksfk7jf43al2fpdpw3zlmu
GOAL
2003
Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
GOAL also preserves locality to provide up to 4.6× the throughput of fully randomized routing [19] on local traffic. ...
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 ...
Based on that argument, we introduce a load-balanced, non-minimal adaptive routing algorithm for torus networks, GOAL, that achieves high throughput on adversarial traffic patterns while preserving locality ...
doi:10.1145/859618.859641
fatcat:fjso4ypbpjbfdpuwiznezphr3m
Throughput-centric routing algorithm design
2003
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Applying these techniques to k-ary 2-cube (tori) networks shows that previous routing algorithms sacrifice too much locality to achieve optimal worst-case throughput. ...
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing algorithm, not just its ...
Only randomized, oblivious routing algorithms are considered. ...
doi:10.1145/777412.777444
dblp:conf/spaa/TowlesDB03
fatcat:x7jaghbqpjeazndoohpwchulue
Throughput-centric routing algorithm design
2003
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Applying these techniques to k-ary 2-cube (tori) networks shows that previous routing algorithms sacrifice too much locality to achieve optimal worst-case throughput. ...
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing algorithm, not just its ...
Only randomized, oblivious routing algorithms are considered. ...
doi:10.1145/777441.777444
fatcat:c3xsnonktfbdzo4zww4lb7zl5e
Optical Interconnectivity in a Scalable Data-Parallel System
1997
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
When more than one profitable link is available, the router must choose one of them somehow. There are a few alternative methods: random, dimension-order, and choice-preserving. ...
Nonminimal Adaptive Routing While oblivious and minimal adaptive routers require that a packet always be routed on some path of minimal length, nonminimal adaptive routers allow packets to be routed on ...
doi:10.1006/jpdc.1996.1290
fatcat:pl5xannrpvadtcrabhv5g7735i
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
2005
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For example, O1TURN achieves 18.8%, 0.7% and 13.6% higher average-case throughput than DOR, ROMM and VALIANT routing, respectively when averaged over one million random traffic patterns on an 8x8 network ...
Ideally, we would like a routing algorithm to (a) route packets using the minimal number of hops to reduce latency and preserve communication locality, (b) deliver good worst-case and average-case throughput ...
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
A framework for adaptive routing in multicomputer networks
1991
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The network performance of this highly evolved oblivious technique has reached a limit of being capable of delivering, under random traffic, a stable maximum sustained throughput of~ 45 to 50% of the limit ...
Theoretical bounds on various average network-performance metrics are derived for these rectilinear networks. ...
routes around regions of local congestion, simulations of uniformly random message traffic on the 2D and 3D mesh were conducted. ...
doi:10.1145/121956.121957
fatcat:ffsmnhjqizautb2rini3orlq5i
Optimal Oblivious Path Selection on the Mesh
2008
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is independent. ...
So far, the oblivious algorithms studied in the literature have focused on minimizing the congestion while ignoring the dilation. An open question is whether C and D can be controled simultaneously. ...
For general networks, this is not possible. Optimal Oblivious Routing. ...
doi:10.1109/tc.2008.23
fatcat:u44nhr7gsnfuzg3q3dzmxhmczm
Performance evalulation of different routing algorithms in Network on Chip
2013
2013 IEEE Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
CERTIFICATE This is to certify that the Thesis entitled, " Performance Evaluation of Different Routing Algorithms in Network on Chip" submitted by " Jayant Kumar Singh" bearing Roll No. 212ec2147 to the ...
To preserve locality, minimal oblivious routing can be employed as in Figure 3.5. ...
Valiant's randomized routing algorithm is one
example of an oblivious routing algorithm. ...
doi:10.1109/primeasia.2013.6731201
fatcat:26k7svm2tjehhf2kpppdawmmtu
Evaluation Scheme for NoC-based CMP with Integrated Processor Management System
2010
International Journal of Electronics and Telecommunications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To ensure validity of approaches and research, we propose an evaluation system for CMPs with Network-on-Chip (NoC) and processor management system integrated on one die. ...
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 ...
DOR-LB provides minimal, load balanced oblivious routing and preserves locality. ...
doi:10.2478/v10177-010-0021-4
fatcat:cqeqzba2vrgi7lovnnxw475svq
Cost-effective diameter-two topologies
2015
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For each network, we discuss minimal, indirect random, and adaptive routing algorithms along with deadlock-avoidance mechanisms. ...
However, other than for the Slim Fly, there is currently no clear understanding of the performance and routing of these emerging topologies. ...
Fig. 6 shows the throughput achieved by the three topologies using oblivious routing, either minimal or indirect random. ...
doi:10.1145/2807591.2807652
dblp:conf/sc/KathareiosMPRH15
fatcat:utoappi3yfazzoj4uskc2x2pyy
Energy characteristic of a processor allocator and a network-on-chip
2011
International Journal of Applied Mathematics and Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Energy characteristic of a processor allocator and a network-on-chip Energy consumption in a Chip MultiProcessor (CMP) is one of the most important costs. ...
Besides efficient on-chip processing elements, a well-designed Processor Allocator (PA) and a Network-on-Chip (NoC) are also important factors in the energy budget of novel CMPs. ...
DOR-LB provides a minimal, load balanced oblivious routing and preserves the locality. ...
doi:10.2478/v10006-011-0029-7
fatcat:cby3q2ucczczzpdknrm5lwk2ly
System-Level Buffer Allocation for Application-Specific Networks-on-Chip Router Design
2006
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Compared to a standard data macro-network, an on-chip network is by far more resource limited. ...
To minimize the implementation cost, the on-chip network should be implemented with very little area overhead. ...
Deterministic routing is thus a subset of oblivious routing since in deterministic routing, every source-destination pair has only one routing path. ...
doi:10.1109/tcad.2006.882474
fatcat:ghnclpy3ifdrdb4bff6sfhaxiy
« Previous
Showing results 1 — 15 out of 142 results