I/O issues in a multimedia system

Reddy, A. L. Narasimha; Wyllie, Jim

doi:10.1109/2.268888

Cited by 218 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A long time window smooths out load fluctuations but may overlap with several streams being started and stopped, while a short measurement interval may over or underestimate the current load. Deterministic admission control [13,11,10,4] aims to provide guaranteed service, however it must assume the worst case for some of the system parameters and hence often under-utilizes available resources.…”

Section: Related Workmentioning

confidence: 99%

Comprehensive statistical admission control for streaming media servers

Zimmermann

2003

Proceedings of the Eleventh ACM International Conference on Multimedia

View full text Add to dashboard Cite

Streaming media servers and digital continuous media recorders require the scheduling of I/O requests to disk drives in real time. There are two accepted paradigms to achieve this: deterministic or statistical. The deterministic approach must assume larger bounds on such disk parameters as the seek time, the rotational latency and the transfer rate, to guarantee the timely service of I/O requests. The statistical approach generally allows higher utilization of resources, in exchange for a residual probability of missed I/O request deadlines. We propose a novel statistical admission control algorithm called TRAC based on a comprehensive three random variable (3RV) model to support both reading and writing of multiple variable bit rate media streams on current generation disk drives. Its major distinctions from previous work include (1) a very realistic disk model which considers multi-zoning of disks, seek and rotational latency profiles, and unequal reading and writing data rate limits, (2) a dynamic bandwidth sharing mechanism between reading and writing, and (3) support for random placement of data blocks. We evaluate the TRAC algorithm through an extensive numerical analysis and real device measurements. The results show that it achieves a much more realistic resource utilization (up to 38% higher) as compared with the best, previously proposed algorithm based on a single random variable (1RV) model. Most impressive, in all the experiments the difference between the results generated by TRAC and the actual disk device measurements match closely.

show abstract

Section: Related Workmentioning

confidence: 99%

Comprehensive statistical admission control for streaming media servers

Zimmermann

2003

Proceedings of the Eleventh ACM International Conference on Multimedia

View full text Add to dashboard Cite

show abstract

“…Ts E(Wp(total)+Wa(total)+Wa-new+Wth* 2) (7) When condition (7) request is reserved temporarily, until the value of Wa(tota1) becomes small enough to satisfy condition (7). If the acyclic disk access Wa-new is operated without satisfying condition (7), the periodic disk accesses will not meet deadlines and corresponding streams will be broken.…”

Section: (3)mentioning

confidence: 98%

“…It is necessary to decrease the cost of storing video files and delivering video streams with the proposed VOD systems [7]- [9]. Scalability is also needed so that many streams can be accessed simultaneously, a large number of video files can be stored, and VOD systems can be adapted to suit anything from a small office to a large scale CATV system.…”

Section: Introductionmentioning

confidence: 99%

“…If the I/O bus has enough throughput, a video pump using the MPEGIsystem on AALS will be able to deliver about 150 streams when using the 130 MIPS-CPU because 65 percent of the CPU power is still available.When we design a video pump with the 130 MIPS-CPU for I50 MPEG1 stream deliveries, (that is, about 230 Mbps throughput), a disk subsystem of about 230 Mbps should be used. If we improve the expected response time of trick plays and new playbacks, the throughput of a disk subsystem should be higher than 230 Mbps so it can easily satisfy condition(7). Condition (7) takes into account the fact that the remaining disk occupation time should be reserved for the type (2) acyclic disk accesses (as explained in Sec.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Essential factors for full-interactive VOD server: video file system, disk scheduling, network

Asai

Shibata

Igawa

et al.

Proceedings of GLOBECOM '95

View full text Add to dashboard Cite

There are manyproblems to be solved for realizing full-interactive on-demand service. It is essential to increase the number of simultaneously accessible streams, achieve time control of the delivering streams, and be able to deliver requested titles and serve trick plays with a quick response. A method to solve each of these problems is proposed, in terms of the video file system, disk scheduling, and the network. A prototypical VOD system is constructed, which includes an interactive network-interface, application protocols and title management. It is confirmed that these proposals are feasible.

show abstract

“…Since in multi-media processing the performance of I/O operations is quite important, we have designed the I/O network of KUMP/D, considering the characteristics of its I/O operations, to achieve high speed I/O operations[2]. The characteristics of the I/O op-erations considered are as follows: Almost all the I/O data transfers, such as disk I/O, video scan line data transfers, image data transfers of rectangular windows, etc., are block data transfers.…”

mentioning

confidence: 99%

KUMP/D: the Kyushu University multi-media processor

Tomiyasu

Kawano

Taniguchi

et al.

Proceedings of Conference on Computer Architectures for Machine Perception

View full text Add to dashboard Cite

High speed image and video processing is a key technology in multi-media applications, and, therefore, currently many hardware accelerators to speed up such processing are developed and used. However, for the next generation advanced multi-media applications in the next generation, such as high quality virtual reality, bidirectional visual interface, etc., the hardware accelerators can not deal with tasks involved in these applications. This is because these tasks consist of complex and irregular computation structures, and, therefore, it is not easy to implement simple hardware accelerators for these tasks. Considering the above situation, for the next generation multi-media applications, we have been developing a MIMD based multi-media processor, KUMP/D(Kyushu University Multi-media Processor on Datarol-II). KUMP/D is a exible parallel processor, based on ne grain parallel processing, which is which indispensable in complex and irregular computation, and is also equipped with a specialized I/O network. This I/O network has enough throughput for real time video I/O, providing a mechanism, which supports the synchronization of process executions and real time video frames.

show abstract

I/O issues in a multimedia system

Cited by 218 publications

References 6 publications

Comprehensive statistical admission control for streaming media servers

Comprehensive statistical admission control for streaming media servers

Essential factors for full-interactive VOD server: video file system, disk scheduling, network

KUMP/D: the Kyushu University multi-media processor

Contact Info

Product

Resources

About