Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

An efficient I/O interface for optical disks

Published: 01 June 1985 Publication History

Abstract

We introduce the notion of an I/O interface for optical digital (write-once) disks, which is quite different from earlier research. The purpose of an I/O interface is to allow existing operating systems and application programs that use magnetic disks to use optical disks instead, with minimal change. We define what it means for an I/O interface to be disk-efficient. We demonstrate a practical disk- efficient I/O interface and show that its I/O performance in many cases is optimum, up to a constant factor, among all disk-efficient interfaces. The interface is most effective for applications that are not update-intensive. An additional capability is a built-in history mechanism that provides software support for accessing previous versions of records. Even if not implemented, the I/O interface can be used as a programming tool to develop efficient special purpose applications for use with optical disks.

References

[1]
ADEL'SON-VEL'SKIi, G. M., and Landis, E.M. An algorithm for the organization of information. An English translation appears in Soviet Math. 3, 5 (July 1962), 1259-1263.
[2]
AHo, A. V., HOPCROFT, d. E., AND ULLMAN J. D. The Des~a and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
[3]
ARNOLD, R. F., HOGSETT, G. R., HOLLIDAY, R. W., AND FRIEDL, P.J. STAR, a data base system architecturepconcepts and facilities. Tech. Rep. ZZ20-6452, IBM Palo Alto Scientific Center, Feb. 1981.
[4]
BAYER, a., AND MCCREIGHT, E. Organization and maintenance of large ordered indexes. Acta In{. I, 3 (1972), 173-189.
[5]
COPELAND, G. What if mass storage were free'? Computer 15, 7 {July 1982), 27-35.
[6]
DOLEV, D., MA}ER, D., MAIRSON, H., AND ULLMAN, J. Correcting faults in a write-once memory. In Proceedings 16th Annual ACM Symposium on Theory of Computing (Washington, D.C., May 1984), ACM, New York, 225-229.
[7]
EASTON, M.C. Update method for write-once disk. IBM Tech. Disclosure Bull. (To appear)
[8]
FISCHER, M. J., AND LADNEB, R.E. Data structures for efficient implementation of sticky pointers in text editors. Tecb. Rep. 79-06-08, Univ. of Washington, June 1979.
[9]
GOLDSTEIN, C.M. Optical disk technology and information. Science 215, 4534 (Feb. 1982), 862- 868.
[10]
GUIBAS, L~ J., AND SEDGEWlCK, R. A dichromatic framework for balanced trees. In Proceedings 19th Annual IEEE Symposium on Foundations of Computer Science {Ann Arbor, Mich., Oct. 1978), IEEE, New York, 8-20.
[11]
KNUVH, D. E. The Art of Computer Programming; vol. I: Fundamental Algorithms. Addison- Wesley, Reading, Mass., 2nd ed., 1973.
[12]
KNUTH, D.E. The Art of Computer Programming; vol. III: Sorting and Searching. Addison- Wesley, Reading, Mass., 1973.
[13]
MAIER, D. Using write-once memory for database storage. In Proceedings 1st Annual ACM Symposium on Principles of Database Systems (Los Angeles, Calif., Mar. 1982), ACM, New York, 239-246.
[14]
O'LEAR, B. T., AND CHOY, J.H. Software considerations in mass storage systems. Computer 15, 7 (July 1982), 36-44.
[15]
RATHMANN, R. Dynamic data structures on optical disks. In Proceedings IEEE Computer Data Engineering Conference (Los Angeles, Calif., April 1984), IEEE, New York.
[16]
RIVEST, R. L., AND SHAMIR, A. How to reuse a "write-once" memory. In Proceedings 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif., May 1982), ACM, New York, 105-113.
[17]
SLEATOR, D. D., AND TARJAN, R.E. Self-adjusting binary search trees. J. ACM. (to appear, July 1985)
[18]
VITTER, J.S. Search mechanisms for optical disks. Internal Memo, IBM Palo Alto Scientific Center, Mar. 1983.
[19]
VITTER, J.S. Computational complexity of an optical disk interface. In Proceedings 11th Annual International Colloquium on Automata, Languages, and Programming (ICALP) (Antwerp, July 1984), 490-502.
[20]
VITTER, J.S. USER: A new framework for redoing. IEEE Softw I, 4 (Oct. 1984), 39-52.

