Filters








188,160 Hits in 7.1 sec

A GPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks [article]

Rui Fan, Ke Xu, Jichang Zhao
<span title="2017-01-21">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Though several parallel algorithms have been presented to reduce its calculation cost on unweighted networks, a fast solution for weighted networks, which are in fact more ubiquitous than unweighted ones  ...  In this study, we develop an efficient parallel GPU-based approach to boost the calculation of betweenness centrality on very large and weighted networks.  ...  The combination algorithm achieves 2.65× speedup over the baseline node-parallel strategy on average.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1701.05975v1">arXiv:1701.05975v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/suaoqmxdorgz5k3qu2fudkb34u">fatcat:suaoqmxdorgz5k3qu2fudkb34u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826030159/https://arxiv.org/pdf/1701.05975v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/bc/25bc794fab67214ae6020858722481d5c1749ecb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1701.05975v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A Reconfigurable Computing Approach for Efficient and Scalable Parallel Graph Exploration

Brahim Betkaoui, Yu Wang, David B. Thomas, Wayne Luk
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ptmvyhrbafhqnmbrztao3lkuvy" style="color: black;">2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors</a> </i> &nbsp;
Graph exploration algorithms, such as breadth-first search (BFS), are largely dominated by memory latency and are challenging to process efficiently.  ...  Using graph data based on the power-law graphs found in real-word problems, we are able to achieve performance results that are superior to those of high performance multi-core systems in the recent literature  ...  For large uniformly random graphs, we observe that our design not only scales well on one FPGA device giving an efficiency of 92.5-95.5%, but also on multiple FPGA devices as we are able to reach efficiency  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/asap.2012.30">doi:10.1109/asap.2012.30</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/asap/BetkaouiWTL12.html">dblp:conf/asap/BetkaouiWTL12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/masycdtex5g6jgo3drv74aswta">fatcat:masycdtex5g6jgo3drv74aswta</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130107235324/http://www.cse.wustl.edu/~roger/565M.f12/2012_betkaoui_asap.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/a5/d5a5421345092671ab113f742ba9794e77b9e29d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/asap.2012.30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks

