Data management in networks: experimental evaluation of a provably good strategy
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Locally efficient on-line strategies for routing packets along fixed paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Data management in hierarchical bus networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data management in networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Bandwidth constrained placement in a WAN
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed caching independent of the network size
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Optimal replication algorithms for hierarchical mobility management in PCS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay Optimizations in Quorum Consensus
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
New lower bounds for oblivious routing in undirected graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Contention-aware data caching in wireless multi-hop ad hoc networks
Journal of Parallel and Distributed Computing
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
A content replication scheme for wireless mesh networks
Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
Oblivious low-congestion multicast routing in wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Towards load balanced distributed transactional memory
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
A divide-and-conquer approach for content replication in WMNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of placing and accessing a set of shared objects that are read and written from the nodes in the network. These objects are, e.g., global variables in a parallel program, pages or cache lines in a virtual shared memory system, or shared files in a distributed file system. %It is assumed that each node has its own local memory module such %that the shared objects have to be distributed among the nodes. A data mangement strategy consists of a placement strategy that maps the objects (possibly dynamically and with redundancy) to the nodes, and an access strategy that describes how reads and writes are handled by the system (including the routing). We investigate static and dynamic data management strategies. In the static model, we assume that we are given an application for which the rates of read and write acesses for all node--object pairs are known. The goal is to calculate a static placement of the objects to the nodes in the network and to specify the routing such that the network congestion is minimized. We introduce efficient algorithms that calculate optimal or close--to--optimal solutions for tree--connected networks, meshes of arbitrary dimension and internet--like clustered networks. These algorithms take time only linear in the input size. In the dynamic model, we assume no knowledge about the access pattern. An adversary specifies accesses at runtime. Here we devolop dynamic caching strategies that also aim to minimize the congestion on trees, meshes and clustered networks. These strategies are investigated in an competitive model. For example, we achieve competitive ratio 3 for tree--connected networks and competitive ratio O(d \cdot \log n) for d--dimensional meshes of size n. Further, we present an \Omega(\log n / d) lower bound for the competitive ratio for on--line routing in meshes, which implies that the achieved upper bound on the competive ratio for meshes of constant dimension is optimal.