Efficient periodic scheduling by trees

Bar-Noy, Amotz; Dreizin, Vladimir; Patt-Shamir, Boaz

doi:10.1109/infcom.2002.1019325

Cited by 12 publications

(11 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bar-Noy et al [1] and Brakerski et al [4] proposed the notion of periodicity in mobile and asymmetric communication, such as bluetooth networks. A perfectly periodic schedule in Brakerski et al [4] is defined as follows.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Balancing perfectly periodic service schedules: An application from recycling and waste management

Kazan

Dawande

Sriskandarajah

et al. 2012

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck-hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP-hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real-world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…Constraint set (1) ensures that the first installment of service S i is scheduled within the weeks from 1 to p i . Constraint set (2) satisfies the periodicity requirement of the PPSS problem.…”

Section: Formulation Of the Ppss Problemmentioning

confidence: 99%

Balancing perfectly periodic service schedules: An application from recycling and waste management

Kazan

Dawande

Sriskandarajah

et al. 2012

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…In addition, the polling algorithm itself may also result in nonstationarity. Specifically, the perfect periodic polling proposed in [3] usually cannot achieve 100 percent utilization. Therefore, we consider using a well-known polling method called periodic poller [13] or deadline-driven poller to avoid possible confusion that results with perfectly periodic polling.…”

Section: Derivation Of Initial Policymentioning

confidence: 99%

Type-Aware Error Control for Robust Interactive Video Services over Time-Varying Wireless Channels

Liao

Lai²

2011

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-We propose a scheme called Type-Aware Error Control (TAEC) to provide robust interactive video services over timevarying wireless channels. Basically, TAEC explores the temporal dependence of video frames by pushing out the lower impact frames. In doing so, queuing delay is controlled and the important frame is retransmitted multiple times. We consider the application of the nonstationary stochastic control to further improve the wireless system throughput by exploring the multiuser diversity gain. The techniques involved in our proposed solution consist of constructing a Markov model, reducing the number of parameters estimated, and avoiding the state explosion problem. The provisioning of immediate bandwidth guarantee is another feature of TAEC, i.e., when exploring the multiuser diversity gain, the users share their reserved bandwidth only if the perceived video qualities are acceptable. As shown in the simulation, TAEC improves the perceived video quality in terms of luminance PSNR when compared to other schemes.

show abstract

“…Fast Distributed Resolution. To the best of our knowledge, the only previously known schedules with distributed resolutions of O(1) time per slot are the perfectly-periodic schedules introduced by Bar-Noy, Nisgav and Patt-Shamir [11] and further studied in [17,9]. Their approach takes to the extreme the concept of 'as evenly distributed as possible'; namely, the time-slots allocated to a client are required to constitute an arithmetic sequence.…”

Section: Related Workmentioning

confidence: 99%

On Centralized Smooth Scheduling

Litman

Moran-Schein

2009

Algorithmica

View full text Add to dashboard Cite

This paper studies evenly distributed sets of natural numbers and their applications to scheduling in a distributed environment. Such sets, called smooth sets, have the property that their quantity within each interval is proportional to the size of the interval, up to a bounded additive deviation; namely, for ρ, ∆ ∈ R a set A of natural numbers is (ρ, ∆)-smooth if abs(|I| · ρ − |I ∩ A|) < ∆ for any interval I ⊂ N.The current paper studies scheduling persistent clients on a single slot-oriented resource in a flexible, predictable and distributed manner. Each client γ has a given rate ρ γ that defines the share of the resource he is entitled to receive and the goal is a smooth schedule in which, for some predefined ∆, each client γ is served in a (ρ γ , ∆)-smooth set of slots (natural numbers). The paper focuses on a distributed environment where each client by itself (without any inter-client communication) resolves (computes), slot after slot, whether or not it owns this slot. The paper presents extremely efficient schedules under which a client resolves each slot in a constant time.The paper considers two scheduling frameworks. The first one, the Flat Scheduling Framework, is the common problem where the rates of the clients are given a priori. In the second and novel framework, the Open-Market Scheduling Framework, fractions of the resource are bought and sold by dealers. Each dealer, upon receiving his fraction, may choose either to become a client and use his share, or to remain a dealer and sell fractions of his share to other dealers. In this framework, the allocation process is highly distributed; moreover, fractions of several resources can be combined into a single virtual resource of new capabilities.The paper presents two scheduling techniques. Both techniques, in both frameworks, produce smooth schedules with highly efficient distributed resolutions -a client resolves each slot in O(1) time on a RAM with a moderate number of memory words, all of a small size. Each technique has its pros and cons. For example, one technique utilizes 100% of the resource but its resolution algorithm requires a number of words which is linear in the number of clients; the other technique utilizes only 99% of the resource but its resolution algorithm requires just O(1) words.One of these techniques yields a solution to Tijdeman's Hierarchial Chairman Assignment Problem which outperforms prior solutions. The other technique naturally extends to the problem of scheduling multiple resources, under the restriction that a client may be served concurrently by at most one resource. The extension yields the first solution to this problem having efficient distributed resolution. Prior solutions produce a special type of smooth scheduling called P-fair scheduling, are centralized, and are less efficient than ours.

show abstract

Efficient periodic scheduling by trees

Cited by 12 publications

References 21 publications

Balancing perfectly periodic service schedules: An application from recycling and waste management

Balancing perfectly periodic service schedules: An application from recycling and waste management

Type-Aware Error Control for Robust Interactive Video Services over Time-Varying Wireless Channels

On Centralized Smooth Scheduling

Contact Info

Product

Resources

About