General Perfectly Periodic Scheduling
Symposium on Principles of Distributed Computing(2006)
摘要
In a perfectly periodic schedule, each job must be scheduled
precisely every some fixed number of time units after its previous
occurrence. Traditionally, motivated by centralized systems, the
perfect periodicity requirement is relaxed, the main goal being to
attain the requested average rate. Recently, motivated by mobile
clients with limited power supply, perfect periodicity seems to be
an attractive alternative that allows clients to save energy by
reducing their "busy waiting" time. In this case, clients may be
willing to compromise their requested service rate in order to get
perfect periodicity. In this paper we study a general model of
perfectly periodic schedules, where each job has a requested period
and a length; we assume that m jobs can be served in parallel for
some given m. Job lengths may not be truncated, but granted
periods may be different than the requested periods.
We present an algorithm which computes schedules such that the
worst-case proportion between the requested period and the granted
period is guaranteed to be close to the lower bound. This algorithm
improves on previous algorithms for perfect schedules in providing a
worst-case guarantee rather than an average-case guarantee, in
generalizing unit length jobs to arbitrary length jobs, and in
generalizing the single-server model to multiple servers.
更多查看译文
关键词
Periodic scheduling,Approximation algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要