E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a particular sub stream. Hence, a key challenge is to design a placement scheme that allows each sub stream to be independently accessed, without imposing significant seek and rotational latency overheads. Most existing placement schemes have been developed for single resolution video streams [2, 16]; placement schemes that support efficient playback of multi resolution video streams have not been adequately investigated. Several techniques for supporting interactive operations such as fast forward and rewind (collectively referred to as scan) have been proposed in the literature. For ....

....number of frames, then media blocks will have variable sizes. Thus, depending on the type of media blocks used by the server, a request for a fixed number of frames in each round will require the server to access a fixed number of variable size blocks or a variable number of fixed size blocks [2, 14, 19]. If the server employs variable size blocks for storing video streams, then it can minimize the seek and rotational latency incurred while servicing requests by: 1) storing all the frames of a sub stream accessed during a round in the same media block, and (2) storing blocks of different ....

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

....of frames (and hence data for a fixed playback duration) then the stripe units will have variable sizes. Thus, depending on the striping policy, retrieving a fixed number of frames will require the server to access a fixed number of variable size blocks or a variable number of fixed size blocks [4, 26, 45]. Due to the periodic nature of video playback, most video servers service clients by proceeding in terms of periodic rounds. During each round, the server retrieves a fixed number of video frames (or images) for each client. To ensure continuous playback, the number of frames accessed for each ....

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

....be implemented. Admission control Currently, the playback server supports static admission control for every storage unit in the server. However, sophisticated admission control algorithms that use apriori knowledge of the statistics of multimedia documents have been proposed in the literature [30, 31, 32, 120]. In our server, when the multimedia documents are created the recording process compiles statistics information. The AdmissionManager object in the playback server can use the statistics information and the knowledge of the system resources usage to implement sophisticated, aggressive admission ....

....node keeps track of usage of local resources such as storage and interconnect bandwidth and performs local admission control. The resource reservation and admission algorithms used to accomplish this will be similar to the ones proposed in the context of the ATM networks and the end systems [50, 110, 31, 32, 120]. ffl Scheduling support: Each node completely manages real time scheduling of local data read and write functions for each active stream. In addition, the storage node participates in a distributed scheduling scheme that allows unsynchronized storage nodes to correctly stream a striped ....

[Article contains additional citation context not shown here]

Chang, Ed, and Zakhor, A., "Scalable Video Placement on Parallel Disk Arrays," Image and Video Databases II, IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

....and (2) no additional overhead (i.e. seek and rotational latency) is incurred while accessing these components during normal playback. A multimedia server may employ a fixed size block placement policy, or a variable size block placement policy to store compressed video streams on a disk array [15, 2, 9]. In the fixed size block placement policy, each media block consists of a fixed number of storage units (i.e. bytes) Since, each media stream stored on the array is compressed using a variable bit rate (VBR) compression algorithm, each block contains variable number of frames. On the other ....

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994. 14

....a particular sub stream. Hence, a key challenge is to design a placement scheme that allows each sub stream to be independently accessed, without imposing significant seek and rotational latency overheads. Most existing placement schemes have been developed for single resolution video streams [2, 16]; placement schemes that support efficient playback of multiresolution video streams have not been adequately investigated. Several techniques for supporting interactive operations such as fast forward and rewind (collectively referred to as scan) have been proposed in the literature. For ....

....number of frames, then media blocks will have variable sizes. Thus, depending on the type of media blocks used by the server, a request for a fixed number of frames in each round will require the server to access a fixed number of variable size blocks or a variable number of fixed size blocks [2, 14, 19]. If the server employs variable size blocks for storing video streams, then it can minimize the seek and rotational latency incurred while servicing requests by (1) storing all the frames of a sub stream accessed during a round in the same media block, and (2) storing blocks of different ....

Chang E, Zakhor A (1994) Scalable Video Placement on Parallel Disk Arrays. In: Niblack W, Jain RC (eds) Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, February 1994, San Jose, Calif., pp 208--221

....[1, 14, 22, 29, 30] Symphony builds upon these techniques and integrates them into a general purpose file system. For instance, the interval caching policy employed by the video module was proposed in [7] The efficacy of using variable size blocks for storing video files has been demonstrated in [5, 4, 14]. Techniques for approximate reconstruction of image and video data (e.g. JPEG and MPEG) have been discussed in [8, 33] Admission control algorithms have been discussed in [5, 22, 32] Several recent and ongoing research efforts have focussed on building integrated file systems. For instance, ....

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

