Performance-based dynamic scheduling of hybrid real-time applications on a cluster of heterogeneous workstations

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is assumed in this paper that periodic real-time applications are being run on a cluster of heterogeneous workstations, and new non-periodic real-time applications arrive at the system dynamically. In the dynamic scheduling scheme presented in this paper, the new applications are scheduled in such a way that they utilize spare capabilities left by existing periodic applications in the cluster. An admission control is introduced so that new applications are rejected by the system if their deadlines cannot be met. The effectiveness of the proposed scheduling scheme has been evaluated using simulation; experimental results show that the system utilization is significantly improved. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

He, L., Jarvis, S. A., Spooner, D. P., & Nudd, G. R. (2004). Performance-based dynamic scheduling of hybrid real-time applications on a cluster of heterogeneous workstations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 195–200. https://doi.org/10.1007/978-3-540-45209-6_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free