Scheduling with Task Duplication for Application Offloading

Document Type

Contribution to Book

Publication Date

1-8-2017

Publication Title

Proceedings of the Consumer Communications and Networking Conference

DOI

10.1109/CCNC.2017.7983212

ISBN

978-1-5090-6196-9

ISSN

2331-9860

Abstract

Computation offloading frameworks partition an application's execution between a cloud server and the mobile device to minimize its completion time on the mobile device. An important component of an offloading framework is the partitioning algorithm that decides which tasks to execute on mobile device or cloud server. The partitioning algorithm schedules tasks of a mobile application for execution either on mobile device or cloud server to minimize the application finish time. Most offloading frameworks partition parallel applications devices using an optimization solver which takes a lot of time. We show that by allowing duplicate execution of selected tasks on both the mobile device and the remote cloud server, a polynomial algorithm exists to determine a schedule that minimizes the completion time. We use simulation on both random data and traces to show the savings in both finish time and scheduling time over existing approaches. Our trace-driven simulation on benchmark applications shows that our algorithm reduces the scheduling time by 8 times compared to a standard optimization solver while guaranteeing minimum makespan.

Link to Full Text

Share

COinS