当前位置:
X-MOL 学术
›
arXiv.cs.PL
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Process algebra, process scheduling, and mutual exclusion
arXiv - CS - Programming Languages Pub Date : 2020-03-01 , DOI: arxiv-2003.00473 C. A. Middelburg
arXiv - CS - Programming Languages Pub Date : 2020-03-01 , DOI: arxiv-2003.00473 C. A. Middelburg
In the case of multi-threading as found in contemporary programming
languages, parallel processes are interleaved according to what is known as a
process-scheduling policy in the field of operating systems. In a previous
paper, we extend ACP with this form of interleaving. In the current paper, we
do so with the variant of ACP known as ACP$_\epsilon$. The choice of
ACP$_\epsilon$ stems from the need to cover more process-scheduling policies.
We show that a process-scheduling policy supporting mutual exclusion of
critical subprocesses is now covered.
中文翻译:
进程代数、进程调度和互斥
在当代编程语言中发现的多线程的情况下,并行进程根据操作系统领域中所谓的进程调度策略进行交错。在之前的一篇论文中,我们用这种交织形式扩展了 ACP。在当前的论文中,我们使用 ACP 的变体 ACP$_\epsilon$ 来实现。ACP$_\epsilon$ 的选择源于需要涵盖更多的流程调度策略。我们表明,现在涵盖了支持关键子流程互斥的流程调度策略。
更新日期:2020-04-22
中文翻译:
进程代数、进程调度和互斥
在当代编程语言中发现的多线程的情况下,并行进程根据操作系统领域中所谓的进程调度策略进行交错。在之前的一篇论文中,我们用这种交织形式扩展了 ACP。在当前的论文中,我们使用 ACP 的变体 ACP$_\epsilon$ 来实现。ACP$_\epsilon$ 的选择源于需要涵盖更多的流程调度策略。我们表明,现在涵盖了支持关键子流程互斥的流程调度策略。