Broadcast Disks: Data Management for Asymmetric Communication Environments

  • Swarup Acharya
  • Rafael Alonso
  • Michael Franklin
  • Stanley Zdonik
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 353)


This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called “Broadcast Disks” for structuring the broadcast in a way that provides improved performance for non-uniformly accessed data. The Broadcast Disk superimposes multiple disks spinning at different speeds on a single broadcast channel — in effect creating an arbitrarily fine-grained memory hierarchy. In addition to proposing and defining the mechanism, a main result of this work is that exploiting the potential of the broadcast structure requires a re-evaluation of basic cache management policies. We examine several “pure” cache management policies and develop and measure implementable approximations to these policies. These results and others are presented in a set of simulation studies that substantiates the basic idea and develops some of the intuitions required to design a particular broad cast program.


Memory Hierarchy Access Probability Flat Disk Cache Management Broadcast Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Acha94]
    S. Acharya, R. Alonso, M. Franklin, S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communications Environments”, Tech. Report CS-94-43, Brown Univ.; Tech. Report CS-TR-3369, Univ. of Maryland, Oct. 1994.Google Scholar
  2. [Akyu92]
    S. Akyurek, K. Salem, “Placing Replicated Data to Reduce Seek Delays” Proc. USENIX File System Conf., May 1992.Google Scholar
  3. [Anto93]
    C. Antonelli, P. Honeyman, “Integrating Mass Storage and File Systems”, Proc. 12th IEEE Symp on Mass Storage Sys., 1993.Google Scholar
  4. [Barb94]
    D. Barbara, T. Imielinski, “Sleepers and Workaholics: Caching Strategies in Mobile Environments”, Proc. ACM SIGMOD Conf., May, 1993.Google Scholar
  5. [Bowe92]
    T. Bowen, et al. “The Datacycle Architecture” CACM 35,(12), Dec, 1992.Google Scholar
  6. [Dan90]
    A. Dan, D. M. Dias, P. Yu, “The Effect of Skewed Access on Buffer Hits and Data Contention in a Data Sharing Environment”, Proc. 16th VLDB Conf., Aug., 1990.Google Scholar
  7. [Fran92]
    M. Franklin, M. Carey, M. Livny, “Global Memory Management in Client-Server DBMS Architectures”, Proc. 18th VLDB Conf., Aug., 1992.Google Scholar
  8. [Giff90]
    D. Gifford, “Polychannel Systems for Mass Digital Communications”, CA CM, 33(2), Feb., 1990.Google Scholar
  9. [Gray94]
    J. Gray, et al., “Quickly Generating Billion-Record Synthetic Databases”, Proc. ACM SIGMOD Conf., May, 1994.Google Scholar
  10. [Herm87]
    G. Herman, G. Gopal, K. Lee, A. Weinrib, “The Datacycle Architecture for Very High Throughput Database Systems”, Proc. ACM SIGMOD Conf., May, 1987.Google Scholar
  11. [Imie94a]
    T. Imielinski, B. Badrinath, “Mobile Wireless Computing: Challenges in Data Management”, CACM, 37(10), Oct., 1994.Google Scholar
  12. [Imie94b]
    T. Imielinski, S. Viswanathan, B. Badrinath, “Energy Efficient Indexing on Air” Proc. ACM SIGMOD Conf., May, 1994.Google Scholar
  13. [John94]
    T. Johnson, D. Shasha, “2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm”, Proc. 20th VLDB Conf., Sept., 1994.Google Scholar
  14. [Katz94]
    R. Katz, “Adaption and Mobility in Wireless Information Systems”, IEEE Personal Comm., 1st Quarter, 1994.Google Scholar
  15. [Knut81]
    D. Knuth, “The Art of Computer Programming, Vol II”, Addison Wesley, 1981.Google Scholar
  16. [Kotz94]
    D. Kotz, “Disk-directed I/O for MIMD Multiprocessors”, 1st Symposium on OS Design and Implementation, USENIX, Nov., 1994.Google Scholar
  17. [ONei93]
    E. J. O’Neil, P. E. O’Neil, G. Weikum, “The LRU-k Page Replacement Algorithm for Database Disk Buffering”, Proc. ACM SIGMOD Conf., May, 1993.Google Scholar
  18. [Schw86]
    H. D. Schwetman, “CSIM: A C-based process oriented simulation language”, Proc. 1986 Winter Simulation Conf., 1986.Google Scholar
  19. [Vish94]
    S. Vishwanath, T. Imielinski, “Pyramid Broadcasting for Video on Demand Service”, Rutgers Univ. Tech. Report DCS TR-311, 1994.Google Scholar
  20. [Zdon94]
    S. Zdonik, M. Franklin, R. Alonso, S. Acharya, “Are ‘Disks in the Air’ Just Pie in the Sky?”, IEEE Wkshp on Mobile Comp. Sys. and Applications, Santa Cruz, CA, Dec, 1994.Google Scholar

Copyright information

© the Association for Computing Machinery, Inc. 1995

Authors and Affiliations

  • Swarup Acharya
    • 1
  • Rafael Alonso
    • 2
  • Michael Franklin
    • 3
  • Stanley Zdonik
    • 1
  1. 1.Department of Computer ScienceBrown University ProvidenceRhode Island
  2. 2.Matsushita Information Technology LaboratoryPrinceton
  3. 3.Department of Computer ScienceUniversity of MarylandCollege ParkUSA

Personalised recommendations