arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0803.0378cs.LO
收藏

多线程的线程代数

Thread algebra for poly-threading

J. A. Bergstra, C. A. Middelburg

摘要:

在基本线程代数中考虑的线程主要被看作是顺序程序在执行时表现出的行为。生活中的一个事实是,顺序程序往往是支离破碎的。因此,碎片化的程序行为经常被发现。在本文中,我们考虑这种现象。我们扩展了基本的线程代数与最简单的机制,线程的排序是采取的片段。这种机制称为多线程,支持排序中的自主和非自主线程选择。我们将由此产生的理论称为ACP的过程的代数理论,并用它来描述适合于碎片化程序的分析执行架构。我们还考虑的情况下,分散的程序行为的步骤交错的方式,非分布式和分布式多线程。

英文摘要:

Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program behaviours are frequently found. In this paper, we consider this phenomenon. We extend basic thread algebra with the barest mechanism for sequencing of threads that are taken for fragments. This mechanism, called poly-threading, supports both autonomous and non-autonomous thread selection in sequencing. We relate the resulting theory to the algebraic theory of processes known as ACP and use it to describe analytic execution architectures suited for fragmented programs. We also consider the case where the steps of fragmented program behaviours are interleaved in the ways of non-distributed and distributed multi-threading.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