Filters








132 Hits in 9.3 sec

An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem [article]

Benjamin Sach, Raphaël Clifford
<span title="2008-02-07">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we compare two different Cache-Oblivious priority queues based on the Funnel and Bucket Heap and apply them to the single source shortest path problem on graphs with positive edge weights  ...  Our results show that when RAM is limited and data is swapping to external storage, the Cache-Oblivious priority queues achieve orders of magnitude speedups over standard internal memory techniques.  ...  Acknowledgment The authors would like to thank Ashley Montanaro for helpful comments on the final draft.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0802.1026v1">arXiv:0802.1026v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/662tevtdira7to2ywjnhsgy7im">fatcat:662tevtdira7to2ywjnhsgy7im</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0802.1026/0802.1026.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0802.1026v1" 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>

Oblivious Data Structures

Xiao Shaun Wang, Kartik Nayak, Chang Liu, T-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rau5643b7ncwvh74y6p64hntle" style="color: black;">Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS &#39;14</a> </i> &nbsp;
Our oblivious counterparts of the above outperform the best known ORAM scheme both asymptotically and in practice.  ...  Specifically, we apply these techniques to a broad range of commonly used data structures, including maps, sets, priority-queues, stacks, deques; and algorithms, including a memory allocator algorithm,  ...  We would like to thank Jonathan Katz for numerous helpful discussions. We gratefully ac-  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2660267.2660314">doi:10.1145/2660267.2660314</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ccs/WangNLCSSH14.html">dblp:conf/ccs/WangNLCSSH14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ix3keelbmfcu5cdxt7mgu7w73m">fatcat:ix3keelbmfcu5cdxt7mgu7w73m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808151824/http://homes.soic.indiana.edu/yh33/mypub/ods.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/09/59/09598c6fa85bb64b22816cfaef54e682cb3f3a6a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2660267.2660314"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Survey on Priority Queues [chapter]

Gerth Stølting Brodal
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.  ...  Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and Ex-tractMin in logarithmic time.  ...  Acknowledgment The author would like to thank Rolf Fagerberg, Andy Brodnik, Jyrki Katajainen, Amr Elmasry, Jesper Asbjørn Sindahl Nielsen and the anonymous reviewers for valuable input.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40273-9_11">doi:10.1007/978-3-642-40273-9_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zocxhiyfmvdgzn2yoob25h3wr4">fatcat:zocxhiyfmvdgzn2yoob25h3wr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200322033459/https://www.cs.au.dk/~gerth/papers/ianfest13.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/30/cb/30cb8f2d7e09005f03f1b6f6502929910262b0e2.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-642-40273-9_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient, Oblivious Data Structures for MPC [chapter]

Marcel Keller, Peter Scholl
<span title="">2014</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We subsequently use our oblivious priority queue for secure computation of Dijkstra's shortest path algorithm on general graphs, where the graph structure is secret.  ...  We present oblivious implementations of several data structures for secure multiparty computation (MPC) such as arrays, dictionaries, and priority queues.  ...  Acknowledgements We would like to thank Nigel Smart for various comments and suggestions. This work has been supported in part by EPSRC via grant EP/I03126X.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-45608-8_27">doi:10.1007/978-3-662-45608-8_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b2t43jrrnfeltbmixsdzoldixa">fatcat:b2t43jrrnfeltbmixsdzoldixa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151022134637/http://eprint.iacr.org/2014/137.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/37/25/37255ea035fe0e568a4511ea9ead84857f0838d0.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-662-45608-8_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Algorithms and Data Structures [chapter]

<span title="">2009</span> <i title="WORLD SCIENTIFIC"> Practical Guide to Computer Simulations </i> &nbsp;
Memory transfers occurring between consecutive levels of the memory hierarchy in modern computers are modeled in the I/O model and cache oblivious model, and the complexity of algorithms is given by the  ...  to the number of branch mispredictions.  ...  Algorithmic problems studied In this section we give an overview of the problems studied throughout the rest of the dissertation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789812836632_0004">doi:10.1142/9789812836632_0004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5w2ix5xm35he7hv4oliyxcckzm">fatcat:5w2ix5xm35he7hv4oliyxcckzm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921232357/http://www.cs.au.dk/~gerth/advising/thesis/gabriel-moruz.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/b9/64/b9644eb8919ee5c5ec52f1c314a1948b3a4fb32d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789812836632_0004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Algorithms and Data Structures [chapter]

<span title="">2008</span> <i title="Springer Netherlands"> Robustness and Usability in Modern Design Flows </i> &nbsp;
Memory transfers occurring between consecutive levels of the memory hierarchy in modern computers are modeled in the I/O model and cache oblivious model, and the complexity of algorithms is given by the  ...  to the number of branch mispredictions.  ...  Algorithmic problems studied In this section we give an overview of the problems studied throughout the rest of the dissertation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4020-6536-1_3">doi:10.1007/978-1-4020-6536-1_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vksli6i5wjgfbfrg3ifeqxlkeu">fatcat:vksli6i5wjgfbfrg3ifeqxlkeu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921232357/http://www.cs.au.dk/~gerth/advising/thesis/gabriel-moruz.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/b9/64/b9644eb8919ee5c5ec52f1c314a1948b3a4fb32d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4020-6536-1_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Algorithms and data structures [chapter]

<span title="2015-01-28">2015</span> <i title="WORLD SCIENTIFIC"> Big Practical Guide to Computer Simulations </i> &nbsp;
Memory transfers occurring between consecutive levels of the memory hierarchy in modern computers are modeled in the I/O model and cache oblivious model, and the complexity of algorithms is given by the  ...  to the number of branch mispredictions.  ...  Algorithmic problems studied In this section we give an overview of the problems studied throughout the rest of the dissertation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789814571784_0006">doi:10.1142/9789814571784_0006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i772srdlu5eq5eeoiqqytutg34">fatcat:i772srdlu5eq5eeoiqqytutg34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921232357/http://www.cs.au.dk/~gerth/advising/thesis/gabriel-moruz.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/b9/64/b9644eb8919ee5c5ec52f1c314a1948b3a4fb32d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789814571784_0006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Multiprocessor Real-Time Locking Protocols: A Systematic Review [article]

Björn B. Brandenburg
<span title="2019-09-20">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds  ...  on maximum priority-inversion blocking, and matching asymptotically optimal locking protocols.  ...  Lortz and Shin [135] studied the choice of queue order in the MPCP and observed that assigning tasks explicit synchronization priorities (unrelated to their scheduling priorities) that reflect each task's  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1909.09600v1">arXiv:1909.09600v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tmqcpiuxfbbd5jrcecgvoeanpm">fatcat:tmqcpiuxfbbd5jrcecgvoeanpm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825005025/https://arxiv.org/pdf/1909.09600v1.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/6f/086f9077484bccda60bbbe89538a3a64e8241350.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1909.09600v1" 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>

Rein

Waleed Reda, Marco Canini, Lalith Suresh, Dejan Kostić, Sean Braithwaite
<span title="">2017</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/m52bwee6j5hgxdqcfnxtfxy5we" style="color: black;">Proceedings of the Twelfth European Conference on Computer Systems - EuroSys &#39;17</a> </i> &nbsp;
We tackle the problem of reducing tail latencies in distributed key-value stores, such as the popular Cassandra database.  ...  We first analyze a production trace of a real system and quantify the skew due to multiget sizes, key popularity, and other factors.  ...  We are grateful to Mohammad Alizadeh, Florin Ciucu, Mosharaf Chowdhury, Juan Perez, and Simon Peter for their valuable comments and suggestions on earlier drafts of this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3064176.3064209">doi:10.1145/3064176.3064209</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/eurosys/RedaCSKB17.html">dblp:conf/eurosys/RedaCSKB17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/folgp43ktbcvtfwwl3h5nzk47u">fatcat:folgp43ktbcvtfwwl3h5nzk47u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430095457/http://kth.diva-portal.org/smash/get/diva2:1085916/FULLTEXT01" 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/98/0898c1143b70eefc9abed1869b2ecee2a5a49b40.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3064176.3064209"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Back-to-Basics Empirical Study of Priority Queues [chapter]

Daniel H. Larkin, Siddhartha Sen, Robert E. Tarjan
<span title="2013-12-18">2013</span> <i title="Society for Industrial and Applied Mathematics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ka7ha6qhmfhmtbnfcmmmjao4ia" style="color: black;">2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)</a> </i> &nbsp;
We study the behavior of each structure on a variety of inputs, including artificial workloads, workloads generated by running algorithms on real map data, and workloads from a discrete event simulator  ...  We take the field back to the drawing board, with straightforward implementations of both classic and novel structures using only standard, well-known optimizations.  ...  We would like to thank Jeff Erickson for the considerable guidance he provided the first author in the initial stages of this project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611973198.7">doi:10.1137/1.9781611973198.7</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/alenex/LarkinST14.html">dblp:conf/alenex/LarkinST14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ss67rxjgpnh3djv7mnsob3dfia">fatcat:ss67rxjgpnh3djv7mnsob3dfia</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810010447/http://www.danielhlarkin.me/pdfs/alenex14-a-back-to-basics-empirical-study-of-priority-queues.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/21/bf/21bf0c2c842b19db33439178fd68f64f8e7f9ed0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611973198.7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Algorithm Engineering (Dagstuhl Seminar 13391)

Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner, Marc Herbstritt
<span title="2014-01-17">2014</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
All these topics are driven by the need for efficient algorithms and libraries for problems that appear frequently in real-world applications.  ...  From 2007 to 2013 the German Research Foundation also funded a special priority program on algorithm engineering (DFG SPP 1307).  ...  -Algorithm Engineering the work of the aggregate operator's processing steps. We provide an extensive study of the properties of the proposed aggregate operators and the new data structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.3.9.169">doi:10.4230/dagrep.3.9.169</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/GoldbergIJW13.html">dblp:journals/dagstuhl-reports/GoldbergIJW13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n75s6d7obngxbitr4rcxxadmxq">fatcat:n75s6d7obngxbitr4rcxxadmxq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123034347/https://drops.dagstuhl.de/opus/volltexte/2014/4421/pdf/dagrep_v003_i009_p169_s13391.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/a4/8e/a48e97c47d42774beba39d999373a721b265d738.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.3.9.169"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

