By Topic

Implementing higher-order Gamma on MasPar: a case study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kam Wing Ng ; Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; Lin Peng Huang ; Yong Qiang Sun

Gamma is a kernel programming language with an elegant chemical reaction metaphor in which programs are described in terms of multiset rewriting. The Gamma formalism allows one to describe an algorithm without introducing artificial sequentiality and leads to the derivation of a parallel solution to a given problem naturally. However, the difficulty of incorporating control strategies makes Gamma not only hard for one to define any sophisticated approaches but also impossible to reach a decent level of efficiency in any direct implementation. Recently, a higher-order multiset programming paradigm, named higher-order Gamma, is introduced by Metayer to alleviate these problems. In this paper, we investigate the possibility of implementing higher-order Gamma on MasPar, a massively data parallel computer. The results show that a program written in higher-order Gamma can be transformed naturally towards an efficient implementation on a real parallel machine

Published in:

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Date of Conference:

15-17 Mar 1995