Back to Search Start Over

Thread algebra for poly-threading

Thread algebra for poly-threading

Authors :
Jan A. Bergstra
Cornelis A. Middelburg
Theory of Computer Science (IVI, FNWI)
Source :
Formal Aspects of Computing, 23(4), 567-583. Springer London
Publisher :
Springer Nature

Abstract

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.<br />Comment: 24 pages, sections 9, 10, and 11 are added

Details

Language :
English
ISSN :
09345043
Volume :
23
Issue :
4
Database :
OpenAIRE
Journal :
Formal Aspects of Computing
Accession number :
edsair.doi.dedup.....f3a5501babe6b5f834e9df408867b9eb
Full Text :
https://doi.org/10.1007/s00165-011-0178-3