arXiv Open Access 2011

An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

Paul Regnier George Lima Ernesto Massa

Lihat Sumber

Abstrak

An optimal solution to the problem of scheduling real-time tasks on a set of identical processors is derived. The described approach is based on solving an equivalent uniprocessor real-time scheduling problem. Although there are other scheduling algorithms that achieve optimality, they usually impose prohibitive preemption costs. Unlike these algorithms, it is observed through simulation that the proposed approach produces no more than three preemptions points per job.

Topik & Kata Kunci

cs.OS

Penulis (3)

Paul Regnier

George Lima

Ernesto Massa

Format Sitasi

APA MLA BibTeX

Regnier, P., Lima, G., Massa, E. (2011). An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor. https://arxiv.org/abs/1104.3523

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