Rui Fan, Ke Xu, Jichang Zhao
<span title="2017-12-04">2017</span> <i title="PeerJ"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zs2czkfyybggbpvr26rbyxpsjy" style="color: black;">PeerJ Computer Science</a> </i> &nbsp;
Although several parallel algorithms have been presented to reduce its calculation cost for unweighted networks, a fast solution for weighted networks, which are commonly encountered in many realistic  ...  Experiments on both realistic and synthetic networks demonstrate the efficiency of our solution, which achieves 2.9× to 8.44× speedups over the parallel CPU implementation.  ...  We developed a parallel CPU algorithm based on graph-tool (https://graph-tool.skewed.de), which is an efficient network analysis tool whose core data and algorithms are implemented in C++, making it efficient  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7717/peerj-cs.140">doi:10.7717/peerj-cs.140</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pnwzap6dsbcjphb4bwent7hcsi">fatcat:pnwzap6dsbcjphb4bwent7hcsi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723053954/https://peerj.com/articles/cs-140.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/ec/ecec028c7a5f21c791b518adbd33b05e9291ac60.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7717/peerj-cs.140"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Efficient and High-quality Sparse Graph Coloring on the GPU [article]

Xuhao Chen, Pingfan Li, Canqun Yang
<span title="2016-06-20">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a work-efficient parallel graph coloring implementation on GPUs with good coloring quality.  ...  Graph coloring has been broadly used to discover concurrency in parallel computing. To speedup graph coloring for large-scale datasets, parallel algorithms have been proposed to leverage modern GPUs.  ...  are typical irregular algorithms [25] that are considered to be difficult to parallelize on GPUs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.06025v1">arXiv:1606.06025v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w7shcvlayrf3rl236ewj6253vi">fatcat:w7shcvlayrf3rl236ewj6253vi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200830225400/https://arxiv.org/pdf/1606.06025v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/08/25/0825f6eee11759e206c1676f05aa7fc70b429ee5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.06025v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

BNP TASK SCHEDULING ALGORITHMS FOR PERFORMANCE EVALUATION IN PARALLEL SYSTEM

Akanksha Garg, Navdeep S.Sethi, Nidhi Arora, Amit Makkar
<span title="2013-08-30">2013</span> <i title="CIRWOLRD"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jh2yw2w72rbdreebtgswzt7fkq" style="color: black;">INTERNATIONAL JOURNAL OF COMPUTERS &amp; TECHNOLOGY</a> </i> &nbsp;
Multiprocessor Scheduling using Directed Acyclic Graph (DAG) is used in this research. An important implication of minimization of schedule length is that the system throughput is maximized.  ...  In this research, three BNP Scheduling Algorithms are considered namely HLFET Algorithm, MCP Algorithm and ETF Algorithm to calculate effective output by comparing the algorithms with eight test case scenarios  ...  BNP class of algorithms (Hagras and Janeek, 2003) is discussed below that are under consideration: HLFET Algorithm It is one of the simplest algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24297/ijct.v12i8.3014">doi:10.24297/ijct.v12i8.3014</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yxtifqqg6bf5ddfxtr7jvjfkbi">fatcat:yxtifqqg6bf5ddfxtr7jvjfkbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720043556/https://cirworld.com/index.php/ijct/article/download/3014/pdf_387" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/07/9307eadaa4063df17a1746cc2d40a7d172c14ae5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24297/ijct.v12i8.3014"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Scalable Flow-Based Community Detection for Large-Scale Network Analysis

Seung-Hee Bae, Daniel Halperin, Jevin West, Martin Rosvall, Bill Howe
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gckg3mzs4fhxhbrvmbsa54bccm" style="color: black;">2013 IEEE 13th International Conference on Data Mining Workshops</a> </i> &nbsp;
We evaluate our approach on a variety of real graph datasets as well as synthetic graphs produced by a popular graph generator used for benchmarking community detection algorithms.  ...  This algorithm relaxes concurrency assumptions to avoid lock overhead, achieving 70% parallel efficiency in shared-memory multicore experiments while exhibiting similar convergence properties and finding  ...  We would like to thank Andrea Lancichinetti for assistance with the synthetic graph generator. The authors would also like to thank the anonymous reviewers for their insightful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdmw.2013.138">doi:10.1109/icdmw.2013.138</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icdm/BaeHWRH13.html">dblp:conf/icdm/BaeHWRH13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/htkxszowavhq7o5oqtftodb77y">fatcat:htkxszowavhq7o5oqtftodb77y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922051131/http://www.halper.in/pubs/bae_2013_damnet_relaxmap.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fd/ed/fded85acc0477528f5f5a607708bbd584fa4c92a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdmw.2013.138"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 6684 of Mathematical Reviews Vol. , Issue 94k [page]

<span title="">1994</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
It is shown here that a CSP with this type of constraint relations (and no restrictions on its graph) can be solved by an efficient (i.e., with polynomial time complexity) sequential algorithm.  ...  (English summary) Parallel Process. Lett. 3 (1993), no. 1, 13-18. Summary: “We present an efficient algorithm for computing the matching polynomial of a series-parallel graph in O(n”) time.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-11_94k/page/6684" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1994-11_94k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Adaptive Work-Efficient Connected Components on the GPU [article]

Michael Sutton, Tal Ben-Nun, Amnon Barak, Sreepathi Pai, Keshav Pingali
<span title="2016-12-04">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This report presents an adaptive work-efficient approach for implementing the Connected Components algorithm on GPUs.  ...  We demonstrate that the algorithm is highly efficient on a wide variety of graph types. II.  ...  [3] implemented a parallel GPU variant of Hook-Shortcut, showing that GPUs are beneficial for CC computation despite the inherent irregularity of the algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1612.01178v1">arXiv:1612.01178v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/57gunbl3wnhdfimatvkip2ue64">fatcat:57gunbl3wnhdfimatvkip2ue64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200906023936/https://arxiv.org/pdf/1612.01178v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/0a/530a24fba4029c83b6b5c84d1565750114fa85a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1612.01178v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Power-efficient and highly scalable parallel graph sampling using FPGAs

Usman Tariq, Umer I. Cheema, Fahad Saeed
<span title="">2017</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ek7djgoan5ehpihkol2k4a7rm4" style="color: black;">2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</a> </i> &nbsp;
Our experiments show that our proposed techniques are 2x faster and 3x more energy efficient as compared to serial CPU version of the algorithm.  ...  Our strategy utilizes a novel graph data structure, that we call COPRA that allows timeand memory-efficient representation of graphs suitable for reconfigurable hardware such as FPGAs.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/reconfig.2017.8279806">doi:10.1109/reconfig.2017.8279806</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/reconfig/TariqCS17.html">dblp:conf/reconfig/TariqCS17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xyepjxidiza2lmulmwwhr2jwbu">fatcat:xyepjxidiza2lmulmwwhr2jwbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430145929/https://scholarworks.wmich.edu/cgi/viewcontent.cgi?article=1012&amp;context=pcds_reports" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9d/b0/9db0af9b08dc490458436fb90eb0bf893c08e70c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/reconfig.2017.8279806"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Exploitation of locality for energy efficiency for breadth first search in fine-grain execution models

Chen Chen, Souad Koliai, Guang Gao
<span title="">2013</span> <i title="Tsinghua University Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w77vm44enzh4tgk44gtrsw7f64" style="color: black;">Tsinghua Science and Technology</a> </i> &nbsp;
The Codelet Model more efficiently exploits data locality than the OpenMP-like execution models which traditionally focus on coarse-grain parallelism inside loops.  ...  The results show that this BFS algorithm saves up to 7% of the dynamic energy for memory accesses compared to a BFS implementation based on OpenMP loop scheduling.  ...  Test Results Tests were conducted to study the energy efficiency of the BFS algorithm on a many-core architecture that has both on-chip local storage and on-chip shared memory.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tst.2013.6678909">doi:10.1109/tst.2013.6678909</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tklfqob7fncnvol5ayzm3josdm">fatcat:tklfqob7fncnvol5ayzm3josdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150918172421/http://www.capsl.udel.edu/pub/doc/papers/tst2013-june.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5f/53/5f53a947602301764b7faa5b081533dbbd14c657.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tst.2013.6678909"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs [article]

Laxman Dhulipala, Charlie McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun
<span title="2020-05-29">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental  ...  In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount  ...  A Memory-Efficient Parallel Graph Traversal In this section, we provide additional details on Sage's memory-efficient parallel graph traversal algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.12310v2">arXiv:1910.12310v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kba4cfosrzgcbf3e2zzatvim7i">fatcat:kba4cfosrzgcbf3e2zzatvim7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200602134227/https://arxiv.org/pdf/1910.12310v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.12310v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficient Shortest Paths on Massive Social Graphs

Xiaohan Zhao, Alessandra Sala, Haitao Zheng, Ben Zhao
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pzyiigk6mnbcfmpdtfilb6u2hu" style="color: black;">Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing</a> </i> &nbsp;
We show that a hyperbolic embedding produces relatively low distortion error, and propose Rigel, a hyperbolic graph coordinate system that lends itself to efficient parallelization across a compute cluster  ...  Most of these applications rely on computing distances between node pairs, which for large graphs can take minutes to compute using traditional algorithms such as breadth-first-search (BFS).  ...  We also verify that Parallel Rigel performs similar to the original Rigel on these graphs. Computation Efficiency.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4108/icst.collaboratecom.2011.247162">doi:10.4108/icst.collaboratecom.2011.247162</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/colcom/ZhaoSZZ11.html">dblp:conf/colcom/ZhaoSZZ11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dubtj74tlrg5vd74joazcawr4m">fatcat:dubtj74tlrg5vd74joazcawr4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429041447/https://eudl.eu/pdf/10.4108/icst.collaboratecom.2011.247162" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/80/a3/80a32df5e0408ac58de9595b8c6c5a8f7db7ebf8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4108/icst.collaboratecom.2011.247162"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Real-World Clustering for Task Graphs on Shared Memory Systems [chapter]

Alexander Herz, Chris Pinkau
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Finally, we present the first clustering algorithm which guarantees a real-world speedup by clustering all parallel tasks in the task graph that cannot be efficiently executed in parallel.  ...  Our results are confirmed by applying our algorithm to a large set of randomly generated benchmark task graphs.  ...  Averages were calculated for average task sizes bigger 1000 clocks so that they are not biased from the values for on average small task sizes where our algorithm outperforms the classical algorithm by  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-15789-4_2">doi:10.1007/978-3-319-15789-4_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/py3p7purt5dldf3qpo27aitteq">fatcat:py3p7purt5dldf3qpo27aitteq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812161516/http://www.springer.com/cda/content/document/cda_downloaddocument/9783319157887-c2.pdf?SGWID=0-0-45-1494416-p177262422" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/75/6575335eff68d0a90c41b42d2a9531b52c195444.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-15789-4_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Work efficient parallel algorithms for large graph exploration

Dip Sankar Banerjee, Shashank Sharma, Kishore Kothapalli
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zwrt4lmoffgrpejt4mmp2p34kq" style="color: black;">20th Annual International Conference on High Performance Computing</a> </i> &nbsp;
At the same time, these graphs are also getting very sparse in nature. This calls for particular work efficient solutions aimed at processing large, sparse graphs on modern parallel architectures.  ...  On this platform, we achieve an average of 35% improvement compared to state-ofthe-art solutions. Such an improvement has the potential to speed up other applications that rely on these algorithms.  ...  In light of the above paragraph, we envisage that new algorithms and implementation strategies are required for efficient processing of current generation graphs on modern multicore architectures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hipc.2013.6799125">doi:10.1109/hipc.2013.6799125</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hipc/BanerjeeSK13.html">dblp:conf/hipc/BanerjeeSK13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vwvt53aa35h77lwg23eehfi6xi">fatcat:vwvt53aa35h77lwg23eehfi6xi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829081632/http://cstar.iiit.ac.in/~kkishore/Upload.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fc/56/fc56a71db726f92af4d4ffe9ef5f452b6ad66b47.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hipc.2013.6799125"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An Efficient Graph Accelerator with Parallel Data Conflict Management [article]

Pengcheng Yao
<span title="2018-06-03">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our implementation on Xilinx Virtex UltraScale+ XCVU9P with a wide variety of typical graph algorithms shows that our accelerator achieves an average throughput by 2.36 GTEPS as well as up to 3.14x performance  ...  In this paper, we have the insight that the atomic operations for the vertex updating of many graph algorithms (e.g., BFS, PageRank and WCC) are typically incremental and simplex.  ...  Experimental results with three graph algorithms on six real-world graphs show that our accelerator provides 2.36 GTEPS on average, outperforming ForeGraph by up to 3.14x speedup.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.00751v1">arXiv:1806.00751v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yay4otkc5fci5aa4y5kltaytdq">fatcat:yay4otkc5fci5aa4y5kltaytdq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200903051211/https://arxiv.org/pdf/1806.00751v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/90/35/9035a380a2b83774e64a855d891d2a11856ddc59.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.00751v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 188,160 results