Scheduling real time parallel structures on cluster computing with possible processor failures

Authors:
A. Amin;R. Ammar;A. El Dessouly
Affiliations:
Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA;Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA;Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
Venue:
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Year:
2004

Citing 0
Cited 5

Scheduling Security-Critical Real-Time Applications on Clusters

IEEE Transactions on Computers
A two-phase scheduling strategy for real-time applications with security requirements on heterogeneous clusters

Computers and Electrical Engineering
Real-time scheduling of divisible loads in cluster computing environments

Journal of Parallel and Distributed Computing
Scheduling real-time divisible loads with advance reservations

Real-Time Systems
Efficient real-time divisible load scheduling

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability as a main goal and ignores other effects such as machines failures. In This work we develop an algorithm to efficiently schedule parallel task graphs (fork-join structures). Our scheduling algorithm considers more than one factor at the same time. These factors are scheduability, reliability of the participating processors and achieved degree of parallelism. To achieve most of these goals, we composed an objective function that combines these different factors simultaneously. The proposed objective function is adjustable to provide the user with a way to prefer one factor to the others. The simulation results indicate that our algorithm produces schedules where the applications deadlines are met, reliability is maximized and the application parallelism is exploited.