Minos N. Garofalakis and Yannis E. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590--92, December 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....by a single aggregate work measure. This simplification is done typically to reduce the complexity of the scheduling problem. However, for large task systems that are typically encountered in database applications, ignoring the multi dimensionality could lead to bad performance. The work in [11, 12, 13, 14] demonstrates the practical effectiveness of the multi dimensional approach. One of the basic resource scheduling problem that is considered in the above papers is the problem of scheduling d dimensional vectors (tasks) on d dimensional bins (machines) to minimize the maximum load on any dimension ....

.... vectors (tasks) on d dimensional bins (machines) to minimize the maximum load on any dimension (the load on the most loaded resource) Surprisingly, despite the large body of work on approximation algorithms for multi processor scheduling and its 2 several variants [15, 23] the authors in [11] had to settle for a naive (d 1) approximation for the d dimensional vector scheduling problem. Our work here provides a PTAS when d is fixed and an O(ln 2 d) approximation when d is arbitrary. A similar situation existed for the vector bin packing problem where the best known approximation ....

Minos N. Garofalakis and Yannis E. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590--92, December 1995.

....can be used. Unlike the work 3 of Hall et al. 15, 16] our techniques apply only when jobs are malleable [15, 6, 10, 23] i.e. extra capacity resources can be used to reduce the processing time of jobs. Two such problems are the parallel jobs problem [6, 10, 23] and the vector scheduling problem [13, 7, 4]. Using our techniques we can obtain non polynomial time online algorithms for minimizing the total flow time for these problems. In Section 2 we explain the models that we use. Section 3 contains the main technical contributions of the paper the lower and upper bounds on the performance of ....

M. Garofalakis and Y. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590--592, 1995.

....can be used. Unlike the work 3 of Hall et al. 15, 16] our techniques apply only when jobs are malleable [15, 6, 10, 23] i.e. extra capacity resources can be used to reduce the processing time of jobs. Two such problems are the parallel jobs problem [6, 10, 23] and the vector scheduling problem [13, 7, 4]. Using our techniques we can obtain non polynomial time online algorithms for minimizing the total ow time for these problems. In Section 2 we explain the models that we use. Section 3 contains the main technical contributions of the paper the lower and upper bounds on the performance of ....

M. Garofalakis and Y. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590-592, 1995.

.... a reservation and scheduling mechanism for real time data traffic, which can be extended to networked environments end to end delivery also depends on the network and client (Anderson et al. 1992) A less formal approach to resource reservation and scheduling based on heuristics is presented by Garofalakis and Ioannidis (1995). Much work on resource reservation in multimedia servers deals with disk scheduling (Reddy and Wyllie 1993; Reddy and Wyllie 1994; Mourad 1996) Concentrating on the system bus instead, Khayat and Bovopoulos (1994; 1995) develop a scheduling algorithm for real time continuous data traffic. ....

Garofalakis, M. N and Y. E Ioannidis, 1995. Scheduling Issues in Multimedia Query Optimization. ACM Computing Surveys 27(4):590--592.

....1) can be used. Unlike the work of Hall et al. 14, 15] our techniques apply only when jobs are malleable [14, 6, 10, 22] i.e. extra capacity resources can be used to reduce the processing time of jobs. Two such problems are the parallel jobs problem [6, 10, 22] and the vector scheduling problem [13, 7, 4]. Using our techniques we can obtain non polynomial time online algorithms for minimizing the total flow time for these problems; a detailed discussion of polynomial time online algorithms that use resource augmentation to obtain optimum flow time for these two problems is deferred to the full ....

M. Garofalakis and Y. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590--592, 1995.

....= 1) can be used. Unlike the work of Hall et al. 14, 15] our techniques apply only when jobs are malleable [14, 6, 10, 22] i.e. extra capacity resources can be used to reduce the processing time of jobs. Two such problems are the parallel jobs problem [6, 10, 22] and the vector scheduling problem [13, 7, 4]. Using our techniques we can obtain non polynomial time online algorithms for minimizing the total flow time for these problems; a detailed discussion of polynomial time online algorithms that use resource augmentation to obtain optimum flow time for these two problems is deferred to the full ....

M. Garofalakis and Y. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590--592, 1995.

....by a single aggregate work measure. This simplification is done typically to reduce the complexity of the scheduling problem. For large task systems that are typically encountered in database applications, however, ignoring the multi dimensionality could lead to bad performance. The work in [13, 14, 15, 16] demonstrates the practical effectiveness of the multi dimensional approach. One of the basic resource scheduling problem that is considered in the above papers is the problem of scheduling d dimensional vectors (tasks) on d dimensional bins (machines) to minimize the maximum load on any ....

.... vectors (tasks) on d dimensional bins (machines) to minimize the maximum load on any dimension (the load on the most loaded resource) Surprisingly, despite the large body of work on approximation algorithms for multi processor scheduling and its several variants [17, 25] the authors in [13] had to settle for a naive (d 1) approximation for the above problem. In contrast, our work here provides a PTAS for every fixed d and an O(log 2 d) approximation when d is arbitrary. A similar situation existed for the dual vector bin packing problem where the best known approximation ratio ....

Minos N. Garofalakis and Yannis E. Ioannidis. Scheduling issues in multimedia query optimization. ACM Computing Surveys, 27(4):590--92, December 1995.

.... and show how these constraints can be solved and or modified to ensure consistency [CPS96a] Thimm et al. describe a feedback based architecture for adapting a multimedia presentation to the changes in resource availability by modifying the presentation quality [TK96] In our earlier work [GI95] we presented a scheduling framework for simple (independent) CM streams based on the resource constrained list scheduling methodology of Garey and Graham [GG75] To the best of our knowledge, the only work to address some of the issues in scheduling composite multimedia objects is that of ....

Minos N. Garofalakis and Yannis E. Ioannidis. "Scheduling Issues in Multimedia Query Optimization". ACM Computing Surveys, 27(4):590--592, December 1995. (Symposium on Multimedia).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC