2009
DOI: 10.1007/978-3-642-03466-4_8
|View full text |Cite
|
Sign up to set email alerts
|

Transmission Protocols for Instruction Streams

Abstract: Abstract. Threads as considered in thread algebra model behaviours to be controlled by some execution environment: upon each action performed by a thread, a reply from its execution environment -which takes the action as an instruction to be processed -determines how the thread proceeds. In this paper, we are concerned with the case where the execution environment is remote: we describe and analyse some transmission protocols for passing instructions from a thread to a remote execution environment.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2012
2012

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…form of running, a process which is sometimes referred to as debugging (even in the absence of bugs that might be found or repaired). 18 Executions of X may not exist. As "execution of X" refers to a subclass of "putting X into effect", that subclass may be empty.…”
Section: Further Mattersmentioning
confidence: 99%
See 1 more Smart Citation
“…form of running, a process which is sometimes referred to as debugging (even in the absence of bugs that might be found or repaired). 18 Executions of X may not exist. As "execution of X" refers to a subclass of "putting X into effect", that subclass may be empty.…”
Section: Further Mattersmentioning
confidence: 99%
“…Performance related matters of instruction sequences have also been investigated in the spirit of the theory of computation [16]. Moreover, in the area of computer architectures, basic techniques aimed at increasing processor performance have been investigated from that viewpoint [9,12], and the instruction streams that arise on execution of instruction sequences [18] have been studied. The results of these investigations are evidence of the workability of the viewpoint that a program is an instruction sequence.…”
Section: Introductionmentioning
confidence: 99%
“…As another continuation of the work on a new approach to programming language semantics mentioned above, selected issues relating to well-known subjects from the theory of computation and the area of computer architecture were rigorously investigated thinking in terms of instruction sequences (see e.g. [14,15,16,17,19]). The subjects from the theory of computation, namely the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits (see e.g.…”
Section: Introductionmentioning
confidence: 99%