147 search results - page 21 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
IDC
2009
Springer
15 years 6 months ago
2009
Springer
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
PDPTA
2004
15 years 1 months ago
2004
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
130
click to vote
COMSNETS
2012
13 years 7 months ago
2012
—Virtualized cloud-based services can take advantage of statistical multiplexing across applications to yield significant cost savings to the operator. However, achieving simila...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...