Sciweavers

ICDCS
1999
IEEE
14 years 3 months ago
Proxy Cache Coherency and Replacement - Towards a More Complete Picture
This work studies the interaction of Web proxy cache coherency and replacement policies using trace-driven simulations. We specifically examine the relative importance of each typ...
Balachander Krishnamurthy, Craig E. Wills
ICDCS
1999
IEEE
14 years 3 months ago
The Inter-group Router Approach to Scalable Group Composition
This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-en...
Scott Johnson, Farnam Jahanian, Jigney Shah
ICDCS
1999
IEEE
14 years 3 months ago
NAP: Practical Fault-Tolerance for Itinerant Computations
NAP, a detection and recovery based scheme for implementing fault-tolerant itinerant computations, is presented. We give the semantics for the scheme and describe a protocol that ...
Dag Johansen, Keith Marzullo, Fred B. Schneider, K...
ICDCS
1999
IEEE
14 years 3 months ago
Imprecise Calendars: an Approach to Scheduling Computational Grids
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
Jeffrey K. Hollingsworth, Songrit Maneewongvatana
ICDCS
1999
IEEE
14 years 3 months ago
The Swarm Scalable Storage System
Swarm is a storage system that provides scalable, reliable, and cost-effective data storage. Swarm is based on storage servers, rather than file servers; the storage servers are o...
John H. Hartman, Ian Murdock, Tammo Spalink
ICDCS
1999
IEEE
14 years 3 months ago
Beyond the Black Box: Event-based Inter-Process Communication in Process Support Systems
Existing workflow management systems encapsulate the data and behavior of a process within its execution scope, preventing other processes from accessing this information until th...
Claus Hagen, Gustavo Alonso
ICDCS
1999
IEEE
14 years 3 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
ICDCS
1999
IEEE
14 years 3 months ago
Interpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
Michael Dahlin