General store placement for response time minimization in parallel disks

DOI10.1016/J.JPDC.2007.07.012zbMATH Open1243.68174OpenAlexW1983129223MaRDI QIDQ436635FDOQ436635

Authors: Akshat Verma, Ashok Anand 

Publication date: 25 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.07.012

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Algorithms for non-uniform size data placement on parallel disks
• scientific article; zbMATH DE number 1445307
• Asymptotically optimal declustering schemes for 2-dim range queries.
• Approximation algorithms for data placement on parallel disks

zbMATH Keywords

storage managementdata store placementfile placementparallel disksresponse time minimizationstream placement

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited In (7)

• Title not available (Why is that?)
• A geometrical approach to computing expected cycle times for zonebased storage layouts in AS/RS
• Title not available (Why is that?)
• Compact Markov-modulated models for multiclass trace fitting
• Embedded minimal disks: Proper versus nonproper—global versus local
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: General store placement for response time minimization in parallel disks

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