• Publications
  • Influence
Stack-based scheduling of realtime processes
  • T. Baker
  • Computer Science
  • Real-Time Systems
  • 1 April 1991
TLDR
The Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky is a policy for locking binary semaphores that bounds priority inversion (i.e., the blocking of a job while a lower priority job executes), and thereby improves schedulability under fixed priority preemptive scheduling. Expand
  • 710
  • 162
  • PDF
Multiprocessor EDF and deadline monotonic schedulability analysis
  • T. Baker
  • Computer Science
  • RTSS . 24th IEEE Real-Time Systems Symposium,
  • 3 December 2003
TLDR
Schedulability tests are presented for preemptive earlier-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single queue m-server system, in which the deadline of a task may be less than or equal to the task period. Expand
  • 286
  • 40
  • PDF
Relativizations of the P =? NP Question
  • 420
  • 34
A stack-based resource allocation policy for realtime processes
  • T. Baker
  • Computer Science
  • [] Proceedings 11th Real-Time Systems Symposium
  • 5 December 1990
TLDR
The stack resource policy (SRP) is a resource allocation policy which permits processes with different priorities to share a single runtime stack. Expand
  • 298
  • 31
  • PDF
Real Time Scheduling Theory: A Historical Perspective
TLDR
In this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review the key results in real-time scheduling theory, a suite of supporting hardware and software open standards, educational and professional training materials, and commercially available schedulability analysis tools. Expand
  • 627
  • 26
  • PDF
EDZL scheduling analysis
TLDR
A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. Expand
  • 89
  • 19
  • PDF
Aperiodic servers in a deadline scheduling environment
TLDR
A real-time system may have tasks with soft deadlines, as well as hard deadlines. Expand
  • 152
  • 14
The cyclic executive model and Ada
TLDR
We present and evaluate the cyclic executive model for controlling periodic processes. Expand
  • 168
  • 14
  • PDF
The partitioned scheduling of sporadic tasks according to static-priorities
TLDR
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduling on each individual processor. Expand
  • 116
  • 12
  • PDF
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
We investigate relativized versions of the open question of whether every language accepted nondeterministically in polynomial time can be recognized deterministically in polynomial time. For any setExpand
  • 563
  • 11