View Document Preview and Link Document Date: 2014-01-13 01:28:10 Open Document File Size: 300,78 KB Share Result on Facebook
City Auckland / / Company Control Data / GPU / Australian Computer Society Inc. / / Country New Zealand / / Currency pence / / Facility University of Canterbury / Computer Science University of Canterbury Christchurch / / IndustryTerm parallel computing environment / typical algorithm / graphics applications / architecture computing / parallel algorithms / mesh algorithms / sum-based sequential algorithm / possible solution / left border processors / software side / trivial solution / sequential algorithm / data mining / parallel algorithm / remote processors / mesh algorithm / / Organization Computer Science University of Canterbury Christchurch / Federal Government / Tadao Takaoka Department / Australian Computer Society / European Union / University of Canterbury / / Person Takeshi Tokuyama / Robin Candy / Tamaki / Jon Louis Bentley / Blue Fern / Sung Eun Bae / Tadao Takaoka / / Position Acknowledgment The author / / ProgrammingLanguage C / / PublishedMedium Communications of the ACM / / Technology 2 This algorithm / 16 processors / Sequential algorithm / sum-based sequential algorithm / mesh algorithms / one processor / 4096 processors / 3-D / 4 Algorithm / sixteen processors / Information Technology / 100 processors / Sequential and Parallel Algorithms / VLSI Algorithm / 1 Algorithm / parallel algorithm / data mining / two parallel algorithms / mesh algorithm / simulation / BPS/CGM Algorithms / typical algorithm / 3 Parallel algorithm Algorithm / 5 Algorithm / left border processors / / SocialTag 
Proceedings of the Twelfth Australasian Symposium on Parallel and Distributed Computing (AusPDC 2014), Auckland, New Zealand Efficient Parallel Algorithms for the Maximum Subarray Problem ∗