Indirect jumps improve instruction sequence performance
10
TL;DR: In this article, it was shown that the maximal internal delays of instruction sequences on execution that are not bounded by a linear function can be increased with the elimination of indirect jump instructions.
read more
Abstract: Instruction sequences with direct and indirect jump instructions are as expressive as instruction sequences with direct jump instructions only. We show that, in the case where the number of instructions is not bounded, we are faced with increases of the maximal internal delays of instruction sequences on execution that are not bounded by a linear function if we strive for acceptable increases of the lengths of instruction sequences on elimination of indirect jump instructions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Instruction sequences and non-uniform complexity theory
TL;DR: This work develops theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion and defines counterparts of the complexity classes P/ poly and NP/poly and forms a counterpart to the complexity theoretic conjecture that NP is not included in P/poly.
Instruction sequence based non-uniform complexity classes
TL;DR: An approach to non-uniform complexity in which single-pass instruction sequences play a key part is presented, and a counterpart of the well-known complexity theoretic conjecture that NP is not included in P/poly is formulated.
•Posted Content
Instruction Sequence Expressions for the Secure Hash Algorithm SHA-256
TL;DR: This work describes such instruction sequences for the restrictions to bit strings of the different possible lengths by means of uniform terms from an algebraic theory.
•Posted Content
Putting instruction sequences into effect
TL;DR: An attempt is made to define the concept of execution of an instruction sequence and it is found to be a special case of directly putting into effect of an Instruction sequence.
•Posted Content
Instruction sequence expressions for the Karatsuba multiplication algorithm
TL;DR: In this paper, the restriction of the function to bit strings of any given length can be computed according to the Karatsuba multiplication algorithm by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction.
References
•Book
The Java Language Specification
James Gosling,Bill Joy,Guy L. Steele +2 more
- 12 Sep 1996
TL;DR: The Java Language Specification, Second Edition is the definitive technical reference for the Java programming language and provides complete, accurate, and detailed coverage of the syntax and semantics of the Java language.
•Posted Content
Instruction sequences with indirect jumps
TL;DR: In this article, the authors study sequential programs that are instruction sequences with direct and indirect jump instructions and define the meaning of programs with indirect jump instruction of that kind by means of a translation into programs without indirect instruction.
6
•Posted Content
Mechanistic behavior of single-pass instruction sequences
TL;DR: This article model mechanistic processing preceding some further behavior as a delay of that behavior, and borrows a unary delay operator from discrete time process algebra to define a mechanistic improvement ordering on threads.
•Posted Content
Expressiveness and Extensions of an Instruction Sequence Semigroup
TL;DR: This thesis builds on C by introducing an alternative semigroup Cg which employs label and goto instructions instead of relative jump instructions as control structures and shows that restricting the instruction sets of C and Cg to contain only finitely many distinct jump, goto or label instructions in either or both directions reduces their expressiveness.
2
Combining programs and state machines
TL;DR: State machines are used for abstract data type modeling as mentioned in this paper, where state machines consume and process actions complementary to programs issuing actions and reply with a boolean response to each action in their interface.
Related Papers (5)
Wang Yong,Wang Zhonghai,Xiao Zuonan,Zheng Jiang +3 more
- 23 Apr 2014
Xie Changhua
- 22 Jul 2015
Sha Li,Lan Junqiang,Zhu Lei +2 more
- 24 Jul 2013