Skip Navigation

The Computer Journal 1993 36(3):238-245; doi:10.1093/comjnl/36.3.238
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hains, G.
Right arrow Articles by Mullin, L. M. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Parallel Functional Programming with Arrays

G. Hains1 * and L. M. R. Mullin2 §

1 Universite de Montreal, Infomatiques et Recherche Operationnelle, case postale 6128, succarsale A, Montreal, Quebec, Canada H3C 3J7, 2 Computer Science, University of Missouri at Rolla, Rolla, MO 64501, USA

We present an equational formalization of arrays for data-parallel functional programming. Non-nested arrays simplify the mapping problem to regular architecture, avoid nested list representations and prevent the occurrence of an explosive number of algebraic laws. The MOA formalism describes arrays in a dimension-independent algebra. A new style of functional programming is described with MOA operators, allowing recursive equations to describe the meaning as well as the structure of algorithms for mesh- or hypercube-connected multiprocessors.


* Université de Montréal, Infomatiques et Recherche Opérationnelle, case postale 6128, succursale A, Montréal, Québec, Canada H3C 3J7

§ Computer Science, University of Missouri at Rolla, Rolla, MO 64501, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.