Introduction to algorithms
Modern operating systems
Quickly generating billion-record synthetic databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Inversive and linear congruential pseudorandom number generators in empirical tests
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A framework for scalable dissemination-based systems
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Efficient concurrency control for broadcast environments
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
SIAM Journal on Computing
Design of Dynamic Data Structures
Design of Dynamic Data Structures
The Architecture of Videotex Systems
The Architecture of Videotex Systems
Prefetching from Broadcast Disks
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Optimal memory management strategies for a mobile user in a broadcast data delivery system
IEEE Journal on Selected Areas in Communications
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Unicast connections lead to performance and scalability problems when a large client population attempts to access the same data. Broadcast push and broadcast disk technology address the problem by broadcasting data items from a server to a large number of clients. Broadcast disk performance depends mainly on caching strategies at the client site and on how the broadcast is scheduled at the server site. An on-line broadcast disk paging strategy makes caching decisions without knowing future page requests or access probabilities. This paper gives new implementations of existing on-line algorithms and reports on extensive empirical investigations. The gray algorithm [Khanna and Liberatore 2000] always outperformed other on-line strategies on both synthetic and Web traces. Moreover, caching limited the skewness of broadcast schedules, and led to favor efficient caching algorithms over refined scheduling strategies when the cache was large.