A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory

Sanjoy Baruah, Pontus Ekberg

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Amongst Wang’s contributions to real-time computing are those in which he and his collaborators have pushed the boundaries of pseudo-polynomial time schedulability analysis: developing expressive task models for which schedulability analysis can be done using algorithms that have pseudo-polynomial running time. In this note we revisit these contributions in the light of more recent work that provides additional context within which to view Wang’s results, and investigate further directions in which his contributions can be extended.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Science and Business Media Deutschland GmbH
Pages120-134
Number of pages15
DOIs
StatePublished - 2025

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
VolumeLNCS 15230
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory'. Together they form a unique fingerprint.

Cite this