Show simple item record

dc.contributor.authorJoshipura, Muktaka B.
dc.date.accessioned2022-05-27T14:38:22Z
dc.date.available2022-05-27T14:38:22Z
dc.date.created2022-05
dc.date.submittedMay 2022
dc.identifier.urihttp://hdl.handle.net/1853/66746
dc.description.abstractIn this work, we look at a distributed random-access data structure provided with a migratory-thread platform: the Lucata Pathfinder, called a chunked array. A chunked array provides sequential locality on sections of the array while having its memory distributed. We consider drawbacks of the implementation of this structure in terms of balancing the distribution of its elements. We provide an alternate implementation with better balancing, which can simplify algorithms like a distributed sort. We show analytically that our implementation balances significantly better for smaller numbers of elements, but the improvement declines proportionally to the number of elements. Finally, we test our implementation in a simulator and show that the balancing of the elements also leads to good balancing of execution.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectMigratory-thread architectures
dc.subjectDistributed algorithms
dc.subjectLoad balancing
dc.subjectPost-Moore computing
dc.titleImproving the Balance of a Random-access Data Structure on a Migratory Thread Platform
dc.typeUndergraduate Research Option Thesis
dc.description.degreeUndergraduate
dc.contributor.departmentComputer Science
thesis.degree.levelUndergraduate
dc.contributor.committeeMemberSarkar, Vivek
dc.contributor.committeeMemberYoung, Jeffrey S.
dc.date.updated2022-05-27T14:38:22Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record