A new array operation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

A new monolithic array operation has been proposed. The operation is similar to earlier proposals, except that it uses the fold operation to combine multiple values with the same index. The new operation conveniently handles certain important kinds of computation, such as histogram, and provides parallelism in a convenient way.

This method solves the important problem of calculating histograms in a fashion suitable for parallel computation. I-structures, devised by Arvind and his colleagues, sacrifice referential transparency in order to increase the opportunities for parallelism, but do not provide a good solution to the histogram problem. I am grateful to Arvind for pointing out this defect of I-structures, which in turn inspired this paper.

Although the method presented here is useful for an important class of problems, it is not the best solution for all problems involving arrays. Further experience is needed to assess its advantages and shortcomings.
Original languageEnglish
Title of host publicationGraph Reduction
Subtitle of host publicationProceedings of a Workshop Santa Fé, New Mexico, USA September 29–October 1, 1986
EditorsJoseph Fasel, Robert Keller
Place of PublicationBerlin, Heidelberg
PublisherSpringer-Verlag GmbH
Pages328-335
Number of pages8
ISBN (Electronic)978-3-540-47963-5
ISBN (Print)978-3-540-18420-1
DOIs
Publication statusPublished - 1987

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
Volume279
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A new array operation'. Together they form a unique fingerprint.

Cite this