....the issues of storage scalability, providing resource expandability mechanisms and devising efficient load balancing strategies. The emergence of new compression techniques, which reduce the storage and bandwidth requirements of CM streams, has enabled new research into CM storage to take place [Chiueh93, Keeton93, Chang94, Paek95]. This work concentrates on developing strategies for the optimised placement of compressed data on standalone storage instances, and although some solutions have potential scalable extensions [Chang94, Paek95] they are scalability limited due to the bottlenecks that occur at their network ....

.... CM streams, has enabled new research into CM storage to take place [Chiueh93, Keeton93, Chang94, Paek95] This work concentrates on developing strategies for the optimised placement of compressed data on standalone storage instances, and although some solutions have potential scalable extensions [Chang94, Paek95], they are scalability limited due to the bottlenecks that occur at their network interfaces. In this paper we describe a scalable storage architecture, based on replicated high performance storage instances, for the storage of CM information. The overheads associated with migration replication ....

[Article contains additional citation context not shown here]

Chang E, Zakhor A, "Scalable Video Placement on Parallel Disk Arrays", Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 1994, Vol. 2185, pp. 208-221

....number of frames, then media blocks will have variable sizes. Thus, depending on the type of media blocks used by the server, a request for a fixed number of frames in each round will require the server to access a fixed number of variable size blocks or a variable number of fixed size blocks [2, 13, 18]. If the server employs variable size blocks for storing video streams, then it can minimize the seek and rotational latency incurred while servicing requests by: 1) storing all the frames of a sub stream accessed during a round in the same media block, and (2) storing blocks of different ....

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

....are of the same size and thus, have a constant time length in terms of playout duration. In case of a Variable Bit Rate (vbr) video, a chunk therefore represents a Constant Time Length (ctl) but a variable data length unit. In case of a Constant Bit Rate (cbr) source, it also has constant size [8, 9, 20]. Different documents may have different chunk sizes, ranging from k = 1 to k = Fmax , where Fmax is the maximum number of frames in a multimedia document. In case of mpeg compressed streams, the group of pictures (gop) is one possible choice of chunk size. A chunk is always confined to one ....

....resolution video. Similarly, Zakhor et al. report design of schemes for placing scalable sub band encoded video data on a disk array. They focus only on the path from the disk devices to the memory and evaluate using simulation, layouts that use cdl and ctl units mentioned earlier in Section 2 [8, 9]. However, none of these papers address issues in the implementation of interactive operations. Chen et al. report data placement and retrieval schemes for an efficient implementation of ff and rw operations in a disk array based video server [11] Our work is completely independent and ....

Chang, Ed, and Zakhor, A., "Scalable Video Placement on Parallel Disk Arrays," Image and Video Databases II, IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, Feb. 1994.

....a particular sub stream. Hence, a key challenge is to design a placement scheme that allows each sub stream to be independently accessed, without imposing significant seek and rotational latency overheads. Most existing placement schemes have been developed for single resolution video streams [2, 16]; placement schemes that support efficient playback of multi resolution video streams have not been adequately investigated. Several techniques for supporting interactive operations such as fast forward and rewind (collectively referred to as scan) have been proposed in the literature. For ....

....number of frames, then media blocks will have variable sizes. Thus, depending on the type of media blocks used by the server, a request for a fixed number of frames in each round will require the server to access a fixed number of variable size blocks or a variable number of fixed size blocks [2, 14, 19]. If the server employs variable size blocks for storing video streams, then it can minimize the seek and rotational latency incurred while servicing requests by: 1) storing all the frames of a sub stream accessed during a round in the same media block, and (2) storing blocks of different ....

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

....size and thus, have a constant time length in terms of playout duration. In case of a Variable Bit Rate (vbr) video such as mpeg video, a chunk therefore represents a Constant Time Length (ctl) but a variable data length unit. In case of a Constant Bit Rate (cbr) source, it also has constant size [10, 13]. Different documents may have different chunk sizes, ranging from k = 1 to k = Fmax , where Fmax is the maximum number of frames in a multimedia document. In case of mpeg compressed streams, the group of pictures (gop) is one possible choice of chunk size. A chunk is always confined to one ....

Chang, Ed, and Zakhor, A., "Scalable Video Placement on Parallel Disk Arrays," Image and Video Databases II, IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, Feb. 1994.

No context found.

E. Chang and A. Zakhor. Scalable Video Placement on Parallel Disk Arrays. In Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

No context found.

E. Chang and A. Zakhor, "Scalable video placement on parallel disk arrays," in Proceedings of IS&T/SPIE International Symposium on Electronic Imaging: Science and Technology, San Jose, February 1994.

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