Approximation of a retrieval problem for parallel disks

Authors:
Joep Aerts;Jan Korst;Frits Spieksma
Affiliations:
Centre of Quantitative Methods, Eindhoven, The Netherlands;Philips Research Labs, Eindhoven, The Netherlands;Department of Applied Economics, Katholieke Universiteit Leuven, Leuven, Belgium
Venue:
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Year:
2003

Citing 11
Cited 3

An introduction to disk drive modeling

Computer
Random duplicated assignment: an alternative to striping in video servers

MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Persistency in 0-1 Polynomial Programming

Mathematics of Operations Research
Approximation algorithms for data placement on parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Comparing random data allocation and data striping in multimedia servers

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asynchronous scheduling of redundant disk arrays

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Reconciling simplicity and realism in parallel disk models

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems

IEEE Transactions on Computers
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine

Operations Research Letters

Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

Journal of Scheduling
Optimal packet-to-slot assignment in mobile telecommunications

Operations Research Letters
A (1-1/e)-approximation algorithm for the generalized assignment problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a number of retrieval problems that relate to effectively using the throughput of parallel disks. These problems can be formulated as assigning a maximum number of jobs to machines of capacity two, where jobs are of size one or two that must satisfy assignment restrictions. We prove that the LP-relaxation of an integer programming formulation is half-integral, and derive an interesting persistency property. In addition, we derive 2/3-approximation results for two types of retrieval problems.