Design and implementation of scalable continuous media servers

DOI10.1016/S0167-8191(97)00118-XMaRDI QIDQ1128680zbMATH OpenOpenAlexFDO

Authors Shahram Ghandeharizadeh, Richard R. Muntz

Publication date 13 August 1998

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(97)00118-x

zbMATH Keywords

scalabilitymultimediaexperimental resultscontinuous media serversstorage subsystemsstriping

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Network design and communication in computer systems (68M10)

Recommendations

• A simple distributed scheduling policy for parallel interactive continuous media servers
• Batching and dynamic allocation techniques for increasing the stream capacity of an on-demand media server
• Incremental scheduling of mixed workloads in multimedia information servers
• scientific article; zbMATH DE number 1949561
• SMDP: Minimizing buffer requirements for continuous media servers

Cited in

(18)

• A Placement Strategy Of Multimedia Objects Based On Temporal Relationships
• scientific article; zbMATH DE number 2090504 (Why is no real title available?)
• scientific article; zbMATH DE number 2043561 (Why is no real title available?)
• Data migration on parallel disks: Algorithms and evaluation
• The class constrained bin packing problem with applications to video-on-demand
• Approximation schemes for generalized two-dimensional vector packing with application to data placement
• scientific article; zbMATH DE number 1949561 (Why is no real title available?)
• scientific article; zbMATH DE number 1983216 (Why is no real title available?)
• Design of multi-user editing servers for continuous media
• Incremental scheduling of mixed workloads in multimedia information servers
• A note on dual approximation algorithms for class constrained bin packing problems
• Modeling and generating realistic streaming media server workloads
• Tight bounds for online class-constrained packing
• Polynomial time approximation schemes for class-constrained packing problems
• scientific article; zbMATH DE number 1947714 (Why is no real title available?)
• scientific article; zbMATH DE number 2090686 (Why is no real title available?)
• scientific article; zbMATH DE number 1955768 (Why is no real title available?)
• scientific article; zbMATH DE number 1984146 (Why is no real title available?)

This page was built for publication: Design and implementation of scalable continuous media servers

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