5128 search results - page 178 / 1026 » When Abstraction Fails |
191
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
– Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance...
175
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
Memory-intensive applications often suffer from the poor performance of disk swapping when memory is inadequate. Remote memory sharing schemes, which provide a remote memory that ...
179
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
160
click to vote
MIAR
2006
IEEE
16 years 1 months ago
2006
IEEE
Despite technological advances in minimally invasive surgery (MIS) in recent years, 3D visualization of the operative field still remains one of greatest challenges. In this paper,...
204
click to vote
SRDS
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orph...