Approximation of a retrieval problem for parallel disks

DOI10.1007/3-540-44849-7_23MaRDI QIDQ4437507zbMATH OpenFDO

Authors Joep Aerts, Frits C. R. Spieksma, J. Korst

Publication date 2 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530178.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)

Recommendations

• Approximation algorithms for data placement on parallel disks
• scientific article; zbMATH DE number 1445307
• An approximation algorithm for the generalized assignment problem
• Approximating scheduling problems in parallel
• Minimizing stall time in single and parallel disk systems

Cited in

(6)

• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• Approximability of two variants of multiple knapsack problems
• scientific article; zbMATH DE number 1445307 (Why is no real title available?)
• Optimal packet-to-slot assignment in mobile telecommunications
• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
• Seek distances in disks with two independent heads per surface

This page was built for publication: Approximation of a retrieval problem for parallel disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437507)