## Preprint: FlexSched : a Flexible Data Schedule Generator for Multi-Channel Broadcast Systems

No Thumbnail Available
2005
Seifert, André
Hung, Jen-Jou
##### Series
Konstanzer Schriften in Mathematik und Informatik ; 211
Preprint
##### Abstract
This paper is concerned with the issue of building efficient and flexible data broadcast programs for a multiple physical channel environment. The goal of our work has been twofold: (a) to minimize the cost of building the broadcast program and (b) to minimize the average access latency for data requests of mobile clients. To achieve both goals, a highly flexible scheduler, called FlexSched, is proposed, taking a divide-and-conquer approach to solve the data scheduling problem. To determine the optimal allocation of the data to the existing physical channels, FlexSched initially makes a single scan over the vector of access probabilities of the data items and assigns them to the broadcast channels based on the square-root formula of optimal bandwidth usage, i.e., data items are mapped to channels in proportion to the square-root of their access probabilities. For each physical channel a skewed broadcast schedule is then produced by first assigning each data item to its own data group and then iteratively merging neighboring data groups so that the overall average access time of the initial schedule is continuously reduced. The merging procedure terminates if there are no more neighboring data groups in the program whose merging would further decrease the overall average access latency. An extensive performance study confirms the effectiveness and efficiency of FlexSched.
##### Subject (DDC)
004 Computer Science
##### Cite This
ISO 690SEIFERT, André, Jen-Jou HUNG, 2005. FlexSched : a Flexible Data Schedule Generator for Multi-Channel Broadcast Systems
BibTex
@unpublished{Seifert2005FlexS-6196,
year={2005},
title={FlexSched : a Flexible Data Schedule Generator for Multi-Channel Broadcast Systems},
author={Seifert, André and Hung, Jen-Jou}
}

RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<dc:contributor>Seifert, André</dc:contributor>
<dc:language>eng</dc:language>
<dc:format>application/pdf</dc:format>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:06Z</dc:date>
<dc:rights>terms-of-use</dc:rights>
<dcterms:issued>2005</dcterms:issued>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6196/1/preprint_211.pdf"/>
<dcterms:abstract xml:lang="eng">This paper is concerned with the issue of building efficient and flexible data broadcast programs for a multiple physical channel environment. The goal of our work has been twofold: (a) to minimize the cost of building the broadcast program and (b) to minimize the average access latency for data requests of mobile clients. To achieve both goals, a highly flexible scheduler, called FlexSched, is proposed, taking a divide-and-conquer approach to solve the data scheduling problem. To determine the optimal allocation of the data to the existing physical channels, FlexSched initially makes a single scan over the vector of access probabilities of the data items and assigns them to the broadcast channels based on the square-root formula of optimal bandwidth usage, i.e., data items are mapped to channels in proportion to the square-root of their access probabilities. For each physical channel a skewed broadcast schedule is then produced by first assigning each data item to its own data group and then iteratively merging neighboring data groups so that the overall average access time of the initial schedule is continuously reduced. The merging procedure terminates if there are no more neighboring data groups in the program whose merging would further decrease the overall average access latency. An extensive performance study confirms the effectiveness and efficiency of FlexSched.</dcterms:abstract>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:06Z</dcterms:available>
<dc:creator>Seifert, André</dc:creator>
<dc:creator>Hung, Jen-Jou</dc:creator>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6196"/>
<dcterms:title>FlexSched : a Flexible Data Schedule Generator for Multi-Channel Broadcast Systems</dcterms:title>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6196/1/preprint_211.pdf"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Hung, Jen-Jou</dc:contributor>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
</rdf:Description>
</rdf:RDF>