Matches in SemOpenAlex for { <https://semopenalex.org/work/W2754073485> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W2754073485 abstract "General Purpose GPUs (GPGPUs) are ideal platforms for parallel execution of applications with regular shared memory access patterns. However, majority of real world multithreaded applications require access to shared memory with irregular patterns. The Minimum Spanning Forest (MSF) calculation arises in many real world applications. The Boruvka's algorithm for calculating MSF has the most expressed parallelism; however, it is a challenging irregular algorithm to implement on GPUs. In this paper we show that a transaction- based design and implementation of the Boruvka's algorithm on GPU can handle some of the challenges arising due to irregularity. First, we identify the hotspots of the algorithm that are the main bottlenecks: edge discovery and merge. The edge discovery phase is implemented using lock-free synchronizations after extracting certain algebraic properties (e.g. monotonicity) of the computation. The merge phase, however, lacks such algebraic properties and hence we utilize a Software Transactional Memory (STM) based synchronization method. STM offers ease of use by guaranteeing deadlock/livelock-free behavior as opposed to blocking lock-based synchronization. It also increases programmability by providing high level abstractions for synchronization which facilitate a natural transition from algorithm design to implementation. In addition, we employ several optimization techniques in different phases of the algorithm to achieve load balance and enhanced GPU resource utilization. Experimental results show that our GPU-based implementation outperforms both the fastest sequential implementation and the existing STM-based implementation on multicore CPUs when tested on large-scale graphs with diverse densities." @default.
- W2754073485 created "2017-09-25" @default.
- W2754073485 creator A5016385511 @default.
- W2754073485 creator A5019941337 @default.
- W2754073485 creator A5077317227 @default.
- W2754073485 date "2017-07-01" @default.
- W2754073485 modified "2023-09-26" @default.
- W2754073485 title "An Efficient Transaction-Based GPU Implementation of Minimum Spanning Forest Algorithm" @default.
- W2754073485 cites W1572663059 @default.
- W2754073485 cites W1715366078 @default.
- W2754073485 cites W1974165977 @default.
- W2754073485 cites W2007000019 @default.
- W2754073485 cites W2029601347 @default.
- W2754073485 cites W2092911542 @default.
- W2754073485 cites W2094722168 @default.
- W2754073485 cites W2098903349 @default.
- W2754073485 cites W2109343068 @default.
- W2754073485 cites W2117689653 @default.
- W2754073485 cites W2142861627 @default.
- W2754073485 cites W2165695512 @default.
- W2754073485 cites W2227386419 @default.
- W2754073485 cites W2295258302 @default.
- W2754073485 cites W2545744347 @default.
- W2754073485 cites W2611473431 @default.
- W2754073485 cites W2189046346 @default.
- W2754073485 doi "https://doi.org/10.1109/hpcs.2017.100" @default.
- W2754073485 hasPublicationYear "2017" @default.
- W2754073485 type Work @default.
- W2754073485 sameAs 2754073485 @default.
- W2754073485 citedByCount "2" @default.
- W2754073485 countsByYear W27540734852018 @default.
- W2754073485 crossrefType "proceedings-article" @default.
- W2754073485 hasAuthorship W2754073485A5016385511 @default.
- W2754073485 hasAuthorship W2754073485A5019941337 @default.
- W2754073485 hasAuthorship W2754073485A5077317227 @default.
- W2754073485 hasConcept C111919701 @default.
- W2754073485 hasConcept C11413529 @default.
- W2754073485 hasConcept C120314980 @default.
- W2754073485 hasConcept C138101251 @default.
- W2754073485 hasConcept C173608175 @default.
- W2754073485 hasConcept C41008148 @default.
- W2754073485 hasConcept C41138395 @default.
- W2754073485 hasConcept C48044578 @default.
- W2754073485 hasConceptScore W2754073485C111919701 @default.
- W2754073485 hasConceptScore W2754073485C11413529 @default.
- W2754073485 hasConceptScore W2754073485C120314980 @default.
- W2754073485 hasConceptScore W2754073485C138101251 @default.
- W2754073485 hasConceptScore W2754073485C173608175 @default.
- W2754073485 hasConceptScore W2754073485C41008148 @default.
- W2754073485 hasConceptScore W2754073485C41138395 @default.
- W2754073485 hasConceptScore W2754073485C48044578 @default.
- W2754073485 hasLocation W27540734851 @default.
- W2754073485 hasOpenAccess W2754073485 @default.
- W2754073485 hasPrimaryLocation W27540734851 @default.
- W2754073485 hasRelatedWork W1593699653 @default.
- W2754073485 hasRelatedWork W2161683099 @default.
- W2754073485 hasRelatedWork W2279367517 @default.
- W2754073485 hasRelatedWork W2408916298 @default.
- W2754073485 hasRelatedWork W2555260650 @default.
- W2754073485 hasRelatedWork W2732235760 @default.
- W2754073485 hasRelatedWork W2779529577 @default.
- W2754073485 hasRelatedWork W2853983498 @default.
- W2754073485 hasRelatedWork W2899048350 @default.
- W2754073485 hasRelatedWork W2901070955 @default.
- W2754073485 hasRelatedWork W2908658591 @default.
- W2754073485 hasRelatedWork W2935018035 @default.
- W2754073485 hasRelatedWork W2980681317 @default.
- W2754073485 hasRelatedWork W3010339111 @default.
- W2754073485 hasRelatedWork W3012479151 @default.
- W2754073485 hasRelatedWork W3132454468 @default.
- W2754073485 hasRelatedWork W3188917597 @default.
- W2754073485 hasRelatedWork W3196353812 @default.
- W2754073485 hasRelatedWork W2590204734 @default.
- W2754073485 hasRelatedWork W3095216560 @default.
- W2754073485 isParatext "false" @default.
- W2754073485 isRetracted "false" @default.
- W2754073485 magId "2754073485" @default.
- W2754073485 workType "article" @default.