Hiroyuki Kaneko, John A. Stankovic, A multimedia Server on the Spring Real-time System , Compter Science Technical Report TR-96-11, University of Massachusetts, January 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....deadline first scheduling algorithms for multimedia research systems and test beds. The drawback of rate monotonic algorithm is that it only deals with periodic tasks and could not schedule dynamically. When system is overloaded, earliest deadline first scheduling becomes non deterministic. Paper [2] proposes a mechanism to provide the multimedia applications and traditional hard real time applications using Spring system [3] CPU scheduling and IPC mechanisms for operating systems for continuous media applications are investigated in [4] Unfortunately, these real time scheduling algorithms ....

....for multimedia tasks. Our algorithm will employ the primary backup approach that allows two copies of a multimedia task to be scheduled on two different processors in multiprocessor system. The primary copy of the multimedia task will be scheduled into a multimedia server that has been studied in [2]. The remainder of the paper is organized as follows. In section 2 we describe the system assumptions, and the system model is given in session 3 formally. In section 4, the scheduling algorithm is proposed. In section 5, we conclude the paper with a discussion of possible extension. II. SYSTEM ....

[Article contains additional citation context not shown here]

Hiroyuki Kaneko, John A. Stankovic, A multimedia Server on the Spring Real-time System , Compter Science Technical Report TR-96-11, University of Massachusetts, January 1996.

....RM (CPU Utilization 0.88) by studying the average case and the harmonic characteristics of tasks. However, these algorithms do not allow for the possibility of variable execution and are unable to cope with overload conditions effectively. As a result, many besteffort scheduling heuristics [17][18] have been proposed in an attempt to cope with overload conditions. A related school of thought is the study of imprecise computation technique [19] 20] A task is divided into two parts, a mandatory sub task which must be executed and an optional sub task which serves to refine and improve the ....

H. Kaneko and J. Stankovic, "A Multimedia Server on the Spring Real-time System," Technical Report Umass CS 96-11, Department of Computer Science, University of Massachusetts, Amherst, 1996.

....disk scheduling algorithm that attempts to meet timing deadlines while trying to keep system throughput. The Spring system [26] developed at the University of Massachusetts at Amherst was originally targeted mainly for hard real time applications. Later, it was modi ed for multimedia applications [15]. Application processes are scheduled by the Spring scheduler in a system processor and executed on application processors. The Spring systems deals mainly on the processing of data rather than the retrieval of data from secondary storage devices. 6.2.2 Distributed File Systems for Non Real Time ....

H. Kaneko and J. A. Stankovic. Multimedia Server on the Spring Real-Time System. Technical Report 96-11, University of Massachussets, 1996.

No context found.

H. Kaneko and J. A. Stankovic, "A Multimedia Server on the Spring Real-Time System," Tech. Report 96-11, UMass Computer Science Department, 1996.

No context found.

H. Kaneko and J. Stankovic. A multimedia server on the spring real-time system. Technical Report UMass CS 96-11, Department of Computer Science, University of Massachusetts, Amherst, 1996.

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