JCP
2008
13 years 11 months ago
2008
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
CN
2007
13 years 11 months ago
2007
The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is ...
NETWORKING
2008
14 years 10 days ago
2008
We study distributed content replication networks formed voluntarily by selfish autonomous users, seeking access to information objects that originate from distant servers. Each us...
FODO
1998
Springer
14 years 3 months ago
1998
Springer
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
ICDCS
2003
IEEE
14 years 4 months ago
2003
IEEE
We present the design of a distributed store that offers various levels of security guarantees while tolerating a limited number of nodes that are compromised by an adversary. The...
ICNP
2006
IEEE
14 years 5 months ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
MFCS
2007
Springer
14 years 5 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
ICDE
2005
IEEE
15 years 8 days ago
2005
IEEE
