Sciweavers

45 search results - page 4 / 9
» Scheduling Communication Requests Traversing a Switch: Compl...
Sort
View
INFOCOM
2005
IEEE
14 years 3 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
INFOCOM
2007
IEEE
14 years 4 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires a...
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
INFOCOM
2002
IEEE
14 years 2 months ago
Maintaining Packet Order In Two-stage Switches
-- High performance packet switches frequently use a centralized scheduler (also known as an arbiter) to determine the configuration of a non-blocking crossbar. The scheduler often...
Isaac Keslassy, Nick McKeown
ISCC
2008
IEEE
14 years 4 months ago
A Partially Buffered Crossbar packet switching architecture and its scheduling
The crossbar fabric is widely used as the interconnect of high-performance packet switches due to its low cost and scalability. There are two main variants of the crossbar fabric:...
Lotfi Mhamdi
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 2 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak