John P. Lehoczky

Carnegie Mellon University

Papers

4

Total Citations

444

H-Index

4

About

John P. Lehoczky is a towering figure in real-time systems, whose foundational work has shaped how engineers guarantee timing correctness in safety-critical computing. His primary research areas encompass fixed-priority scheduling, timing analysis, and performance predictability for hard real-time systems. Lehoczky’s major contributions include pioneering the timing analysis for fixed-priority scheduling of periodic tasks with varying execution priorities, a framework that allows complex tasks to be decomposed into serially executed subtasks—each with its own deadline and priority. This work, spanning his most cited papers (each garnering 168 citations), provides rigorous methods to verify that all timing constraints are met, even under the most demanding conditions. His 1994 paper on rate-monotonic analysis for industrial computing (98 citations) further cemented his impact, addressing pervasive timing requirements in industrial automation. Beyond worst-case analysis, Lehoczky advanced performance property theories for predictable assembly from certifiable components (PACC), using queueing theory to predict average-case latencies for aperiodic tasks—a critical step toward building certifiably reliable systems. His research remains essential reading for anyone designing real-time controllers, avionics, or industrial robots.

Research Focus

Key Achievements

4
H-Index
4
Papers
444
Total Citations
111
Avg Citations/Paper
🏆 Most Cited Paper
Timing analysis for fixed-priority scheduling of hard real-time systems
168 citations · 1994
📈 Most Prolific Year: 1994 (2 Papers)
🤝 Key Collaborators: 7
🏛 Institutions: Carnegie Mellon University

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 16 days ago