Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Flow and stretch metrics for scheduling continuous job streams
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
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: when fairness is fine
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Prefetching from Broadcast Disks
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Algorithms for Minimizing Response Time in Broadcast Scheduling
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scalable dissemination: what's hot and what's not
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hybrid dissemination based scalable and adaptive context delivery for ubiquitous computing
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
The first main goal of this paper is to present Sketch-it!, a framework aiming to facilitate development and experimental evaluation of new scheduling algorithms. It comprises many helpful datastructures, a graphical interface with several components and a library with implementations of selected scheduling algorithms. Every scheduling problem covered by the classification-scheme originally proposed by Graham et al. [22] can easily be integrated into the framework. One of the more recent enhancements of this scheme, the so called broadcast scheduling problem, was chosen for an extensive case study of Sketchit!, yielding very interesting experimental results that represent the second main contribution of this paper. In broadcast scheduling many clients listen to a high bandwidth channel on which a server can transmit documents of a given set. Over time the clients request certain documents. In the pull-based setting each client has access to a slow bandwidth channel whereon it notifies the server about its requests. In the push-based setting no such channel exists. Instead it is assumed that requests for certain documents arrive randomly with probabilities known to the server. The goal in both settings is to generate broadcast schedules for these documents which minimize the average time a client has to wait until a request is answered. We conduct experiments with several algorithms on generated data. We distinguish scenarios for which a slow feedback channel is very advantageous, and others where its benefits are negligible, answering the question posed in the title.