No part of this work may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording or otherwise, without written permission from the Publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work.
An important cost issue in multimedia servers is disk load balancing, such that the available hard disks are used as e ciently as possible. Disk load balancing is often done on a block basis, but can also be done on a time basis, by taking into account the actual transfer times of the blocks. In the latter approach we can also embed the disk switch times. In this paper we revisit block-based load balancing and introduce time-based load balancing. For each approach we present a mathematical model and analyse the complexity of the corresponding retrieval problem. We give algorithms with a performance bound for the NP-hard time-based retrieval problem and use simulation to compare the results of these algorithms with a maximum ow algorithm for the block-based retrieval problem.
Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.