skip to main content
10.1145/276698.276879acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free Access

On broadcast disk paging

Authors Info & Claims
Published:23 May 1998Publication History
First page image

References

  1. 1.ACltAItYA, S., ALONSO, R., FRANKLIN, M., ANO ZDONIK, $. Broadcast disks: Data management for asymmetric communication environments. In Proceed. ings o/the A CM $iGMOD Conference (1995), pp. 199- 210. Google ScholarGoogle Scholar
  2. 2.ACItAItYA, S., FRANKLIN, M., AND ZDONIK, $. Prefetching from a broadcast disk. In Proceedings of the International Conference on Data Engineering (1996). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.AOItMOPTAS, D., C~mOBAK, M., AND NOGA, J. Competitive analysis of randomized paging algorithms. In Algorithms--ESA '96 (Barcelona) (Berlin, 1996), vol. 1136 of Lecture Notes in Comput. $ci., Springer, pp. 419-430. Google ScholarGoogle Scholar
  4. 4.BELAD~, L. A. A study of replacement algorithms for a virtual storage computer. IBM Systems Journal 5, 2 (looo), 78-101. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.BORODIN, A., LiNIAL, N., AND SAKe, M. E. An optlreal online algorithm for metrical task systems. Journal of the Association for Computing Machinery 89, 4 (Oct. 1992), 745-763. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.BOWEN, T. G., GOPAL, G., HEI~AN, G., HICKEY, T., LEE, K. C., MANSFIELD, W. H., ItAITZ, J., AND WEINRIB~ A. Tile Datacycle architecture. Communications of tl~a J CM 85, 12 (Dec. 1992), 71-81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.OAO, P., FELTEN, E. W., KAnUN, A. R., aND LI, K. A study of integrated prefetching and caching strategic0. In Proceedings of the A CM International Conferante on Measurement and Modeling of Computer $ys. tama ($iGMETRIC$) (1995), pp. 188-196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.FIAT, A., KARP, It., LUBY, M., MCGEOCH, L. A., SLEATOR, D., AND YOUNG, N. Competitive paging algorithms. Journal of Algorithms 1~ (1991), 685-699. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.FRANKLIN, M., AND ZDONn~:, $. A framework for scalable dissemination-based systems. In Proceedings of the International Conference Object Oriented Programming Languaga~ Systems (1997). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Gwrolto, D. K. Polychannel systems for mass digital communications. Communications of the A CM 33, 2 (Feb, 1090), 141-151. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.IMIELINSKI, T., ANn BADRnaATH, B. Mobile wireless computing: Challenges in data management. Commu. nications of the A CM 37, 10 (Oct. 1994), 18-28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.IRxm, S., AND KARL,, A. R. Online computation. In Approzimation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed. PWS Publishing Company, Boston, 1997, ch. 13, pp. 521-564. Google ScholarGoogle Scholar
  13. 13.KARL,, A. R., MA~ASS% M. S., RUOOLPH, L., AND SLEATOR, D. D. Competitive snoopy caching. Algo. rithmica 3, 1 (1988), 79-119.Google ScholarGoogle Scholar
  14. 14.MANASSE, 1%,~. S., MCGEOCH, L. A., AND SLEATOR, D.D. Competitive algorithms for server problems. Journal of Algorithms 11 (1990), 208-230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.MCGEOCH, L. A., AND SLEATOR, D. D. A strongly competitive randomized paging algorithm. Algorith. mica 6 (1991), 816-825.Google ScholarGoogle Scholar
  16. 16.SIGEL, E. Videotezt: The Coming Revolution in Home/Office Information Retrieval. Knowledge Industry Publications, White Plains, 1980.Google ScholarGoogle Scholar
  17. 17.$LEATOR, D. D., ANn TARJ~, It. E. Amortized efticiency of l i st update and paging rules. Communications of the A CM ~S (1985), 202-208. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On broadcast disk paging

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing
          May 1998
          684 pages
          ISBN:0897919629
          DOI:10.1145/276698

          Copyright © 1998 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 May 1998

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          STOC '98 Paper Acceptance Rate75of169submissions,44%Overall Acceptance Rate1,469of4,586submissions,32%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader