Close category search window
 

Mapping parallel algorithms onto general-purpose parallel machines

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
$31 $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

1 Author(s)
Chen, M.C. ; Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA

The mapping of very-high-level problem specifications to general-purpose parallel machines is addressed. The objective is to illustrate how such mappings can be successfully achieved by the implementation of a very-high-level, architecture-independent programming language. At the foundation, a macro-parallel abstract machine is devised and combined with a substitution model of functional languages. Features such as data parallelism, functional composition, abstraction, and recursion, give the full power of parallel algorithm specification. These are unified and supported in a single language known as Crystal. A procedure for programming languages, called hyper-stack, is devised for calls to parallel modules.<>

Published in:
System Sciences, 1988. Vol.I. Architecture Track, Proceedings of the Twenty-First Annual Hawaii International Conference on  (Volume:1 )

Date of Conference: 0-0 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.