On the operating unit size of load/store architectures†

We introduce a strict version of the concept of a load/store instruction set architecture in the setting of Maurer machines. We take the view that transformations on the states of a Maurer machine are achieved by applying threads as considered in thread algebra to the Maurer machine. We study how the transformations on the states of the main memory of a strict load/store instruction set architecture that can be achieved by applying threads depend on the operating unit size, the cardinality of the instruction set and the maximal number of states of the threads.

[1]  Jan A. Bergstra,et al.  Polarized Process Algebra and Program Equivalence , 2003, ICALP.

[2]  Jan A. Bergstra,et al.  Parallel Processes with Implicit Computational Capital , 2008, LIX.

[3]  Alban Ponse,et al.  Risk Assessment for One-Counter Threads , 2008, Theory of Computing Systems.

[4]  Jan A. Bergstra,et al.  An upper bound for the equational specification of finite state services , 2005, Inf. Process. Lett..

[5]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[6]  Jan A. Bergstra,et al.  Maurer Computers with Single-Thread Control , 2007, Fundam. Informaticae.

[7]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[8]  Jan A. Bergstra,et al.  Combining programs and state machines , 2002, J. Log. Algebraic Methods Program..

[9]  Ward Douglas Maurer.  A theory of computer instructions , 2006, Sci. Comput. Program..

[10]  David A. Patterson,et al.  Computer Architecture - A Quantitative Approach, 5th Edition , 1996 .

[11]  J. E. Thornton.  Design of a Computer: The Control Data 6600 , 1970 .

[12]  Jan A. Bergstra,et al.  Maurer computers for pipelined instruction processing† , 2008, Mathematical Structures in Computer Science.

[13]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[14]  Jan A. Bergstra,et al.  Division Safe Calculation in Totalised Fields , 2008, Theory of Computing Systems.

[15]  Jan A. Bergstra,et al.  Splitting bisimulations and retrospective conditions , 2006, Inf. Comput..

[16]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[17]  Jan A. Bergstra,et al.  Interface Groups for Analytic Execution Architectures , 2006 .

[18]  Jan A. Bergstra,et al.  Thread Algebra with Multi-Level Strategies , 2006, Fundam. Informaticae.

[19]  Jan A. Bergstra,et al.  Projection semantics for rigid loops , 2007, ArXiv.

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[22]  Jan A. Bergstra,et al.  Interface groups and financial transfer architectures , 2007, ArXiv.

[23]  T. D. Vu.  Metric Denotational Semantics for BPPA , 2005 .

[24]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[25]  Jan A. Bergstra,et al.  Decision problems for pushdown threads , 2007, Acta Informatica.

[26]  Jan A. Bergstra,et al.  Synchronous cooperation for explicit multi-threading , 2007, Acta Informatica.