Task scheduling in heterogeneous distributed systems with security and QoS requirements
by Naeem Al-Oudat; Govindarasu Manimaran
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 9, No. 1/2, 2012

Abstract: Heterogeneous distributed systems are continuously being deployed, e.g., P2P and military command, control, communications, computers, and intelligence (C4I). Many of these applications trade-off quality of service (QoS) and security. In this paper, we study the problem of allocating and scheduling a set of dependent tasks with security and QoS requirements on a set of heterogeneous sites. This problem is at least as hard as the basic NP-hard problem of scheduling a directed acyclic graph (DAG) on multiple processors. In particular, we make the following contributions: 1) we formulate the problem as an optimisation problem; 2) we use a branch and bound (B&B) method guided by an upper bound on total QoS value (TQV) to find the optimal solution if one exist; 3) we propose a heuristic algorithm to provide a near optimal solution for the scheduling of the assigned tasks on a site to maximise the QoS provided by this site in a polynomial time; 4) we evaluate the heuristic algorithm and compare it with some baseline algorithms using variations of synthetic workloads.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com