![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/6E2237BF-5236-45AE-96F4-E147EFF1D35F | - |
| Αναγνωριστικό | http://link.springer.com/article/10.1007/s007780050065 | - |
| Αναγνωριστικό | https://doi.org/10.1007/s007780050065 | - |
| Γλώσσα | en | - |
| Μέγεθος | 20 pages | en |
| Τίτλος | On periodic resource scheduling for continuous-media databases | en |
| Δημιουργός | Garofalakis Minos | en |
| Δημιουργός | Γαροφαλακης Μινως | el |
| Δημιουργός | Özden Banu | en |
| Δημιουργός | Silberschatz Avi | en |
| Εκδότης | Springer Verlag | en |
| Περίληψη | The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popularity. The aim is to increase the number of clients that can be serviced concurrently beyond the capacity limitations of available resources, while guaranteeing a constraint on the response time. This is achieved by sharing periodic continuous-media streams among multiple clients. The EPPV model offers a number of advantages over other data-sharing schemes (e.g., batching), which make it more attractive to large-scale service providers. In this paper, we provide a comprehensive study of the resource-scheduling problems associated with supporting EPPV for continuous-media clips with (possibly) different display rates, frequencies, and lengths. Our main objective is to maximize the amount of disk bandwidth that is effectively scheduled under the given data layout and storage constraints. Our formulation gives rise to NP-hard combinatorial optimization problems that fall within the realm of hard real-time scheduling theory. Given the intractability of the problems, we propose novel heuristic solutions with polynomial-time complexity. We also present preliminary experimental results for the average case behavior of the proposed scheduling schemes and examine how they compare to each other under different workloads. A major contribution of our work is the introduction of a robust scheduling framework that, we believe, can provide solutions for a variety of realistic EPPV resource-scheduling scenarios, as well as any scheduling problem involving regular, periodic use of a shared resource. Based on this framework, we propose various interesting research directions for extending the results presented in this paper. | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-10-29 | - |
| Ημερομηνία Δημοσίευσης | 1998 | - |
| Θεματική Κατηγορία | Continuous media | en |
| Θεματική Κατηγορία | Multimedia databases | en |
| Θεματική Κατηγορία | Storage systems | en |
| Θεματική Κατηγορία | Real-time scheduling | en |
| Βιβλιογραφική Αναφορά | M. N. Garofalakis, B. Özden and A. Silberschatz, "On periodic resource scheduling for continuous-media databases", VLDB J., vol. 7, no. 4, pp. 206-225, Dec. 1998. doi:10.1007/s007780050065 | en |
Copyright © DIAS 2013