Cited By

View all
  • (2023)On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?Mathematical Systems Theory10.1007/BF0283583325:2(141-159)Online publication date: 22-Mar-2023
  • (2020)A competitive analysis for the Start-Gap algorithm for online memory wear levelingInformation Processing Letters10.1016/j.ipl.2020.106042(106042)Online publication date: Nov-2020
  • (2018) B point -tree: An Indexing Structure for Efficient Search in Data Retrieval 2018 Fourth International Conference on Advances in Computing, Communication & Automation (ICACCA)10.1109/ICACCAF.2018.8776727(1-6)Online publication date: Oct-2018
  • Show More Cited By

Recommendations

Reviews

Clement R. Attanasio

Optical disks are logically different form conventional magnetic disks in that they can be written on exactly one time. They can be thought of as initially having all bits set to zero; each bit can be set to one, after which it is forever equal to one. Within this constraint, how can (or should) such a device be used for a traditional data storage application__?__ The attractive attribute of optical disks is their increased storage capacity (by “orders of magnitude”) per unit cost, with comparable performance. This paper claims a slightly different point of view from previous work in the use of optical disks. The author asserts that it is more reasonable to investigate the use of optical disks for environments which take advantage of their characteristics, rather than viewing them as one-for-one substitutes for magnetic disks. Hence, he asserts that optical disks should be considered for environments in which update activity is not heavy. Furthermore, they have a strong natural advantage for an application which requires that previous values of data must be kept even after update. The main body of the paper presents and analyzes algorithms which the author claims are appropriate, i.e., “disk-efficient” and “optimal” in performance, under these assumptions. The paper is quite long and perhaps longer than necessary. Some of the analysis of suboptimal algorithms could have been omitted. The author's conclusion that he has presented “a practical approach for allowing operating systems and application programs that currently use magnetic disks to use optical disks instead” seems overstated, given his original approach that optical disks are not appropriate for high-update environments (what operating system does not write temporary files__?__). Although several of the author's statements can be disputed, I feel the time needed to read this paper would be well spent.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 10, Issue 2
June 1985
159 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/3857
  • Editor:
  • Robert W. Taylor
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1985
Published in TODS Volume 10, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)46
  • Downloads (Last 6 weeks)11
Reflects downloads up to 24 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2023)On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?Mathematical Systems Theory10.1007/BF0283583325:2(141-159)Online publication date: 22-Mar-2023
  • (2020)A competitive analysis for the Start-Gap algorithm for online memory wear levelingInformation Processing Letters10.1016/j.ipl.2020.106042(106042)Online publication date: Nov-2020
  • (2018) B point -tree: An Indexing Structure for Efficient Search in Data Retrieval 2018 Fourth International Conference on Advances in Computing, Communication & Automation (ICACCA)10.1109/ICACCAF.2018.8776727(1-6)Online publication date: Oct-2018
  • (2014)Design Issues of Shingled Write Disk for DatabaseJournal of Computers10.4304/jcp.9.10.2247-22579:10Online publication date: 30-Oct-2014
  • (2010)Design issues for a shingled write disk systemProceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)10.1109/MSST.2010.5496991(1-12)Online publication date: 3-May-2010
  • (2007)Efficient Update of Indexes for Dynamically Changing Web DocumentsWorld Wide Web10.1007/s11280-006-0009-210:1(37-69)Online publication date: 1-Mar-2007
  • (2003)Dynamic maintenance of web indexes using landmarksProceedings of the 12th international conference on World Wide Web10.1145/775152.775167(102-111)Online publication date: 20-May-2003
  • (1999)Comparison of access methods for time-evolving dataACM Computing Surveys10.1145/319806.31981631:2(158-221)Online publication date: 1-Jun-1999
  • (1997)An Efficient Multiversion Access StructureIEEE Transactions on Knowledge and Data Engineering10.1109/69.5999299:3(391-409)Online publication date: 1-May-1997
  • (1992)An algorithm for storage device selection and file assignmentEuropean Journal of Operational Research10.1016/0377-2217(92)90362-D61:3(326-344)Online publication date: Sep-1992
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media