-
1
-
-
0034226899
-
The odd-even turn model for adaptive routing
-
Ge-Ming Chiu. The odd-even turn model for adaptive routing. IEEE Trans. Parallel Distrib. Syst., 11(7):729-738, 2000.
-
(2000)
IEEE Trans. Parallel Distrib. Syst
, vol.11
, Issue.7
, pp. 729-738
-
-
Chiu, G.-M.1
-
2
-
-
57849086430
-
Diastolic Arrays: Throughput-Driven Reconfigurable Computing
-
November
-
M. H. Cho, C.-C. Cheng, M. Kinsy, G. E. Suh, and S. Devadas. Diastolic Arrays: Throughput-Driven Reconfigurable Computing. In Proceedings of the Int'l Conference on Computer-Aided Design, November 2008.
-
(2008)
Proceedings of the Int'l Conference on Computer-Aided Design
-
-
Cho, M.H.1
Cheng, C.-C.2
Kinsy, M.3
Suh, G.E.4
Devadas, S.5
-
3
-
-
70349806243
-
-
M. H. Cho, M. Lis, K. S. Shim, M. Kinsy, T. Wen, and S. Devadas. Oblivious routing in on-chip bandwidth-adaptive networks. Technical Report CSAIL-TR-2009-011 (http://hdl.handle.net/1721.1/44958), Massachusetts Institute of Technology, March 2009.
-
M. H. Cho, M. Lis, K. S. Shim, M. Kinsy, T. Wen, and S. Devadas. Oblivious routing in on-chip bandwidth-adaptive networks. Technical Report CSAIL-TR-2009-011 (http://hdl.handle.net/1721.1/44958), Massachusetts Institute of Technology, March 2009.
-
-
-
-
5
-
-
0023346637
-
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
-
William J. Dally and Charles L. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Trans. Computers, 36(5):547-553, 1987.
-
(1987)
IEEE Trans. Computers
, vol.36
, Issue.5
, pp. 547-553
-
-
Dally, W.J.1
Seitz, C.L.2
-
8
-
-
0000466264
-
Scalable pipelined interconnect for distributed endpoint routing: The SGI SPIDER chip
-
August
-
Mike Galles. Scalable pipelined interconnect for distributed endpoint routing: The SGI SPIDER chip. In Proceedings of the Symposium on Hot Interconnects, pages 141-146, August 1996.
-
(1996)
Proceedings of the Symposium on Hot Interconnects
, pp. 141-146
-
-
Galles, M.1
-
10
-
-
0028513557
-
The turn model for adaptive routing
-
Christopher J. Glass and Lionel M. Ni. The turn model for adaptive routing. J. ACM, 41(5):874-902, 1994.
-
(1994)
J. ACM
, vol.41
, Issue.5
, pp. 874-902
-
-
Glass, C.J.1
Ni, L.M.2
-
11
-
-
70450237428
-
Marten van Dijk, and Srinivas Devadas. Application-Aware Deadlock-Free Oblivious Routing
-
June
-
Michel Kinsy, Myong Hyon Cho, Tina Wen, Edward Suh, Marten van Dijk, and Srinivas Devadas. Application-Aware Deadlock-Free Oblivious Routing. In Proceedings of the Int'l Symposium on Computer Architecture, June 2009.
-
(2009)
Proceedings of the Int'l Symposium on Computer Architecture
-
-
Kinsy, M.1
Hyon Cho, M.2
Wen, T.3
Suh, E.4
-
14
-
-
36849063126
-
Research Challenges for On-Chip Interconnection Networks
-
Sept/Oct
-
J. D. Owens, W. J. Dally, R. Ho, D. N. Jayasimha, S. W Keckler, and L.-S. Peh. Research Challenges for On-Chip Interconnection Networks. IEEE Micro, 27(5):96-108, Sept/Oct 2007.
-
(2007)
IEEE Micro
, vol.27
, Issue.5
, pp. 96-108
-
-
Owens, J.D.1
Dally, W.J.2
Ho, R.3
Jayasimha, D.N.4
Keckler, S.W.5
Peh, L.-S.6
-
15
-
-
44149128008
-
Design of bandwidth aware and congestion avoiding efficient routing algorithms for networks-on-chip platforms
-
M. Palesi, G. Longo, S. Signorino, R. Holsmark, S. Kumar, and V. Catania. Design of bandwidth aware and congestion avoiding efficient routing algorithms for networks-on-chip platforms. Proc. of the ACM/IEEE Int. Symp. on Networks-on-Chip (NOCS), pages 97-106, 2008.
-
(2008)
Proc. of the ACM/IEEE Int. Symp. on Networks-on-Chip (NOCS)
, pp. 97-106
-
-
Palesi, M.1
Longo, G.2
Signorino, S.3
Holsmark, R.4
Kumar, S.5
Catania, V.6
-
18
-
-
27544463701
-
Near-optimal worst-case throughput routing for two-dimensional mesh networks
-
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique, and Mithuna Thottethodi. Near-optimal worst-case throughput routing for two-dimensional mesh networks. In Proceedings of the 32nd Annual International Symposium on Computer Architecture (ISCA 2005), pages 432-443, 2005.
-
(2005)
Proceedings of the 32nd Annual International Symposium on Computer Architecture (ISCA 2005)
, pp. 432-443
-
-
Seo, D.1
Ali, A.2
Lim, W.-T.3
Rafique, N.4
Thottethodi, M.5
-
20
-
-
33745928447
-
New algorithms for the unsplittable flow problem
-
ICCSA 2, of
-
Krzysztof Walkowiak. New algorithms for the unsplittable flow problem. In ICCSA (2), volume 3981 of Lecture Notes in Computer Science, pages 1101-1110, 2006.
-
(2006)
Lecture Notes in Computer Science
, vol.3981
, pp. 1101-1110
-
-
Walkowiak, K.1
|