J. Nieh and M. S. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proc. of 16th Symposium on Operating Systems Principles, Oct. 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....schedulers in handling best effort processes, and sometimes outperforms both. Section 2 discusses the design and implementation of BEST, Section 3 presents our preliminary results, and Section 4 presents some concluding remarks. 2 Design and Implementation Soft real time schedulers exist [1, 3, 4, 5, 6, 9, 11, 12], but they impose constraints on developers and users that limit their practicality in generic desktop environments; they require applications to interface with special purpose routines and, like most real time systems, they generally require specifications of application resource usage and ....

Jason Nieh and Monica Lam. The design, implementation and evaluation of SMART:A scheduler for multimedia applications. In Proceedings of the Sixteenth Symposium on Operating System Principals, October 1997.

....scheme priority. If the children nodes have share based constraints, the algorithm selects a child node on the basis of the share allocations or the children nodes. The algorithm to allocate CPU on the basis of share based constraints extends the ideas in the SMART scheduling algorithm [20] to a hierarchy. SMART defines two numbers for each application a virtual time (VT) and a virtual finish time (VFT) The notion of VT and VFT was developed in fair queuing algorithms for congestion control in network protocols [15] and has been used in CPU scheduling in SMART and Stride ....

....the first experiment (Figure 10(a) we simulate the execution of an application that displays real time video streams from the local storage. The video input stream contains frames in JPEG compressed format at 15 frames sec. We assume that the estimated execution time per frame to be about 30ms [20]. The application makes reservation requests for each frame within a 100msec period. If the reservation 21 0 0.2 0.4 0.6 0.8 1 1.2 0 10 20 30 40 50 60 70 allocation of mobile programs Time MP 3 MP 4 MP 5 (a) Relative allocation of mobile programs 1000 2000 3000 4000 5000 ....

[Article contains additional citation context not shown here]

Jason Nieh and Monica Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. 16th ACM Symposium on Operating Systems Principles, October 1997.

....with the highest priority. If the children nodes have share based constraints, the algorithm selects a child node on the basis of the share allocations of the children nodes. The algorithm to allocate CPU on the basis of share based constraints extends the ideas in the SMART scheduling algorithm [11] to a hierarchy. We define three quantities: upper virtual time (###) virtual finish time (###) and lower virtual time (## # ) for each node in the hierarchy. The reason we require ### and ## # is that in #### , each internal node is both a child node and a parent node. ### of the internal node ....

J. Nieh and M. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. 16th ACM Symposium on Operating Systems Principles, October 1997.

....schedulers of diverse types. Classical real time schedulers like rate monotonic or earliest deadline first lack the firewall property [11, 15] To adapt to dynamic application behavior, certain scheduling algorithms require close application participation, and sophisticated schedulability tests [14]. Other systems have appealed to policing mechanisms external to the scheduling algorithm, such as priority depression [10, 13, 17] We propose a solution that uniformly applies the well proven technique of rate based scheduling for diverse application requirements. By considering scheduling ....

J. Nieh and M. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proc. of 16th ACM Symp. on Operating System Principles, Cannes, France, November 1997.

....1 0 0.05 0.1 0.15 0.2 0.25 0.3 Class 0 Class 1 (a) Average delays for CPU (b) Average delays for accept queue Fig. 8. Delays for system wide adaptation for the CPU and the accept queue. ous predictable resource management mechanisms developed for the host operating system ( 5] 8] [12], 14] can be used. Our work is complementary to the development of such mechanisms. In fact, we assume the existence of such mechanisms and show how to automate the task of parameterizing these mechanisms to achieve self manageability in the system. VII. CONCLUSIONS AND FUTURE WORK In this ....

J. Nieh and M S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the ACM Symposium on Operating Systems Principles, December 1997.

....research efforts have developed predictable resource management mechanisms and techniques for the host operating system. Resource Containers [7] is a kernel mechanism for accurate accounting of resource usage that can be used for service differentiation on a web server. SFQ [17] BVT [15] SMART [24] are predictable scheduling algorithms that can be employed as basic scheduling mechanisms in the kernel. Kernel mechanisms for early classification and managing of accept queue delay have been proposed in [14, 28] Our work is complementary to the development of such mechanisms. In fact, we ....

