2532

Space and the Synchronic A-Ram

Alex V Berka
Isynchronise Ltd.
arXiv:1008.1673 [cs.CL] (28 Aug 2010)

@article{2010arXiv1008.1673B,

   author={Berka}, A.~V},

   title={“{Space and the Synchronic A-Ram}”},

   journal={ArXiv e-prints},

   archivePrefix={“arXiv”},

   eprint={1008.1673},

   primaryClass={“cs.CL”},

   keywords={Computer Science – Computation and Language, Computer Science – Programming Languages},

   year={2010},

   month={aug},

   adsurl={http://adsabs.harvard.edu/abs/2010arXiv1008.1673B},

   adsnote={Provided by the SAO/NASA Astrophysics Data System}

}

Download Download (PDF)   View View   Source Source   

677

views

Space is a circuit oriented, spatial programming language designed to exploit the massive parallelism available in a novel formal model of computation called the Synchronic A-Ram, and physically related FPGA and reconfigurable architectures. Space expresses variable grained MIMD parallelism, is modular, strictly typed, and deterministic. Barring operations associated with memory allocation and compilation, modules cannot access global variables, and are referentially transparent. At a high level of abstraction, modules exhibit a small, sequential state transition system, aiding verification. Space deals with communication, scheduling, and resource contention issues in parallel computing, by resolving them explicitly in an incremental manner, module by module, whilst ascending the ladder of abstraction. Whilst the Synchronic A-Ram model was inspired by linguistic considerations, it is also put forward as a formal model for reconfigurable digital circuits. A programming environment has been developed, that incorporates a simulator and compiler that transform Space programs into Synchronic A-Ram machine code, consisting of only three bit-level instructions, and a marking instruction. Space and the Synchronic A-Ram point to novel routes out of the parallel computing crisis.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: