Lightweight preemptive user-level threads
Lightweight preemptive user-level threads
复制标题
轻量级抢占式用户级线程
DOI：
--
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
P. Balaji
中科院分区：
文献类型：
--
作者：
Shumpei Shiina;Shintaro Iwasaki;K. Taura;P. Balaji
数十年来，已经对用户到内核级线程（或“ M：n线程”）的多个映射模型（或“ M：n线程”）进行了广泛研究，作为当前PTHreads实现的轻巧替代品，这些实现提供了简单的一对一映射（” 1：1线程”）。 M：n线程从允许用户上下文切换线程和完全控制其在用户空间中的计划的能力中获得性能，而无需内核参与。但是，同样的能力会导致m：n线程失去隐式OS抢占的内核提供的能力---线程必须明确地对安排其他线程的其他线程产生控制。因此，非抢先的M：N线程的程序可能会导致核心饥饿，优先级排序丢失，有时还会导致僵局，除非将程序写成以明确的位置在适当的位置屈服。本文探讨了M：N线程的两种技术，以有效地实现类似于1：1螺纹的隐式抢占：信号收益和klt-switching。与非优先级M：N线程相比，通过我们的优化，这些技术的开销可能少于1％。我们对三个应用程序的评估表明，我们针对M：N线程的先发制技术可改善核心利用率，并通过利用轻量级上下文切换和M：N线程的灵活安排来提高性能。
Many-to-many mapping models for user- to kernel-level threads (or "M:N threads") have been extensively studied for decades as a lightweight substitute for current Pthreads implementations that provide a simple one-to-one mapping ("1:1 threads"). M:N threads derive performance from their ability to allow users to context switch between threads and control their scheduling entirely in user space with no kernel involvement. This same ability, however, causes M:N threads to lose the kernel-provided ability of implicit OS preemption---threads have to explicitly yield control for other threads to be scheduled. Hence, programs over nonpreemptive M:N threads can cause core starvation, loss of prioritization, and, sometimes, deadlock unless programs are written to explicitly yield in proper places. This paper explores two techniques for M:N threads to efficiently achieve implicit preemption similar to 1:1 threads: signal-yield and KLT-switching. Overheads of these techniques, with our optimizations, can be less than 1% compared with nonpreemptive M:N threads. Our evaluation with three applications demonstrates that our preemption techniques for M:N threads improve core utilization and enhance the performance by utilizing lightweight context switching and flexible scheduling of M:N threads.
轻量级抢占式函数
DOI：
--
发表时间：
2020
期刊：
2020 USENIX Annual Technical Conference (USENIX ATC 20
影响因子：
--
作者：
Boucher, Sol;Kalia, Anuj Kalia;Andersen, David G.;Kaminsky, Michael
通讯作者：
Kaminsky, Michael
基于编译器的超细粒度抢占式并行计时
DOI：
10.1109/sc41405.2020.00057
发表时间：
2020
期刊：
and Analysis (SC 2020
影响因子：
--
作者：
Ghosh, Souradip;Cuevas, Michael;Campanoni, Simone;Dinda, Peter
通讯作者：
Dinda, Peter