New models and algorithms for throughput maximization in broadcast scheduling

Authors:
Chandra Chekuri;Avigdor Gal;Sungjin Im;Samir Khuller;Jian Li;Richard McCutchen;Benjamin Moseley;Louiqa Raschid
Affiliations:
Dept. of Computer Science, Univ. of Illinois, Urbana, IL;Faculty of Industrial Engineering & Management, Technion-Israel Institute of Technology, Technion City, Haifa, Israel;Dept. of Computer Science, Univ. of Illinois, Urbana, IL;Dept. of Computer Science and UMIACS, Univ. of Maryland, College Park, MD;Dept. of Computer Science and UMIACS, Univ. of Maryland, College Park, MD;Dept. of Computer Science and UMIACS, Univ. of Maryland, College Park, MD;Dept. of Computer Science, Univ. of Illinois, Urbana, IL;Robert H. Smith School of Business and UMIACS, Univ. of Maryland, College Park, MD
Venue:
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Year:
2010

Citing 24
Cited 2

Randomized algorithms

Randomized algorithms
Randomized algorithms

ACM Computing Surveys (CSUR)
Minimizing maximum response time in scheduling broadcasts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Adaptive push-pull: disseminating dynamic web data

Proceedings of the 10th international conference on World Wide Web
Managing periodically updated data in relational databases: a stochastic modeling approach

Journal of the ACM (JACM)
Broadcast scheduling: when fairness is fine

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Minimizing Response Time in Broadcast Scheduling

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Broadcasts in Wireless Networks

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A maiden analysis of Longest Wait First

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling broadcasts with deadlines

Theoretical Computer Science - Special papers from: COCOON 2003
A Note on Scheduling Equal-Length Jobs to Maximize Throughput

Journal of Scheduling
A robust maximum completion time measure for scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved approximation algorithms for broadcast scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Dependent rounding and its applications to approximation algorithms

Journal of the ACM (JACM)
WIC: a general-purpose algorithm for monitoring web information sources

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Broadcast scheduling: algorithms and complexity

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Monitoring an Information Source Under a Politeness Constraint

INFORMS Journal on Computing
Satisfying Complex Data Needs using Pull-Based Online Monitoring of Volatile Data Sources

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
On trade-offs in event delivery systems

Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
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
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Improved on-line broadcast scheduling with deadlines

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

SIAM Journal on Computing

Brief announcement: online batch scheduling for flow objectives

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
A segmentation approach for file broadcast scheduling

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider some basic scheduling questions motivated by query processing that involve accessing resources (such as sensors) to gather data. Clients issue requests for data from resources and the data may be dynamic or changing which imposes temporal constraints on the delivery of the data. A proxy server has to compute a probing schedule for the resources since it can probe a limited number of resources at each time step. Due to overlapping client requests, multiple queries can be answered by probing the resource at a certain time. This leads to problems related to some well-studied broadcast scheduling problems. However, the specific requirements of the applications motivate some generalizations and variants of previously studied metrics for broadcast scheduling. We consider both online and offline versions of these problems and provide new algorithms and results.