Computer Science

T. Baker

1991.4.1REAL-TIME SYSTEMS

DOI: 10.1007/bf00365393

tlooto Summary

It is shown how to extend the Priority Ceiling Protocol to handle: multiunit resources, which subsume binary semaphores and reader-writer locks; dynamic priority schemes, such as earliest-deadline-first (EDF), that use static “preemption levels”; sharing of runtime stack space between jobs.

Abstract

Abstract is not available.

Citation format

BAKER, T. Stack-based scheduling of realtime processes. REAL-TIME SYSTEMS, 1991, 3: 67–99.