Accessibility navigation

Transmathematical basis of infinitely scalable pipeline machines

Anderson, J. (2015) Transmathematical basis of infinitely scalable pipeline machines. In: ICCS 2015 Computational Science at the Gates of Nature, pp. 1828-1837.

Text (Open Access) - Published Version
· Available under License Creative Commons Attribution Non-commercial No Derivatives.
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Official URL:


We describe infinitely scalable pipeline machines with perfect parallelism, in the sense that every instruction of an inline program is executed, on successive data, on every clock tick. Programs with shared data effectively execute in less than a clock tick. We show that pipeline machines are faster than single or multi-core, von Neumann machines for sufficiently many program runs of a sufficiently time consuming program. Our pipeline machines exploit the totality of transreal arithmetic and the known waiting time of statically compiled programs to deliver the interesting property that they need no hardware or software exception handling.

Item Type:Conference or Workshop Item (Paper)
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:43186
Uncontrolled Keywords:transreal arihtmetic, von Neumann Machine, pipeline


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation