Resource Scheduling for Composite Multimedia Objects
Minos N. Garofalakis, Yannis E. Ioannidis, Banu Ozden
Full Paper (PDF)

Abstract
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This requirement gives rise to task models that are significantly more complex than the models employed in scheduling theory and practice. In this paper, we formulate the resource scheduling problems for compositemultimedia objects and develop novel efficient scheduling algorithms drawing on a number of techniques from pattern matching and multiprocessor scheduling. Our formulation is based on a novel sequence packing problem, wherethe goal is to superimpose numeric sequences (representing the objects' resource needs as a function of time) within a fixed capacity bin (representing the server's resource capacity). Given the intractability of the problem, we propose heuristic solutions using a two-step approach. First, we present a "basic step" method for packing two composite object sequences into a single, combined sequence. Second, we show how this basic step can be employed within different scheduling algorithms to obtain a playout schedule for multiple objects. More specifically, we present an algorithm based on Graham's list-scheduling method that is provably near- optimal for monotonic object sequences. We also suggest a number of optimizations on the base list- scheduling scheme. Preliminary experimental results confirm the effectiveness of our approach.

References

References, where available, link to the DBLP on the World Wide Web.

[1]
James F. Allen: Maintaining Knowledge about Temporal Intervals. CACM 26(11): 832-843(1983)
[2]
Amihood Amir, Martin Farach: Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. SODA 1991: 212-223
[3]
...
[4]
Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest: Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4): 846-855(1980)
[5]
Brenda S. Baker, Jerald S. Schwarz: Shelf Algorithms for Two-Dimensional Packing Problems. SIAM J. Comput. 12(3): 508-525(1983)
[6]
Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein: Improved Scheduling Algorithms for Minsum Criteria. ICALP 1996: 646-657
[7]
Surajit Chaudhuri, Shahram Ghandeharizadeh, Cyrus Shahabi: Retrieval of Composite Multimedia Objects. VLDB 1995: 287-298
[8]
...
[9]
...
[10]
...
[11]
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. SIAM J. Comput. 9(4): 808-826(1980)
[12]
...
[13]
M. R. Garey, R. L. Graham: Bounds for Multiprocessor Scheduling with Resource Constraints. SIAM J. Comput. 4(2): 187-200(1975)
[14]
...
[15]
M. R. Garey, David S. Johnson: Computer and Intractability: A Guide to NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
[16]
Minos N. Garofalakis, Yannis E. Ioannidis: Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources. VLDB 1997: 296-305
[17]
...
[18]
R. L. Graham: Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics 17(2): 416-429(1969)
[19]
...
[20]
Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt: Fast Pattern Matching in Strings. SIAM J. Comput. 6(2): 323-350(1977)
[21]
...
[22]
...
[23]
...
[24]
S. Muthukrishnan, Krishna V. Palem: Non-standard Stringology: Algorithms and Complexity. STOC 1994: 770-779
[25]
Banu Özden, Alexandros Biliris, Rajeev Rastogi, Abraham Silberschatz: A Low-Cost Storage Server for Movie on Demand Databases. VLDB 1994: 594-605
[26]
Christos H. Papadimitriou, Kenneth Steiglitz: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall 1982, ISBN 0-13-152462-3
[27]
Timos K. Sellis: Multiple-Query Optimization. TODS 13(1): 23-52(1988)
[28]
...
[29]
...
[30]
David B. Shmoys, Joel Wein, David P. Williamson: Scheduling Parallel Machines On-Line. SIAM J. Comput. 24(6): 1313-1331(1995)
[31]
Mikkel Thorup: On RAM Priority Queues. SODA 1996: 59-67
[32]
...
BIBTEX

@inproceedings{DBLP:conf/vldb/GarofalakisIO98,
author = {Minos N. Garofalakis and
Yannis E. Ioannidis and
Banu {\"O}zden},
editor = {Ashish Gupta and
Oded Shmueli and
Jennifer Widom},
title = {Resource Scheduling for Composite Multimedia Objects},
booktitle = {VLDB'98, Proceedings of 24rd International Conference on Very
Large Data Bases, August 24-27, 1998, New York City, New York,
USA},
publisher = {Morgan Kaufmann},
year = {1998},
isbn = {1-55860-566-5},
pages = {74-85},
crossref = {DBLP:conf/vldb/98},
bibsource = {DBLP, http://dblp.uni-trier.de}
}


DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).