NDLI: Approximation algorithms for data management in networks

Please wait, while we are loading the content...

Compact routing schemes

Routing without flow control

Fast, minimal and oblivious routing algorithms on the mesh with bounded queues

One-to-Many routing on the mesh

Simple on-line algorithms for the maximum disjoint paths problem

Stability and non-stability of the FIFO protocol

Competitve buffer management for shared-memory switches

Tradeoffs between knowledge and time of communication in geometric radio networks

Attack propagation in networks

Deterministic resource discovery in distributed networks

Latency effects on reachability in large-scale peer-to-peer networks

Towards a first vertical prototyping of an extremely fine-grained parallel programming approach

A cost effective architecture for vectorizable numerical and multimedia applications

Automatable verification of sequential consistency

Room synchronizations

A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Computational power of pipelined memory hierarchies

Optimal semi-oblique tiling

Finding large independent sets of hypergraphs in parallel

Columnsort lives! an efficient out-of-core sorting program

Efficient parallel exponentiation in GF(2n) using normal basis representations

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

Scheduling on hierarchical clusters using malleable tasks

Scheduling best-effort and real-time pipelined applications on time-shared clusters

Optimal prefetching and caching for parallel I/O sytems

Ordering disks for double erasure codes

Approximation algorithms for data management in networks

A data tracking scheme for general networks

New spectral bounds on k-partitioning of graphs

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Towards practical deteministic write-all algorithms

Estimating simple functions on the union of data streams

Randomized k-set agreement

Periodic, random-fault-tolerant correction networks

D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks

A note on cycle covering

Pursuit and evasion on a ring: An infinite hierarchy for parallel real—time systems

Scheduling tasks with small communication delays for clusters of processors

Library support for orthogonal processor groups

The push tree problem

Parallel controlled conspiracy number search

On tiling space-time mapped loop nests

A parallel block algorithm for exact triangularization of rectangular matrices

Eventually consistent failure detectors

Finding strongly connected components in parallel in particle transport sweeps

A work-optimal CGM algorithm for the LIS problem

Modeling weakly consistent memories with locks

The power of duality for prefetching and sorting with parallel disks

Approximation algorithms for data management in networks

Content Provider	ACM Digital Library
Author	Krick, Christof Räcke, Harald Westermann, Matthias
Abstract	This paper deals with static data management in computer systems connected by networks. A basic functionality in these systems is the interactive use of shared data objects that can be accessed from each computer in the system. Examples for these objects are files in distributed file systems, cache lines in virtual shared memory systems, or pages in the WWW. In the static scenario we are given read and write request frequencies for each computer-object pair. The goal is to calculate a placement of the objects to the memory modules, possibly with redundancy, such that a given cost function is minimized.With the widespread use of commercial networks, as, e.g., the Internet, it is more and more important to consider commercial factors within data management strategies. The goal in previous work was to utilize the available resources, especially the bandwidth, as good as possible. We will present data management strategies for a model in which commercial cost instead of the communication cost are minimized, i.e., we are given a metric communication cost function and a storage cost function.We introduce new deterministic algorithms for the static data management problem on trees and arbitrary networks. Our algorithms aim to minimize the total cost. To our knowledge this is the first analytic treatment of this problem that is NP-hard on arbitrary networks. Our main result is a combinatorial algorithm that calculates a constant factor approximation for arbitrary networks in polynomial time. Further, we present an algorithm for trees that calculates an optimal placement of all objects in X on a tree T = (V, E) in time &Ogr;(¦X¦ · ¦V¦ · diam(T) · log(deg(T))).
Starting Page	237
Ending Page	246
Page Count	10
File Format	PDF
ISBN	1581134096
DOI	10.1145/378580.378651
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-07-03
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in