Transmathematical basis of infinitely scalable pipeline machines

Lists

Download

Preview

Transmathematical Basis.pdf - Published Version (269kB) | Preview

Available under license: Creative Commons Attribution Non-commercial No Derivatives

Tools

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

Abstract/Summary

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)
URI	https://reading-clone.eprints-hosting.org/id/eprint/43186
Item Type	Conference or Workshop Item
Refereed	Yes
Divisions	Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Uncontrolled Keywords	transreal arihtmetic, von Neumann Machine, pipeline
Download/View statistics	View download statistics for this item

Download Statistics

Downloads

Downloads per month over past year

Deposit Details

Date Deposited:	29 Sep 2015 08:11	Date item deposited into CentAUR
Last Modified:	10 Jul 2021 21:19	Date item last modified

References

[1] Ieee standard for binary floating-point arithmetic. Archived at http://ieeexplore.ieee.org/ xpl/articleDetails.jsp?arnumber=30711 1985. [2] Ieee standard for floating-point arithmetic. Archived at http://ieeexplore.ieee.org/xpl/ articleDetails.jsp?arnumber=4610935 2008. [3] J. A. D. W. Anderson. Representing geometrical knowledge. Phil. Trans. Roy. Soc. Lond. Series B., 352(1358):1129–1139, 1997. Archived at http://www.ncbi.nlm.nih.gov/pmc/articles/ PMC1692011/pdf/9304680.pdf [4] James A. D. W. Anderson. Perspex machine. In Longin Jan Lateki, David M. Mount, and Angela Y. Wu, editors, Vision Geometry XI, volume 4794 of Proceedings of SPIE, pages 10–21, 2002. Last accessed in March 2015 at http://www.bookofparagon.com/Mathematics/SPIE.2002. Perspex.pdf [5] James A. D. W. Anderson. Perspex machine xi: Topology of the transreal numbers. In S.I. Ao, Oscar Castillo, Craig Douglas, David Dagan Feng, and Jeong-A Lee, editors, IMECS 2008, pages 330–33, March 2008. Archived at http://www.iaeng.org/publication/IMECS2008/IMECS2008_ pp330-338.pdf [6] James A. D. W. Anderson. Evolutionary and revolutionary effects of transcomputation. In 2nd IMA Conference on Mathematics in Defence. Institute of Mathematics and its Applications, Oct. 2011. Archived at http://www.ima.org.uk/_db/_documents/Anderson.pdf [7] James A. D. W. Anderson. Trans-floating-point arithmetic removes nine quadrillion redundancies from 64-bit ieee 754 floating-point arithmetic. In Lecture Notes in Engineering and Computer Science: Proceedings of The World Congress on Engineering and Computer Science 2014, WCECS 2014, 22-24 October, 2014, San Francisco, USA., volume 1, pages 80–85, 2014. Archived at http: //www.iaeng.org/publication/WCECS2014/WCECS2014_pp80-85.pdf [8] James A. D. W. Anderson and Tiago S. dos Reis. Transreal limits expose category errors in ieee 754 floating-point arithmetic and in mathematics. In Lecture Notes in Engineering and Computer Science: Proceedings of The World Congress on Engineering and Computer Science 2014, WCECS 2014, 22-24 October, 2014, San Francisco, USA., volume 1, pages 86–91, 2014. Archived at http: //www.iaeng.org/publication/WCECS2014/WCECS2014_pp86-91.pdf [9] James A. D. W. Anderson, Norbert V¨olker, and Andrew A. Adams. Perspex machine viii: Axioms of transreal arithmetic. In Longin Jan Lateki, David M. Mount, and Angela Y. Wu, editors, Vision Geometry XV, volume 6499 of Proceedings of SPIE, pages 2.1–2.12, 2007. Last accessed in March 2015 at http://www.bookofparagon.com/Mathematics/PerspexMachineVIII.pdf [10] James A.D.W. Anderson and Walter Gomide. Transreal arithmetic as a consistent basis for paraconsistent logics. In Lecture Notes in Engineering and Computer Science: Proceedings of The World Congress on Engineering and Computer Science 2014, WCECS 2014, 22-24 October, 2014, San Francisco, USA., volume 1, pages 103–108, 2014. Archived at http://www.iaeng.org/ publication/WCECS2014/WCECS2014_pp103-108.pdf [11] John Backus. Can programming be liberated from the von neumann style? a functional style and its algebra of programs. Communications of the ACM, 21(8):613–641, Aug. 1978. Archived at http://dl.acm.org/citation.cfm?id=359579 [12] Jack Dongarra, Jeffrey Hittinger, John Bell, Luis Chacon, Robert Falgout, Michael Heroux, Paul Hovland, Esmond Ng, Clayton Webster, and Stefan Wild. Applied Mathematics Research for Exascale Computing. U.S. Department of Energy, 2014. Archived at http://science.energy. gov/~/media/ascr/pdf/research/am/docs/EMWGreport.pdf [13] Tiago S. dos Reis. N´umeros transreais: matem´atica ou devaneio? In 14◦ Semin´ario Nacional de Hist´oria da Ciˆencia e da Tecnologia, 2014., 2014. Archived at http://www.14snhct.sbhc.org. br/arquivo/download?ID_ARQUIVO=1899 [14] Tiago S. dos Reis and James A. D. W. Anderson. Construction of the transcomplex numbers from the complex numbers. In Lecture Notes in Engineering and Computer Science: Proceedings of The World Congress on Engineering and Computer Science 2014, WCECS 2014, 22-24 October, 2014, San Francisco, USA., volume 1, pages 97–102, 2014. Archived at http://www.iaeng.org/ publication/WCECS2014/WCECS2014_pp97-102.pdf [15] Tiago S. dos Reis and James A. D. W. Anderson. Transdifferential and transintegral calculus. In Lecture Notes in Engineering and Computer Science: Proceedings of The World Congress on Engineering and Computer Science 2014, WCECS 2014, 22-24 October, 2014, San Francisco, USA., volume 1, pages 92–96, 2014. Archived at http://www.iaeng.org/publication/ WCECS2014/WCECS2014_pp92-96.pdf [16] Kurt F. G¨odel. Uber formal unentscheidb¨are ¨ satze der principia mathematica und verwandter systeme. Monatschefte f¨ur Mathematik und Physik, 38:173–199, 1931. Last accessed in March 2015 at http://www.w-k-essler.de/pdfs/goedel.pdf [17] M. D. Godfrey and D. F. Hendry. First draft of a report on the edvac. IEEE Annals of the History of Computing, 15(1):11–21, 1993. Archived at http://dl.acm.org/citation.cfm?id=612553 [18] W. Gomide and T. S. dos Reis. N´umeros transreais: Sobre a no¸c˜ao de distˆancia. Synesis - Universidade Cat´olica de Petr´opolis, 5(2):153–166, 2013. Archived at http://seer.ucp.br/seer/ index.php?journal=synesis&page=article&op=view&path%5B%5D=413&path%5B%5D=241 [19] H. T. Kung and C. E. Leiserson. Introduction to VLSI Systems, chapter Algorithms for VLSI processor arrays. Addison-Wesley, 1979. Archived at http://dl.acm.org/citation.cfm?id=578480 [20] Alberto A. Martinez. The Cult of Pythagoras: Math and Myths. University of Pittsburgh Press, 2012.

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

Search Google Scholar