| Lena Golubchik and Raj Kumar Rajendran. A study on the use of tertiary storage in multimedia systems. In Proc. of Joint NASA/IEEE Mass Storage Systems Symposium, March 1998. |
....be used with most commercial big jukeboxes, which have multiple drives. Lau et al. 15] propose two algorithms, the round robin and the least slack algorithm, which break up the requests into time slices and try to build a schedule with the time slices of the different requests. Golubchik et al. [8] propose a periodic scheduler called Rounds. Cha et al. 4] use a jukebox scheduler based on a periodic EDF scheduler, which additionally does not deal with the robot contention problem. At first glance the least slack algorithm looks similar to the scheduler presented in this paper. However, the ....
....time for transferring data TT is: TT = access (2) Any periodic model either needs to impose restrictions on the way the robot is used or has to take into account the worst case robot contention time in the execution time of the tasks. The first approach is the one used by Golubchik et al. [8] in their algorithm Rounds and in the periodic quantum model we present here. The second approach is used by Lau et al. 15] in the time slice algorithm. The worst case robot contention time is Q, which is the time needed to perform a switch in all the other drives. Furthermore, a periodic ....
[Article contains additional citation context not shown here]
Lena Golubchik and Raj Kumar Rajendran. A study on the use of tertiary storage in multimedia systems. In Proc. of Joint NASA/IEEE Mass Storage Systems Symposium, March 1998.
....be used with most commercial big jukeboxes, which have multiple drives. Lau et al. 15] propose two algorithms, the round robin and the least slack algorithm, which break up the requests into time slices and try to build a schedule with the time slices of the different requests. Golubchik et al. [9] propose a periodic scheduler called Rounds. Cha et al. 4] use a jukebox scheduler based on a periodic EDF scheduler, which additionally does not deal with the robot contention problem. Prabhakar et al. 17] and Triantafillou et al. 19] schedule requests without realtime deadlines in order to ....
L. Golubchik and R. K. Rajendran. A study on the use of tertiary storage in multimedia systems. In Proc. of Joint NASA/IEEE Mass Storage Systems Symposium, March 1998.
....issues in video tape library environments under efficient scheduling algorithms. 3 Related work has mostly concentrated on modeling the performance characteristics of tape drive and tape library products ( 1, 9, 13, 14] on comparative studies of the use of tertiary storage for multimedia ([1, 2, 7]) on storing and elevating video blocks from tertiary for playback ( 5, 18] on caching digital library documents in secondary storage ( 15] on striping and analytical modeling of tape libraries under FCFS scheduling ( 6, 12] on algorithms for optimal data placement in tertiary libraries ....
L. Golubchik, R.K. Rajendran, "A study on the use of tertiary storage in multimedia systems", Proc. of joint IEEE/NASA Symp. on Mass Storage Systems, March 98.
....As mentioned in the introduction, disk based storage is viewed as presently too costly to store the thousands of video objects in a full fledged video server, and thus TS is employed for storage augmentation purposes. A continuous object can be played either from TS or from SS [Che94, KDST95,GR98,Che98] One may Play from TS an object by issuing upload requests to TS. The uploaded blocks of the object are placed into PS buffers, from where they are subsequently consumed: either they are transmitted over a network to a remote client, or they are displayed to a local client. However, ....
L. Golubchik and R. K. Rajendran. A Study on the Use of Tertiary Storage in Multimedia Systems. In Proceedings of the Joint NASA and IEEE Mass Storage Conference, March 1998.
....a number of scheduling algorithms for single tape accesses. Georgiadis, Faloutsos Triantafillou [3] developed and measured the performance of four scheduling schemes in a video server environment. Lau, Lui,and Wong [9] Triantafillou and Papadakis [11] Chervenak [2] Golubchik and Rajendran [4] all studied issues related to the use of tertiary storage in multimedia systems. To our knowledge, there is a lack of study regarding the issues pertinent to the efficient scheduling of requests in RSLs. In this paper we will contribute new scheduling algorithms and experimentally evaluate their ....
L. Golubchik and R. Rajendran, A study on the use of tertiary storage in multimedia systems. NASA/IEEE joint Mass Storage Systems Symposium, March 1998.
....enormous storage requirements of modern applications, such as continuous media services, digital libraries, and scientific computing systems. Hence, research on design and evaluation of configurations and resource management techniques at various levels of the storage hierarchy is gaining momentum [23, 18, 22, 29, 1, 17]. All these works illustrate two important points: 1) it is difficult to evaluate and predict performance of storage devices and (2) the required performance characteristics are often achieved at the cost of complex solutions (be they data layout, scheduling, or other algorithms) given the ....
L. Golubchik and R. K. Rajendran. A Study on the Use of Tertiary Storage in Multimedia Systems. In Proceedings of the Joint NASA and IEEE Mass Storage Conference, March 1998.
No context found.
Lena Golubchik and Raj Kumar Rajendran. A study on the use of tertiary storage in multimedia systems. In Proc. of Joint NASA/IEEE Mass Storage Systems Symposium, March 1998.
No context found.
L. Golubchik and R. K. Rajendran. A study on the use of tertiary storage in multimedia systems. In Proc. of Joint NASA/IEEE Mass Storage Systems Symposium, March 1998.
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