Dynamic Task Scheduling with Security Awareness in Real-Time Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Performance Implications of Periodic Checkpointing on Large-Scale Cluster Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19
Journal of Parallel and Distributed Computing
Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling
IEEE Transactions on Computers
Scheduling Security-Critical Real-Time Applications on Clusters
IEEE Transactions on Computers
Parallel Computing - Optimization on grids - Optimization for grids
Improving security for periodic tasks in embedded systems through scheduling
ACM Transactions on Embedded Computing Systems (TECS)
Real-time scheduling with quality of security constraints
International Journal of High Performance Computing and Networking
Journal of Parallel and Distributed Computing
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
Algorithms for testing fault-tolerance of sequenced jobs
Journal of Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Algorithms and mechanisms for procuring services with uncertain durations using redundancy
Artificial Intelligence
Fault-tolerant scheduling based on periodic tasks for heterogeneous systems
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Enhancing security of real-time applications on grids through dynamic scheduling
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Dependable Grid Workflow Scheduling Based on Resource Availability
Journal of Grid Computing
| Hi-index | 0.01 |
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provides more features and capabilities than existing algorithms that schedule only independent tasks in real-time homogeneous systems. In addition, the proposed algorithm takes the heterogeneities of computation, communication and reliability into account, thereby improving the reliability. To provide fault-tolerant capability, the algorithm employs a primary-backup copy scheme that enables the system to tolerate permanent failures in any single processor. In this scheme, a backup copy is allowed to overlap with other backup copies on the same processor, as long as their corresponding primary copies are allocated to different processors. Tasks are judiciously allocated to processors so as to reduce the schedule length as well as the reliability cost, defined to be the product of processor failure rate and task execution time. In addition, the time for detecting and handling of a permanent fault is incorporated into the scheduling scheme, thus making the algorithm more practical. To quantify the combined performance of fault-tolerance and schedulability, the performability measure is introduced. Compared with the existing scheduling algorithms in the literature, our scheduling algorithm achieves an average of 16.4% improvement in reliability and an average of 49.3% improvement in performability.