{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:44:49Z","timestamp":1742384689334},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0020-0190(00)00115-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"51-59","source":"Crossref","is-referenced-by-count":15,"title":["Random duplicate storage strategies for load balancing in multimedia servers"],"prefix":"10.1016","volume":"76","author":[{"given":"Joep","family":"Aerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Korst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Egner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00115-0_ID005","doi-asserted-by":"crossref","unstructured":"J. Aerts, J. Korst, W. Verhaegh, Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility. Submitted to Journal of Scheduling","DOI":"10.1002\/jos.81"},{"key":"10.1016\/S0020-0190(00)00115-0_ID006","series-title":"Proc. 7th International Workshop on Project Management and Scheduling","first-page":"25","article-title":"Load balancing in multimedia servers","author":"Aerts","year":"2000"},{"key":"10.1016\/S0020-0190(00)00115-0_ID007","series-title":"Proc. Compcon Conference","article-title":"Randomized data allocation for real-time disk I\/O","author":"Berson","year":"1996"},{"key":"10.1016\/S0020-0190(00)00115-0_ID008","series-title":"IEEE Computer","article-title":"Multimedia storage servers: A tutorial","author":"Gemmell","year":"1995"},{"key":"10.1016\/S0020-0190(00)00115-0_ID009","series-title":"Proc. Data Engineering","first-page":"456","article-title":"Chained declustering: A new availability strategy for multiprocessor database machines","author":"Hsiao","year":"1990"},{"key":"10.1016\/S0020-0190(00)00115-0_ID010","series-title":"Proc. ACM Multimedia","first-page":"219","article-title":"Random duplicated assignment: An alternative to striping in video servers","author":"Korst","year":"1997"},{"issue":"3","key":"10.1016\/S0020-0190(00)00115-0_ID011","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/12.372034","article-title":"Analytic modeling and comparisons of striping strategies for replicated disk arrays","volume":"Vol. 44","author":"Merchant","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(00)00115-0_ID012","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1002\/(SICI)1098-111X(199812)13:12<1137::AID-INT4>3.0.CO;2-M","article-title":"A parallel disk storage system for real-time multimedia apllications","volume":"Vol. 13","author":"Muntz","year":"1998","journal-title":"Internat. J. Intelligent Systems"},{"key":"10.1016\/S0020-0190(00)00115-0_ID013","series-title":"Proc. MIS'98","first-page":"4","article-title":"A scalable video-on-demand server for a dynamic heterogeneous environment","volume":"Vol. 1508","author":"Papadopouli","year":"1998"},{"key":"10.1016\/S0020-0190(00)00115-0_ID014","series-title":"Proc. ACM Conference on Management of Data (SIGMOD '88)","first-page":"109","article-title":"A case for redundant arrays of inexpensive disks (raid)","author":"Patterson","year":"1988"},{"key":"10.1016\/S0020-0190(00)00115-0_ID015","series-title":"Numerical Recipes in C","author":"Press","year":"1992"},{"key":"10.1016\/S0020-0190(00)00115-0_ID016","series-title":"Proc. 12th ACM Symposium on Parallel Algorithms and Architectures","article-title":"Asynchronous scheduling for redundant disk arrays","author":"Sanders","year":"2000"},{"key":"10.1016\/S0020-0190(00)00115-0_ID017","series-title":"Proc. Multimedia Computing and Networking","article-title":"Block allocation in video servers for availability and throughput","author":"Tetzlaff","year":"1996"},{"key":"10.1016\/S0020-0190(00)00115-0_ID018","series-title":"Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, Elsevier Science, Amsterdam\/MIT Press, Cambridge, MA","first-page":"525","article-title":"Graph algorithms","author":"van Leeuwen","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001150?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001150?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:22:01Z","timestamp":1556158921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0020019000001150"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00115-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}