Service offloading in adaptive real-time systems

Ferreira, Luís Lino; Silva, Guilherme; Pinho, Luís Miguel

doi:10.1109/etfa.2011.6059236

Cited by 9 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, Ferreira et al [4] explore the computation offloading to improve the quality of service in the adaptive real-time systems. A timeout mechanism is used for the offloading decision in [26] to reduce the energy consumption on battery-powered systems.…”

Section: Related Work For Computation Offloadingmentioning

confidence: 99%

See 1 more Smart Citation

Computation Offloading for Frame-Based Real-Time Tasks with Resource Reservation Servers

Toma

Chen

2013

2013 25th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

Computation offloading concept has been recently adopted to improve the performance of embedded systems by moving some computation-intensive tasks (partially or wholly) to a powerful remote server. In this paper, we consider a computation offloading problem for frame-based real-time tasks, in which all the tasks have the same arrival time and the same relative deadline/period, by adopting the total bandwidth server (TBS) as resource reservations in the server side (remote execution unit). We prove that the problem is N P -complete and propose two algorithms in this paper. The first algorithm is a greedy algorithm with low complexity and provides a quick heuristic approach to decide which tasks to be offloaded and how the tasks are scheduled. The maximum finishing time of the solution derived from the greedy algorithm is at most twice of the finishing time (makespan, maximal on the client and on the server) of any schedule. The second algorithm is a dynamic programming approach, which builds a three-dimensional table and requires pseudo-polynomial time complexity, to make an optimal decision for computation offloading. The algorithms are evaluated with a case study of a surveillance system and synthesized benchmarks.

show abstract

Section: Related Work For Computation Offloadingmentioning

confidence: 99%

“…The time complexity of the algorithm is O(n log n).Theorem 2: The M * derived in Line 16 in Algorithm 1 is an optimal solution for the linear programming in(4), and, hence, a lower bound of the optimal makespan.…”

mentioning

confidence: 98%

Computation Offloading for Frame-Based Real-Time Tasks with Resource Reservation Servers

Toma

Chen

2013

2013 25th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

show abstract

“…Although the idea of computation offloading has been studied previously [1][2][3][4][5][6][7], all of the existing approaches decide whether a task is executed locally or is offloaded Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.…”

Section: Introductionmentioning

confidence: 99%

Computation offloading for real-time systems

Toma

Chen

2013

Proceedings of the 28th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

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 N P-complete even for framebased real-time tasks with the same period and relative deadline. We develop a pseudo-polynomial-time algorithm for deriving feasible schedules, if they exist.

show abstract