Resource allocation of security-critical tasks with statistically guaranteed energy constraint

  • Jiang W
  • Jiang K
  • Ma Y
  • 8


    Mendeley users who have this article in their library.
  • 10


    Citations of this article.


In this paper, we are interested in resource allocation for energy
constrained and security-critical embedded systems. Tasks in such
systems need to be successfully executed under certain energy budget
and be robust against serious security threatens. Different to former
energy minimal scheduling problem, we introduce a new optimization
problem for a set of tasks with energy constraint and multiple security
choices. We present a dynamic programming based approximation algorithm
to minimize the security risk of the system while statistically guaranteeing
energy consumption constraints for given energy slack ratio. The
proposed algorithm is very efficient in both time and space dimensions,
and achieves good solutions. Extensive simulations demonstrate the
superiority of our algorithm over other approaches.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free