| Document Date: 2005-12-01 13:38:04
Open Document File Size: 203,88 KBShare Result on Facebook
City Winnipeg / / Company Universal / IEEE Computer Society Press / CASE / Interconnection Networks / / Country Canada / / Currency pence / USD / / / Facility Electrical Engineering Stanford University / Stanford University / / IndustryTerm oblivious algorithms / fixed connection networks / oblivious routing algorithms / size networks / minimal routing algorithms / torus network / feasible solution / adaptive algorithms / node router / terabit switch/router / typical fixed-degree networks / polynomial-time algorithm / symmetric networks / oblivious routing algorithm / adaptive routing algorithms / particular adaptive algorithms / particular routing algorithm / greedy contention-resolution protocols / torus networks / / Organization National Science Foundation / Stanford University / I. T. Association / William J. Dally Department / MARCO Interconnect Focus Research Center / / Person William J. Dally / Brian Towles / / Position designer / system designer / General / / ProvinceOrState Manitoba / / PublishedMedium Journal of the ACM / / SportsLeague Stanford University / / Technology randomized algorithm / adaptive routing algorithms / Avici terabit switch/router / greedy contention-resolution protocols / ROMM routing algorithm / particular adaptive algorithms / ROMM algorithm / node router / two minimal routing algorithms / polynomial-time algorithm / particular routing algorithm / two minimal / oblivious routing algorithms / oblivious routing algorithms / oblivious routing algorithm / ing algorithm / second algorithm / same algorithm / adaptive algorithms / routing algorithm / two algorithms / / URL http /
SocialTag |
WMF2EPS 1.31 : WMF->EPS conversion for indep_contrib.emf