Title:
Refining the Parallel Prefix Sum Algorithm
Authors:
Heyder, Ernie
Publisher:
Denison University
DATE ISSUED:
19-Nov-2011
PERMANENT LINK:
http://hdl.handle.net/2374.DEN/3573; http://hdl.handle.net/2374
Type:
Article
Language:
en_US
Description:
This paper focuses on the prefix sum algorithm. The goal of the paper is to develop a parallel prefix sum algorithm that is faster than the sequential algorithm. Takes parts of an algorithm created by Dan Grossman [1] and combined them with a new step in the algorithm that was developed by the author to create a different approach to solving the prefix sum algorithm. There are concurrency problems that can occur when trying to write this algorithm. The solution to these problems will be given as they appear, along with a new algorithm developed by the author.
Appears in Collections:
Proceedings: 2011 Midstates Conference for Undergraduate Research in Computer Science and Mathematics

Full metadata record

DC FieldValue Language
dc.contributor.authorHeyder, Ernieen
dc.coverage.spatialUSA - Ohio - Licking - Granvilleen_US
dc.date.accessioned2012-08-03T20:19:54Zen
dc.date.accessioned2013-12-18T22:13:18Z-
dc.date.available2012-08-03T20:19:54Zen
dc.date.available2013-12-18T22:13:18Z-
dc.date.created2011-11-19en
dc.date.issued2011-11-19en
dc.identifier.urihttp://hdl.handle.net/2374.DEN/3573en
dc.identifier.urihttp://hdl.handle.net/2374-
dc.descriptionThis paper focuses on the prefix sum algorithm. The goal of the paper is to develop a parallel prefix sum algorithm that is faster than the sequential algorithm. Takes parts of an algorithm created by Dan Grossman [1] and combined them with a new step in the algorithm that was developed by the author to create a different approach to solving the prefix sum algorithm. There are concurrency problems that can occur when trying to write this algorithm. The solution to these problems will be given as they appear, along with a new algorithm developed by the author.en_US
dc.language.isoen_USen_US
dc.publisherDenison Universityen_US
dc.relation.ispartofProceedings of the 2011 Midstates Conference on Undergraduate Research in Computer Science and Mathematicsen_US
dc.titleRefining the Parallel Prefix Sum Algorithmen_US
dc.typeArticleen_US
dc.contributor.institutionDenison Universityen_US
dc.contributor.repositoryDenison DRCen_US
dc.publisher.digitalDenison Universityen_US
All Items in The Five Colleges of Ohio Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.