Prabhakar, S., Agrawal, D., Abbadi, A. E., and Singh, A. Scheduling tertiary I/O in database applications. In Proceedings of the 8th International Workshop on Database and Expert Systems Applications, DEXA 97 (Toulouse, France, Sept. 1997).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....data (and even more on synthetic data) which is a significant gain over the total time these operations take. Remark 1. The question of managing tape resident data as a tertiary memory database and supporting various relational query operations such as joins, has been addressed before (e.g. [23, 21, 22, 26]) in particular, EOSDIS has been studied intensely within the Database Community (e.g. Paradise project [26] and alternative EOS database architecture [3] Here we focus on the limited task of efficiently scheduling a batch of taperesident jobs, but this is nevertheless very common in ....

Prabhakar, S., Agrawal, D., Abbadi, A. E., and Singh, A. Scheduling tertiary I/O in database applications. In Proceedings of the 8th International Workshop on Database and Expert Systems Applications, DEXA 97 (Toulouse, France, Sept. 1997).

....of finding the relevant data when a cartridge is mounted in a tape drive, or improve the efficiency of data transfer to from the tape. While improvements of the data transfer rate are entirely in the hands of the manufacturers, and a lot of work have been done on efficient use of tape libraries [9, 10], little has been done to optimize the access of multimedia data stored on a single tape. For applications which have a non sequential access pattern, it is of great importance to minimize the random access delay to the multimedia data stored on tape and thereby maximize the utilization of the ....

S. Prabhakar, D. Agrawal, A. E. Abbadi, and A. Singh. Scheduling tertiary I/O in database applications. In Proceedings of Eight International Workshop on Database and Expert Systems Applications, pages 722--727, September 1997.

....scheduling of random I O requests. The strength of their work lies in the very accurate model of seek times, but unfortunately, the time necessary to characterize each tape is so long (twelve hours of processing) that it significantly reduces the practical value of their work. Prabhakar et al. [7] have studied the problem of scheduling I O requests for robotic libraries with tape drives, but made no efforts to schedule the processing of requests for a given tape. Sarawagi [11] has studied query processing in tertiary memory databases. She proposed to use average seek cost to model the ....

S. Prabhakar, D. Agrawal, A. E. Abbadi, and A. Singh. Scheduling tertiary I/O in database applications. In Proceedings of Eight International Workshop on Database and Expert Systems Applications, pages 722--727, Toulouse. France, September 1997.

....for scheduling of random I O requests. The strength of their work lies in the very accurate model of seek times, but unfortunately the time necessary to characterize each tape is so long (twelve hours of processing) that it significantly reduces the practical value of their work. Prabhakar et al. [6] have studied the problem of scheduling I O requests for robotic libraries with tape drives but make no efforts to schedule the processing of requests for a given tape. Sarawagi [12] has studied query processing in tertiary memory databases. She proposes to use average seek cost to model the ....

S. Prabhakar, D. Agrawal, A. E. Abbadi, and A. Singh. Scheduling tertiary I/O in database applications. In Proceedings of Eight International Workshop on Database and Expert Systems Applications, pages 722--727, Toulouse. France, September 1997.

....tapes and optical disks, the two leading tertiary storage technologies today, differ significantly in their access characteristics (one is sequential and the other is random access) our study is general enough to be applicable to both. Preliminary results were presented in an earlier workshop [PAES97] The rest of this paper is organized as follows. Section 2 describes the problem and discusses related work. Section 3 addresses the problem of minimum switching scheduling on a single drive. The more general problem of scheduling with minimum switching on multiple drives is shown to be ....

S. Prabhakar, D. Agrawal, A. El Abbadi, and A. Singh. Scheduling tertiary I/O in database applications. In Eighth International Workshop on Database and Expert Systems Applications, pages 722--727, Toulouse, France, September 1997. IEEE Computer Society.

.... Golubchik and Muntz [GM95] Other studies have looked at the problem of reorganization of data that is stored on tertiary media in order to improve retrieval performance [CDK 95, SS94] In contrast to other studies, we have explored the problem of scheduling requests for more than one medium [PAES97b] Due to the great difference in speeds between the processors and tertiary storage, we expect that request traffic will be bursty. Consequently, we have studied the problem of scheduling bursty I O requests. Unlike other solutions which are applicable only to removable disk technology or only to ....

S. Prabhakar, D. Agrawal, A. El Abbadi, and A. Singh. Scheduling tertiary I/O in database applications. In 8th International Workshop on Database and Expert Systems Applications, pages 722--727, Toulouse, France, September 1997. IEEE Computer Society.

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