Nearly optimal perfectly-periodic schedules

Bar-Noy, Amotz; Nisgav, Aviv; Patt-Shamir, Boaz

doi:10.1145/383962.383998

Cited by 17 publications

(27 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…h It is not difficult to show that the binMax algorithm guarantees an approximation ratio of at most 2; we omit the details (see [12]). We remark that it is known [7] that some binary tree schedules have approximation ratio of at most 4 3 þ 2 3 maxfa i g for the AVE measure. Since binAve produces the best possible binary tree schedule, it follows that its approximation ratio is never worse than 4 3 þ 2 3 maxfa i g. Simulations show that practically, the performance of the algorithm is much better.…”

Section: The Bin Algorithmsmentioning

confidence: 94%

“…The general notion of perfect periodicity and the tree methodology were introduced in [7]. This paper presents algorithms for constructing schedules that are guaranteed to be close to optimum w.r.t.…”

Section: Related Workmentioning

confidence: 99%

“…Tree scheduling is a methodology for constructing perfect schedules that can be represented by rooted trees [7]. The basic idea is that each leaf corresponds to a distinct client, and the period of each client is the product of the degree of all the nodes on the path leading from the root to the corresponding leaf.…”

Section: Scheduling Treesmentioning

confidence: 99%

“…One possible way to construct a schedule is to explicitly compute offsets of clients from the tree [7]. Another way is to use a tree directly.…”

Section: Scheduling Treesmentioning

confidence: 99%

“…One of the most effective ways to construct perfectly periodic schedules is tree scheduling [7]. A tree schedule is essentially a hierarchical composition of round-robin schedules, where the hierarchy is represented by a tree (see example in Fig.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient algorithms for periodic scheduling

2004

Self Cite

View full text Add to dashboard Cite

Section: The Bin Algorithmsmentioning

confidence: 94%

Section: Related Workmentioning

confidence: 99%

Section: Scheduling Treesmentioning

confidence: 99%

“…One possible way to construct a schedule is to explicitly compute offsets of clients from the tree [7]. Another way is to use a tree directly.…”

Section: Scheduling Treesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient algorithms for periodic scheduling

2004

Self Cite

View full text Add to dashboard Cite

Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling

Sun

Kameda

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Customized Newspaper Broadcast: Data Broadcast with Dependencies

Dey

Schabanel

2006

LATIN 2006: Theoretical Informatics

View full text Add to dashboard Cite

Broadcasting has been proved to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks; other typical broadcast networks are Videotext systems). Recent works provide strong evidence that correlationbased broadcast can significantly improve the average service time of broadcast systems. Most of the research on data broadcasting was done under the assumption that user requests are for a single item at a time and are independent of each other. However in many real world applications, such as web servers, dependencies exist among the data items, for instance: web pages on a server usually share a lot of items such as logos, style sheets, title-bar... and all these components have to be downloaded together when any individual page is requested. Such web server could take advantage of the correlations between the components of the pages, to speed up the broadcast of popular web pages. This paper presents a theoretical analysis of data dependencies and provides a polynomial time 4-approximation as well as theoretical proofs that our correlationbased approach can improve by an arbitrary factor the performances of the system. To our knowledge, our solutions are the first provably efficient algorithms to deal with dependencies involving more than two data items. Topics: Approximation algorithms, Wireless and Push-based broadcast scheduling, Bluetooth and Satellite networks. 1 Introduction Motivations. Broadcasting has been proved to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks; other typical broadcast networks are Videotext systems). Recent works [15,14,10] provide strong evidence that correlation-based broadcast can significantly improve the average service time of broadcast systems. Most of the research on data broadcasting was done under the assumption that user requests are for a single item at a time and are independent of each other. However in many real world applications, such as web servers, dependencies exist among the data items, for instance: web pages on a server usually share a lot

show abstract

Nearly optimal perfectly-periodic schedules

Cited by 17 publications

References 17 publications

Efficient algorithms for periodic scheduling

Efficient algorithms for periodic scheduling

Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling

Customized Newspaper Broadcast: Data Broadcast with Dependencies

Contact Info

Product

Resources

About