An extended framework for worst-case throughput analysis with router constraint
暂无分享,去创建一个
[1] S. Lennart Johnsson,et al. ROMM routing on mesh and torus networks , 1995, SPAA '95.
[2] Akif Ali,et al. Near-optimal worst-case throughput routing for two-dimensional mesh networks , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).
[3] Guang Sun,et al. A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network , 2013, IEEE Computer Architecture Letters.
[4] Radu Marculescu,et al. Analytical router modeling for networks-on-chip performance analysis , 2007 .
[5] Bruce M. Maggs,et al. Fast algorithms for bit-serial routing on a hypercube , 1990, SPAA '90.
[6] William J. Dally,et al. Worst-case Traffic for Oblivious Routing Functions , 2002, IEEE Comput. Archit. Lett..
[7] William J. Dally,et al. Principles and Practices of Interconnection Networks , 2004 .
[8] P. Cochat,et al. Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.
[9] Nan Jiang,et al. A detailed and flexible cycle-accurate Network-on-Chip simulator , 2013, 2013 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS).
[10] Jordi Cortadella,et al. A performance analytical model for Network-on-Chip with constant service time routers , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.
[11] Bruce M. Maggs,et al. Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.
[12] H. Kuhn. The Hungarian method for the assignment problem , 1955 .