Adaptive general perfectly periodic scheduling

We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known as the period of the client. The periodicity of such schedules can be used to save battery life of nodes in a wireless network. The quality of a perfectly periodic schedule is a function of the ratio between the granted and requested periods. We find a worst case performance bound on the quality of schedules produced by Adaptmin. We also deduce family of input instances where either Adaptmin does no worse than previous work, or always outperforms previous work. The better performance of Adaptmin is confirmed by simulations results for randomly generated input instances. The simulation results also show that the schedules produced by Adaptmin can be more than 25% efficient. We also propose a variant of Adaptmin which is computationally much less demanding compared to previous work, but is very close to Adaptm...

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Shailesh Patil, Vijay K. Garg
• Keywords: Adaptive Algorithm Adaptmin, Input Instances, IPL 2006, Periodic Schedule