scispace - formally typeset
Book ChapterDOI

Integrated Processors Scheduling for Multimedia

Jason Nieh, +1 more
- pp 202-205
TLDR
This work has created a new scheduler that provides integrated processor scheduling for all classes of computational activities, and achieves optimal performance when all timeliness requirements can be satisfied, and provides graceful degradation when the system is overloaded.
Abstract
The advent of multimedia ushers forth a growing class of applications that must manipulate digital audio and video within well-defined timeliness requirements. Existing processor schedulers are inadequate in supporting these requirements. They fail to allow the integration of these continuous media computations with conventional interactive and batch activities. We have created a new scheduler that provides integrated processor scheduling for all classes of computational activities. Our solution achieves optimal performance when all timeliness requirements can be satisfied, and provides graceful degradation when the system is overloaded. Though unique in the degree to which it allows users control over the dynamic sharing of processing resources, the scheduler does not impose any draconian demands on the user to provide information he does not have or does not choose to specify.

read more

Citations
More filters
Journal ArticleDOI

L 2 imbo: a distributed systems platform for mobile computing

TL;DR: This paper argues that synchronous connection-oriented communications paradigms are not well suited to operation in the emerging mobile environments, and offers an alternative programming paradigm based on tuple spaces which, it is believed, offers a number of benefits within a mobile context.
Proceedings ArticleDOI

A dynamic quality of service middleware agent for mediating application resource usage

TL;DR: New developments in the design of the dynamic QoS manager (DQM) are discussed and results showing DQM performance with both real and synthetic applications are presented.
Proceedings ArticleDOI

On the Duality between Resource Reservation and Proportional Share Resource Allocation

TL;DR: A new proportional share algorithm is used, called earliest eligible virtual deadline first, that achieves optical accuracy in the rates at which process execute, that makes it possible to provide support for highly predictable, real-time services.
Proceedings ArticleDOI

A theory of rate-based execution

TL;DR: This work derives necessary and sufficient conditions for determining the feasibility of an RBE task set and demonstrates that earliest deadline first (EDF) scheduling is an optimal scheduling algorithm for both preemptive and nonpreemptive execution environments, as well as hybrid environments wherein RBE tasks access shared resources.
Journal ArticleDOI

Adaptive rate-controlled scheduling for multimedia applications

TL;DR: Experimental results are presented which show that ARC scheduling is highly effective for integrated scheduling of CM and other applications in a general purpose workstation environment.
References
More filters
Journal ArticleDOI

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

TL;DR: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.
Proceedings ArticleDOI

Processor capacity reserves: operating system support for multimedia applications

TL;DR: The authors designed a processor capacity reservation mechanism that isolates programs from the timing and execution characteristics of other programs in the same way that a memory protection system isolates them from outside memory accesses.
Journal ArticleDOI

Policy/mechanism separation in Hydra

TL;DR: This paper presents three such mechanisms (scheduling, paging, protection) and examines how external policies which manipulate them may be constructed and shows that the policy decisions which remain embedded in the kernel exist for the sole purpose of arbitrating conflicting requests for physical resources.