Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Bringing real-time scheduling theory and practice closer for multimedia computing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
End-Host Architecture for QoS-Adaptive Communication
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Clairvoyant Non-Preemptive EDF Scheduling
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Systematic Security and Timeliness Tradeoffs in Real-Time Embedded Systems
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
A set of schedulers for grid networks
Proceedings of the 2007 ACM symposium on Applied computing
Improving security for periodic tasks in embedded systems through scheduling
ACM Transactions on Embedded Computing Systems (TECS)
Towards security and QoS optimization in real-time embedded systems
ACM SIGBED Review - Special issue: The work-in-progress (WIP) session of the RTSS 2005
Journal of Systems and Software
The incentive secure mechanism based on quality of service in P2P network
Computers & Mathematics with Applications
Scheduling multiple DAGs onto heterogeneous systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A novel approach for QoS guided metascheduler for P2P grid system
ICICA'10 Proceedings of the First international conference on Information computing and applications
A path priority-based task scheduling algorithm for heterogeneous distributed systems
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
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.