Computing Gamma Calculus on Computer Cluster

Computing Gamma Calculus on Computer Cluster

Hong Lin (University of Houston-Downtown, USA), Jeremy Kemp (University of Houston-Downtown, USA) and Padraic Gilbert (University of Houston-Downtown, USA)
DOI: 10.4018/978-1-61350-456-7.ch813
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.
Chapter Preview
Top

Γ-Calculus

The basic term of a Gamma program is molecules (or γ-expressions), which can be simple data or programs (γ-abstractions). The execution of the Gamma program can be seen as the evolution of a solution of molecules, which react until the solution becomes inert. Molecules are recursively defined as constants, γ-abstractions, multisets or solution of molecules. The following is their syntax:

M::= 0 | 1 | … | ‘a’ | ‘b’ | … ; constants| γP[C].M ; γ-abstraction| M1, M2 ; multiset| <M> ; solution

Complete Chapter List

Search this Book:
Reset