11565 search results - page 2164 / 2313 » Computing Minimal Mappings |
SIGCOMM
1999
ACM
14 years 1 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
HPDC
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, we present the design and implementation of Dodo, an e cient user-level system for harvesting idle memory in o -the-shelf clusters of workstations. Dodo enables dat...
ICDCS
1999
IEEE
14 years 1 months ago
1999
IEEE
With the increasing complexity of large-scale distributed (LSD) systems, an efficient monitoring mechanism has become an essential service for improving the performance and reliab...
ICPP
1999
IEEE
14 years 1 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given available client buffer and a window-slidin...