Interlanguages and synchronic models of computation - Computer Science > Programming LanguagesReportar como inadecuado

Interlanguages and synchronic models of computation - Computer Science > Programming Languages - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: A novel language system has given rise to promising alternatives to standardformal and processor network models of computation. An interstring linked witha abstract machine environment, shares sub-expressions, transfers data, andspatially allocates resources for the parallel evaluation of dataflow. Formalmodels called the a-Ram family are introduced, designed to support interstringprogramming languages interlanguages. Distinct from dataflow, graphrewriting, and FPGA models, a-Ram instructions are bit level and execute insitu. They support sequential and parallel languages without the space-timeoverheads associated with the Turing Machine and l-calculus, enabling massiveprograms to be simulated. The devices of one a-Ram model, called the SynchronicA-Ram, are fully connected and simpler than FPGA LUT-s. A compiler for aninterlanguage called Space, has been developed for the Synchronic A-Ram. Spaceis MIMD. strictly typed, and deterministic. Barring memory allocation andcompilation, modules are referentially transparent. At a high level ofabstraction, modules exhibit a state transition system, aiding verification.Data structures and parallel iteration are straightforward to implement, andallocations of sub-processes and data transfers to resources are implicit.Space points towards highly connected architectures called Synchronic Engines,that scale in a GALS manner. Synchronic Engines are more general purpose thansystolic arrays and GPUs, and bypass programmability and conflict issuesassociated with multicores.

Autor: Alexander Victor Berka


Documentos relacionados