57 search results - page 1 / 12 » Efficient, Fully Local Algorithms for CIOQ Switches |
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
IEICET
2006
13 years 4 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...