Please use this identifier to cite or link to this item:
|Title:||Flexible strategies for disk scheduling in multimedia presentation servers|
Flexible disk scheduling
Min-max skip round algorithm
|Citation:||Emilda, S., Jacob, L., Daescu, O., Prabhakaran, B. (2005). Flexible strategies for disk scheduling in multimedia presentation servers. Multimedia Tools and Applications 26 (1) : 81-99. ScholarBank@NUS Repository. https://doi.org/10.1007/s11042-005-6850-y|
|Abstract:||Multimedia presentations (e.g., lectures, digital libraries) normally include discrete media objects such as text and images along with continuous media objects such as video and audio. Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author(s). Hence, even discrete media objects (that do not normally have any real-time characteristics) have temporal constraints on their presentations. Composition of multimedia presentations may be light (without any accompanying video or large multimedia data) or heavy (accompanied by video for the entire presentation duration). The varying nature of the composition of multimedia presentations provides some flexibility for scheduling their retrieval. In this paper, we present a min-max skip round disk scheduling strategy that can admit multimedia presentations in a flexible manner depending on their composition. We also outline strategies for storage of multimedia presentations on an array of disks as well as on multi-zone recording disks. © 2005 Springer Science + Business Media, Inc.|
|Source Title:||Multimedia Tools and Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.