By Topic

QoS and security aware allocation of Directed Acyclic Graph on heterogeneous distributed real-time systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Al-Oudat, N. ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA ; Govindarasu, M.

Heterogeneous distributed real-time systems are continuously evolving to realize many emerging mission critical applications, e.g., battle field vision systems. In such systems, there often exists a tradeoff between quality of results and security of task execution while satisfying real-time constraints. In this paper we consider a set of dependent real-time tasks, modeled as Directed Acyclic Graph (DAG), with security and QoS requirements for assignment and scheduling on a set of heterogeneous sites with the objective of maximizing Total Quality Value (TQV) of the system. This problem is NP-hard since the basic problem of scheduling a DAG on multiple processors is NP-hard. We make the following contributions; (i) define new metric, TQV, which captures QoS aspects of the DAG and helps in choosing a task in the task graph, DAG, to increase its QoS level so as to raise system TQV to the best value, (ii) based on the defined metric, we propose a polynomial time heuristic algorithm to maximize TQV, and (iii) we evaluate the algorithm through simulation studies by comparing it to baseline algorithms for variations of synthetic workloads. The proposed algorithm outperforms the baseline algorithms in all the simulated conditions for fully-connected and shared bus network topologies.

Published in:

Computing, Networking and Communications (ICNC), 2012 International Conference on

Date of Conference:

Jan. 30 2012-Feb. 2 2012