A Scheduling Framework for Periodic Tasks in Geo-Distributed Data Centers

We present FPT, a scheduling framework for periodic tasks that uses the temporal characteristic of periodic tasks to alleviate the overhead of geo-distributed data centers. In FPT, clients are able to express the periodicity about their tasks, and this characteristic is used to realize one-time scheduling for multiple executions. For a set of periodic tasks, aiming to find the minimum number of VMs required to guarantee the schedulability and generate the task execution sequence on each VM, an algorithm is also presented. A case-study and its evaluation are given to show the efficiency of our framework.