H. Tezuka and T. Nakajima. Simple continuous media storage server on real-time mach. In USENIX Annual Technical Conf., San Diego, CA, USA, January 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....using a static task set. Also, only simulation studies were carried out. In contrast, we use dynamic priority scheduling, exploit blocking instead of minimizing it and evaluate an implementation within our resource framework. A multimedia storage server design and implementation is reported in [15]. In this scheme, the disk request queue is divided into two different queues, one for real time threads and another for non real time threads. Both queues were scheduled following C Scan with the real time queue taking precedence over the non real time queue. The scheme is called a constant rate ....

H. Tezuka and T. Nakajima. Simple Continuous Media Storage Server on Real-Time Mach. The USENIX 1996 Annual Technical Conference, San Diego, January, 1996.

....before it is requested if the system determines that the accesses are sequential. In [Ng et al. 94] the utilization of buffers and disk is optimized by prefetching all the shortest database queries maximizing the number of processes that can be activated once the running process is finished. In [Tezuka et al. 96] assuming a linear playout of the continuous data stream, the data needed in the next period (determined by a tradeoff between the maximum concurrent streams and the initial delay) is prefetched into a shared buffer. Preloading data according to the loading and consuming rate and the available ....

Tezuka, H., Nakajima, T.: Simple Continuous Media Storage Server on Real-Time Mach, Proc. of 1996 USENIX Annual Technical Conf., San Diego, CA, USA, January 1996

....can call functions provides by the stream manager, and utilizes the event system described in the previous section. In this section, we show a sample program that uses the scripting language. The sample program contains two streams that fetch media elements from our continuous media storage system[21]. The sample program defines a video stream and an audio stream, and the streams are grouped into a composite stream. In the example, there are two composite modules, Control and QtPlay. The line 1 is the definition of the composite module Control. Control contains a code for user interface. The ....

H. Tezuka, and T. Nakajima "Simple Continuous Media Storage Server on Real-Time Mach", In Proceedings of USENIX Technical Conference, 1996.

....pages in physical memory under the round robin policy, and all periodic threads wires touched pages under the rate monotonic scheduling policy. Also, threads with real time priorities are real time threads, and other threads are non real time threads under the fixed priority timeshare scheduling[16]. Since the kernel changes a memory wiring strategy according to the scheduling policies, the same program can be used under different scheduling policies without modifying programs. The third primitive is memory exceed wait( The primitive waits for a notification message to a port specified as ....

....are implemented on Real Time Mach, and we described the effectiveness of our approach. However, complete continuous media applications may require other resource reservation mechanisms such as a device reservation and a network reservation. In our project, we have been working on these mechanisms[10, 16], but the current mechanisms are not suitable for the adaptive QOS mapping scheme. We need to investigate on these reservation mechanisms that can be used in the adaptive QOS mapping scheme. reserved resident wired size (MB) time (sec) 0.00 0.10 0.20 0.30 0.40 0.50 0.60 0.70 0.80 0.90 1.00 1.10 ....

H. Tezuka, and T. Nakajima "Simple Continuous Media Storage Server on Real-Time Mach", In Proceedings of USENIX Technical Conference, 1996.

....pages in physical memory under the round robin policy, and all periodic threads wires touched pages under the rate monotonic scheduling policy. Also, threads with real time priorities are real time threads, and other threads are non real time threads under the fixed priority timeshare scheduling[18]. Since the kernel changes a memory wiring strategy according to the scheduling policies, the same program can be used under different scheduling policies without modifying programs. The third primitive is memory exceed wait( The primitive waits for a notification message to a port specified as ....

....Audio Play Video Fetch Video Decode Video Display Initialize GUI To X server To Audio server From CRAS From CRAS Figure 6: Movie Player Figure 6 shows the structure of QtPlay movie player. QtPlay retrieves video frames and audio samples from a QuickTime file stored in Unix file system using CRAS[18] which is a continuous media storage server on Real Time Mach. Threads in QtPlay are classified into three categories. A thread belonging in the first category executes an initialization code and enters in an event loop for processing input events such as mouse and keyboard input events from X ....

H.Tezuka, and T.Nakajima, "Simple Continuous Media Storage Server on Real-Time Mach", In Proceedings of the USENIX 1996 Technical Conference, USENIX, 1996.

No context found.

H. Tezuka and T. Nakajima. Simple continuous media storage server on real-time mach. In USENIX Annual Technical Conf., San Diego, CA, USA, January 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