Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 章节

  • 发表日期：

    2025年

查看全文
  • Sanjoy Baruah,
  • Pontus Ekberg

摘要

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.