Computation offloading for real-time systems

Authors:
Anas Toma;Jian-Jia Chen
Affiliations:
Karlsruhe Institute of Technology, Germany;Karlsruhe Institute of Technology, Germany
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 3
Cited 0

Computation offloading to save energy on handheld devices: a partition scheme

CASES '01 Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems
Task Allocation for Distributed Multimedia Processing on Wirelessly Networked Handheld Devices

IPDPS '02 Proceedings of the 16th International Symposium on Parallel and Distributed Processing
Adaptive computation offloading for energy conservation on battery-powered systems

ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computation offloading has been adopted to improve the performance of embedded systems by offloading the computation of some tasks, especially computation-intensive tasks, to servers or clouds. This paper explores computation offloading for real-time embedded systems to decide which tasks should be offloaded to get the results in time. Such a problem is NP-complete even for frame-based real-time tasks with the same period and relative deadline. We develop a pseudo-polynomial-time algorithm for deriving feasible schedules, if they exist.