| A. Heybey, M. Sullivan, and P. England, "Calliope: A distributed, scalable multimedia server," Proc. of USENIX 1996 Annual Technical Conference, 1996. |
....of this paper is organized as follows: Section 2 describes our system model. In Section 3, we present our disk and communication scheduling algorithms. Some numerical results are presented in Section 4, and Section 5 concludes this paper. 2 System Model In many parallel distributed VOD servers[2, 5], each video stream is divided into logical blocks, which are then distributed among multiple storage nodes (referred to as datastriping) Data striping implicitly achieves higher disk bandwidth and load balancing[2] In a small scale distributed server, however, a video stream is stored and ....
.... into logical blocks, which are then distributed among multiple storage nodes (referred to as datastriping) Data striping implicitly achieves higher disk bandwidth and load balancing[2] In a small scale distributed server, however, a video stream is stored and serviced in a single storage node[5] (referred to as no striping) Although the data striping technique has the aforementioned advantages, it has the following disadvantages: First, a distributed scheduling among storage nodes is required. This imposes clock synchronization problems among all nodes in the server. Second, startup ....
A. Heybey, M. Sullivan, and P. England, "Calliope: A distributed, scalable multimedia server," Proc. of USENIX 1996 Annual Technical Conference, 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