D2.2 White-box methodologies, programming abstractions and libraries [article]

Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas
<span title="2018-02-08">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Regarding white-box methodologies, we have devised new relaxed cache-oblivious models and proposed a new power model for Myriad1 platform and an energy model for lock-free queues on CPU platforms.  ...  For Intel platforms, we have generalized the model for concurrent queues on CPU platforms to offer more flexibility according to the workers calling the data structure (parallel section sizes of enqueuers  ...  The first cache-oblivious priority queue was due to Arge et al. [5] and it supports inserts and delete-min operations in O( 1 / B log M/B N / B ) I/Os.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1801.08761v2">arXiv:1801.08761v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tl5jn2hehbbhrlof4fs5aqgmga">fatcat:tl5jn2hehbbhrlof4fs5aqgmga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909040639/https://arxiv.org/pdf/1801.08761v2.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/8f/4e/8f4edb627e95461c065fc78f2d59d85745882fa3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1801.08761v2" 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 quantitative study of irregular programs on GPUs

Martin Burtscher, Rupesh Nasre, Keshav Pingali
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hzx2m4fjg5drtbnwnip4cx2ufy" style="color: black;">2012 IEEE International Symposium on Workload Characterization (IISWC)</a> </i> &nbsp;
GPUs have been used to accelerate many regular applications and, more recently, irregular applications in which the control flow and memory access patterns are data-dependent and statically unpredictable  ...  For a suite of 13 benchmarks, we find that (i) irregularity at the warp level varies widely, (ii) control-flow irregularity and memory-access irregularity are largely independent of each other, and (iii  ...  However, many problem domains employ algorithms that build, traverse, and update irregular data structures such as trees, graphs, and priority queues.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iiswc.2012.6402918">doi:10.1109/iiswc.2012.6402918</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iiswc/BurtscherNP12.html">dblp:conf/iiswc/BurtscherNP12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7mykmlj2fjh5pdy7hryswxbnee">fatcat:7mykmlj2fjh5pdy7hryswxbnee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809093106/http://iss.ices.utexas.edu/Publications/Papers/burtscher12.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/d4/10/d410f8128bd4efa6adc886259e5d9de4cd7587bc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iiswc.2012.6402918"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Back-to-Basics Empirical Study of Priority Queues [article]

Daniel H. Larkin, Siddhartha Sen, Robert E. Tarjan
<span title="2014-03-02">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the behavior of each structure on a variety of inputs, including artificial workloads, workloads generated by running algorithms on real map data, and workloads from a discrete event simulator  ...  We take the field back to the drawing board, with straightforward implementations of both classic and novel structures using only standard, well-known optimizations.  ...  We would like to thank Jeff Erickson for the considerable guidance he provided the first author in the initial stages of this project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.0252v1">arXiv:1403.0252v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jcslwnd4rnan5f3qdp75aifvj4">fatcat:jcslwnd4rnan5f3qdp75aifvj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825115218/https://arxiv.org/pdf/1403.0252v1.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/72/4b/724bc1b05aeef9ec2f1f4e72337a87d9fd13f8e6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.0252v1" 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>

D2.1 Models for energy consumption of data structures and algorithms [article]

Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Philippas Tsigas, Anders Gidenstam, Paul Renaud-Goud, Ivan Walulya, Aras Atalar
<span title="2018-02-08">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It reports the early results of Task 2.1 on investigating and modeling the trade-off between energy and performance in concurrent data structures and algorithms, which forms the basis for the whole work  ...  The work has been conducted on the two main EXCESS platforms: (1) Intel platform with recent Intel multi-core CPUs and (2) Movidius embedded platform.  ...  Relaxed cache-oblivious model and dynamic vEB layout We define relaxed cache oblivious algorithms to be cache-oblivious (CO) algorithms with the restriction that an upper bound U B on the unknown memory  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1801.09992v2">arXiv:1801.09992v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3swp2g6mpzgvvowt7qoghlfhva">fatcat:3swp2g6mpzgvvowt7qoghlfhva</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191025103549/https://arxiv.org/pdf/1801.09992v2.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/eb/7e/eb7e954fc91eed3ad637e667bd2e668490a9f608.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1801.09992v2" 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 132 results