J. Nieh and M S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the ACM Symposium on Operating Systems Principles, December 1997.

....with the highest priority. If the children nodes have share based constraints, the algorithm selects a child node on the basis of the share allocations of the children nodes. The algorithm to allocate CPU on the basis of share based constraints extends the ideas in the SMART scheduling algorithm [17] to a hierarchy. SMART defines two numbers for each application a virtual time (VT) and a virtual finish time (VFT) The notion of## was originally developed in fair queuing algorithms for congestion control in network protocols [13] and has been used in CPU scheduling in SMART and Stride ....

....the first experiment (Figure 10(a) we simulate the execution of an application that displays real time video streams from the local storage. The video input stream contains frames in JPEG compressed format at 15 frames sec. We assume that the estimated execution time per frame to be about 30ms [17]. The application makes reservation requests for each frame within a 100ms period. If the reservation is granted then the application displays the frame; otherwise it skips the frame. The graph (Figure 10(a) shows how the upper bounds and reserved bandwidth affect real time applications. The ....

[Article contains additional citation context not shown here]

J. Nieh and M. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. 16th ACM Symposium on Operating Systems Principles, Oct. 1997.

....of AOP based techniques to other OS kernel modules. 1 Introduction Over the recent years, there has been a continuous demand for new scheduling policies to address specific requirements of modern OSes and emerging applications. Examples include policies for multimedia and real time applications [2, 3, 6, 10, 14] and energybased policies so as to increase the mission time of portable devices [8, 12, 11] While the need for new scheduling policies is well recognized, their implementation within an existing OS kernel raises many problems. Based on an analysis of several OS kernels such as RT Linux, Linux ....

J. Nieh and M. S. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP'97), pages 184--197, October 1997.

....which we see in Figure 13 as the QoS curve steadily declines from its maximum and eventually drops below the slopeslack technique at about 260 partitions. 7 Related Work There has been extensive research on scheduling tasks under real time performance expectations both in operating systems [14, 16, 17, 20] and database systems [3, 11, 12, 18, 19] To the best of our knowledge, Aurora s scheduling approach that combines priority assignment and dynamic scheduling plan consauction is the first comprehensive proposal for scheduling continuous queries over real time data streams and QoS expectations. ....

J. Nieh and M. S. Lam. The Design, implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. in Proc. 16th ACM Symposium on OS Principles, 1997.

No context found.

J. Nieh and M. S. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proc. of 16th Symposium on Operating Systems Principles, Oct. 1997.

No context found.

Jason Nieh and Monica S. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 184--197. ACM, 1997.

No context found.

J. Nieh and M. S. Lam. The design, implementation and evaluation of SMART: a scheduler for multimedia applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 184--197. ACM Press, 1997.

No context found.

Jason Nieh and M.S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In 16th ACM Symposium on Operating Systems Principles, October 1997.

No context found.

J. Nieh and M. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP '97), Oct. 1997.

No context found.

J. Nieh and M.S. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proc. 16th ACM Symposium on Operating System Principles, pages 184--197, 1997.

No context found.

Nieh J, Lam MS (1997) The design, implementation and evaluation of SMART: a scheduler for multimedia applications. In: Proceedings of the 16th ACM symposium on OS principles

No context found.

J. Nieh and M. S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the 16th Symposium on Operating Systems Principles (SOSP-97), New York, Oct. 1997.

No context found.

J. Nieh and M. S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the 16th Symposium on Operating Systems Principles (SOSP-97), New York, Oct. 1997.

No context found.

Jason Nieh and Monica S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Mult imedia Applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, October 1997.

No context found.

J. Nieh and M. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP '97), Oct. 1997.

No context found.

Jason Nieh, Monica Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. Proceedings of the Sixteenth ACM Symposium on operating Systems Principles, St. Malo, France, Oct. 1997.

No context found.

Jason Nieh and Monica S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 184--197, October 1997.

No context found.

Jason Nieh and Monica Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Symposium on Operating Systems Principles, October 1997.

No context found.

J. Nieh and M S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the ACM Symposium on Operating Systems Principles, December 1997.

No context found.

J. Nieh and M S. Lam. The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications. In Proceedings of the ACM Symposium on Operating Systems Principles, December 1997.

First 50 documents  Next 50

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