一句话：用细化类型跟踪优先级集合，使响应式并行语言支持动态且一等的线程优先级，并给出吞吐与响应性界。
响应式并行语言 PriML 允许为轻量级线程标注优先级，其类型系统可避免优先级反转并给出吞吐与响应性界，但要求线程生成后不能改变优先级，且优先级只能是代码中的字面量，因而并非一等值。本文放宽这两个限制，借鉴细化类型技术跟踪线程可能具有的优先级集合，并把响应式并行的图代价模型扩展到支持一等且可变的优先级。作者证明扩展语言中良类型程序仍具有吞吐与响应性界，并在 PriML 编译器中实现该类型系统扩展；以并发 Web 服务器为案例，展示了动态与一等优先级带来的收益。
PriML, a language developed in recent work on responsive parallelism , extends traditional fine-grained parallel languages such as Cilk by allowing programmers to annotate threads with priorities . Programmers thus get the substantial throughput benefits of lightweight threads scheduled by a user-level runtime, while retaining the ability to use threads for responsive applications typically programmed with lower-level threading systems. PriML’s type system guarantees the absence of priority inversions , costly performance errors in which high-priority threads are delayed by low-priority threads, enabling formal bounds on throughput and responsiveness, but at the cost of expressiveness: threads may not change priority once spawned and the priority of a thread is specified as a priority literal in the code (i.e., priorities are not first-class ). This work relaxes the two assumptions above by tracking sets of priorities using techniques drawn from the literature on refinement types. We extend the graph-based cost models of responsive parallelism to incorporate first-class and changing priorities, and prove bounds on the throughput and responsiveness of well-typed programs in our extended language. We implement our type system extensions in the PriML compiler, and demonstrate the benefits of the extension using a concurrent web server as a case study.
@article{LeonDM26,
title = {Responsive Parallelism with Dynamic and First-Class Priorities},
author = {Marelle León and My Dinh and Stefan K. Muller},
journal = {Proceedings of the ACM on Programming Languages},
volume = {10},
number = {PLDI},
year = {2026},
doi = {10.1145/3808334}
}