Filters








5,764 Hits in 7.3 sec

The computability of relaxed data structures: queues and stacks as examples

Nir Shavit, Gadi Taubenfeld
<span title="2016-04-26">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
We define infinitely many possible relaxations of several traditional data structures: queues, stacks and multisets, and examine their relative computational power.  ...  However, in various cases it makes sense to relax the semantics of traditional concurrent data structures in order to get simpler and possibly more efficient and scalable implementations.  ...  Acknowledgements: Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, and the Department of Energy under grant ER26116/DE-SC0008923  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-016-0272-0">doi:10.1007/s00446-016-0272-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x7ykkyubjraorobgnaa3rzxsmu">fatcat:x7ykkyubjraorobgnaa3rzxsmu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171210010242/http://www.faculty.idc.ac.il:80/gadi/MyPapers/2015ST-RelaxedDataStructures.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/7e/a1/7ea1f052e70de173180c120a8161c01f24a078f2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-016-0272-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Quantitative relaxation of concurrent data structures

Thomas A. Henzinger, Christoph M. Kirsch, Hannes Payer, Ali Sezgin, Ana Sokolova
<span title="2013-01-23">2013</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic  ...  As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances.  ...  Ana Sokolova wishes to thank Dexter Kozen and in particular Joel Ouaknine: had they not saved her life, she would have missed a lot of the fun involved in working on this paper and seeing it finished.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2480359.2429109">doi:10.1145/2480359.2429109</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r6og3cvdknhqzasyjrdm7y647u">fatcat:r6og3cvdknhqzasyjrdm7y647u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808034843/http://cs.uni-salzburg.at/~anas/papers/popl2013.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/65/5a/655abf918e5ebc49bec229ecc29d4e7dda512698.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2480359.2429109"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Quantitative relaxation of concurrent data structures

Thomas A. Henzinger, Christoph M. Kirsch, Hannes Payer, Ali Sezgin, Ana Sokolova
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL &#39;13</a> </i> &nbsp;
We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic  ...  As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances.  ...  Ana Sokolova wishes to thank Dexter Kozen and in particular Joel Ouaknine: had they not saved her life, she would have missed a lot of the fun involved in working on this paper and seeing it finished.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2429069.2429109">doi:10.1145/2429069.2429109</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/HenzingerKPSS13.html">dblp:conf/popl/HenzingerKPSS13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ywchfczklffy3h2ospbhzl3sza">fatcat:ywchfczklffy3h2ospbhzl3sza</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808034843/http://cs.uni-salzburg.at/~anas/papers/popl2013.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/65/5a/655abf918e5ebc49bec229ecc29d4e7dda512698.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2429069.2429109"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Round-up: Runtime checking quasi linearizability of concurrent data structures

Lu Zhang, Arijit Chattopadhyay, Chao Wang
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hj24pr6lvba3dfi5muhp4mz5tm" style="color: black;">2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)</a> </i> &nbsp;
We propose a new method for runtime checking of a relaxed consistency property called quasi linearizability for concurrent data structures.  ...  Quasi linearizability generalizes the standard notion of linearizability by intentionally introducing nondeterminism into the parallel computations and exploiting such nondeterminism to improve the performance  ...  ACKNOWLEDGMENT The authors would like to thank Christoph Kirsch and Michael Lippautz of University of Salzburg for making the Scal benchmarks available and for promptly answering our questions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2013.6693061">doi:10.1109/ase.2013.6693061</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kbse/ZhangCW13.html">dblp:conf/kbse/ZhangCW13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3l4qqb534nhnbdh7akor45y7nq">fatcat:3l4qqb534nhnbdh7akor45y7nq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170627112608/http://www-bcf.usc.edu/~wang626/pubDOC/Zhang13RoundUp.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/56/e7/56e72541d9f48afdc9b6c6ffe77f8860136e4254.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2013.6693061"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Teaching data structure design patterns

Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia
<span title="">1998</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/42mrbbmjbfdtbbepad2fzixmum" style="color: black;">Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education - SIGCSE &#39;98</a> </i> &nbsp;
in addition to the theory of data structures.  ...  In this paper we present an approach for teaching the Freshman-Sophomore introduction to data structures course (CS2) in a way that provides an introduction to object-oriented software engineering patterns  ...  Some examples of positions are nodes in such data structures as sequences and trees.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/273133.274324">doi:10.1145/273133.274324</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigcse/GelfandGT98.html">dblp:conf/sigcse/GelfandGT98</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6snoy4yetvad5n5uglbp3nqfja">fatcat:6snoy4yetvad5n5uglbp3nqfja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061006010724/http://www.cs.brown.edu:80/cgc/jdsl/papers/patterns.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/70/c3/70c394962be8e3edb418abe5926b04dd05924f3d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/273133.274324"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework

Adones Rukundo, Aras Atalar, Philippas Tsigas, Michael Wagner
<span title="2019-10-11">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2pcluxp32rfojgwekdrryxoaqu" style="color: black;">International Symposium on Distributed Computing</a> </i> &nbsp;
We show how our framework can instantiate lock-free out-of-order queues, stacks, counters and dequeues.  ...  ACM Subject Classification Theory of computationData structures design and analysis; Theory of computation → Design and analysis of algorithms; Theory of computation → Concurrency; Theory of computation  ...  Such data structures include; stacks, FIFO queues, counters and dequeues. The 2D framework uses multiple copies (sub-structures) of the given data structure as depicted in Figure 1 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.31">doi:10.4230/lipics.disc.2019.31</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wdag/RukundoAT19.html">dblp:conf/wdag/RukundoAT19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kpi5zmzvczcsbcsh5rwzkkqw2q">fatcat:kpi5zmzvczcsbcsh5rwzkkqw2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307212231/https://drops.dagstuhl.de/opus/volltexte/2019/11338/pdf/LIPIcs-DISC-2019-31.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/63/6b/636b3e3ce8111d29df4a31dff9d4fa8db8ec4d2c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.31"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Round-Up: Runtime Verification of Quasi Linearizability for Concurrent Data Structures

Lu Zhang, Arijit Chattopadhyay, Chao Wang
<span title="2015-12-01">2015</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dthyqga2onff5nwf4agwqtrhxi" style="color: black;">IEEE Transactions on Software Engineering</a> </i> &nbsp;
We propose a new method for runtime checking of a relaxed consistency property called quasi linearizability for concurrent data structures.  ...  Quasi linearizability generalizes the standard notion of linearizability by introducing nondeterminism into the parallel computations quantitatively and then exploiting such nondeterminism to improve the  ...  For widely used data structures such as queues, stacks, and priority queues, a sequential version may serve as the golden model in Phase 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tse.2015.2467371">doi:10.1109/tse.2015.2467371</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hgu4i5pdlfculeehmfiuil6cs4">fatcat:hgu4i5pdlfculeehmfiuil6cs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161207162502/http://www-bcf.usc.edu:80/~wang626/pubDOC/ZhangCW15tse.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/ff/13/ff1317187f58411f24b33b31bd1289026808ea8c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tse.2015.2467371"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Data-Oblivious Data Structures

John C. Mitchell, Joe Zimmerman, Marc Herbstritt
<span title="2014-02-19">2014</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/npfxqbtrtjcmndol3ijtu4shem" style="color: black;">Symposium on Theoretical Aspects of Computer Science</a> </i> &nbsp;
Using this approach, we construct data-oblivious stacks, queues, and priority queues that are considerably simpler than existing constructions, as well as improving constant factors.  ...  We observe that data-oblivious algorithms often compose well when viewed as data structures.  ...  We thank Dan Boneh and Valeria Nikolaenko for helpful discussions, and the anonymous reviewers for their comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.stacs.2014.554">doi:10.4230/lipics.stacs.2014.554</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stacs/MitchellZ14.html">dblp:conf/stacs/MitchellZ14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fvpe7ouwl5bkvejpxcik753ys4">fatcat:fvpe7ouwl5bkvejpxcik753ys4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809084819/http://drops.dagstuhl.de/opus/volltexte/2014/4487/pdf/45.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/a2/c9/a2c92452018e1fd451acce403b6bcb3bcb50ec39.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.stacs.2014.554"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Teaching data structure design patterns

Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia
<span title="1998-03-01">1998</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzoq6upx4ndyrd7qaolzbaeuca" style="color: black;">ACM SIGCSE Bulletin</a> </i> &nbsp;
in addition to the theory of data structures.  ...  In this paper we present an approach for teaching the Freshman-Sophomore introduction to data structures course (CS2) in a way that provides an introduction to object-oriented software engineering patterns  ...  Some examples of positions are nodes in such data structures as sequences and trees.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/274790.274324">doi:10.1145/274790.274324</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i7wolmkiebfwjbiq3bn5e6gami">fatcat:i7wolmkiebfwjbiq3bn5e6gami</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061006010724/http://www.cs.brown.edu:80/cgc/jdsl/papers/patterns.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/70/c3/70c394962be8e3edb418abe5926b04dd05924f3d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/274790.274324"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Monotonically relaxing concurrent data-structure semantics for performance: An efficient 2D design framework [article]

Adones Rukundo, Aras Atalar, Philippas Tsigas
<span title="2019-06-17">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show how our framework can instantiate lock-free out-of-order queues, stacks, counters and dequeues.  ...  There has been a significant amount of work in the literature proposing semantic relaxation of concurrent data structures for improving scalability and performance.  ...  Such data structures include; stacks, FIFO queues, counters and dequeues. The 2D framework uses multiple copies (sub-structures) of the given data structure as depicted in Figure 1 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.07105v1">arXiv:1906.07105v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tr3zcapionhr5gw5jocevjzj2y">fatcat:tr3zcapionhr5gw5jocevjzj2y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191221224731/https://arxiv.org/pdf/1906.07105v1.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/57/1c/571cb03421b43ee321c6030e1aead501151dae0d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.07105v1" 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>

Data structures in the multicore age

Nir Shavit
<span title="2011-03-01">2011</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i6iajiiyxvgz3ob6jwcn2pufni" style="color: black;">Communications of the ACM</a> </i> &nbsp;
and of the algorithms at the core of their implementation. the data structures of our childhoodstacks, queues, and heaps-will soon disappear, replaced by looser "unordered" concurrent constructs based  ...  S S O R S aR e about to revolutionize the way we design and use data structures."  ...  Instead, let us focus here on one abstract data structure-a stack-and use it as an example of how the design process might proceed.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1897852.1897873">doi:10.1145/1897852.1897873</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kahorrpu6zhnnmualspsoydm2q">fatcat:kahorrpu6zhnnmualspsoydm2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809172727/http://www.eng.auburn.edu/~agrawvd/COURSE/READING/ARCH/Data%20Structures%20in%20the%20Multicore%20Age.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/a2/4b/a24b1525f5385836231c32867d871ffe2effe002.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1897852.1897873"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Using relaxed concurrent data structures for contention minimization in multithreaded MPI programs

Andrey V Tabakov, Alexey A Paznikov
<span title="">2019</span> <i title="IOP Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wxgp7pobnrfetfizidmpebi4qy" style="color: black;">Journal of Physics, Conference Series</a> </i> &nbsp;
A hybrid multi-threaded MPI program is the combination of the computational capabilities of processes and threads.  ...  Parallel computing is one of the top priorities in computer science.  ...  in relaxed data structures, the composition of which is considered as a logical single structure.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1742-6596/1399/3/033037">doi:10.1088/1742-6596/1399/3/033037</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xjnqe6mlcnd47gc2dvvcdt7gw4">fatcat:xjnqe6mlcnd47gc2dvvcdt7gw4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191208112952/https://iopscience.iop.org/article/10.1088/1742-6596/1399/3/033037/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/5d/1b/5d1b0beb945a0e61ad3313e7bd0120b172d871f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1742-6596/1399/3/033037"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> iop.org </button> </a>

Structural issues in active rule systems [chapter]

James Bailey, Guozhu Dong, Kotagiri Ramamohanarao
<span title="">1997</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 show that each of these is highly in uential in determining the expressiveness of the rule system as a whole, and that an appreciation of them can serve as a basis for understanding the broader picture  ...  Four important parameters of variation are presented, namely the rule language, the external query language, the meta rule language and the pending rule structure.  ...  Hence the stack/set is being used as both a source of the history and also as an aid to computation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-62222-5_46">doi:10.1007/3-540-62222-5_46</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y6nqqggi45dfvkuhpqlpwyi3xe">fatcat:y6nqqggi45dfvkuhpqlpwyi3xe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171202081109/http://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=1297&amp;context=knoesis" 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/ee/6e/ee6e82c642709e9bd07ce7d25b350155e353c8ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-62222-5_46"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Distributionally Linearizable Data Structures [article]

Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Z. Li, Giorgi Nadiradze
<span title="2022-03-25">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue pattern for implementing relaxed priority queue  ...  Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications.  ...  That is, this sequential process provides a structured probabilistic relaxation of a standard priority queue. Relaxed Data Structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.01018v2">arXiv:1804.01018v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/srwfszce25hhzho3z6xtkezyim">fatcat:srwfszce25hhzho3z6xtkezyim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220519150339/https://arxiv.org/pdf/1804.01018v2.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/6f/83/6f83954d3cec5fca0276b0c447a3cb5a8e10ea43.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.01018v2" 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>

Sequence of operations analysis for dynamic data structures

P Flajolet, J Françon, J Vuillemin
<span title="">1980</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/anp7kqfyerdljfxydqb4objj6a" style="color: black;">Journal of Algorithms</a> </i> &nbsp;
The method allows us effectively to evaluate the integrated cost of various interesting data structure implementations, for stacks, dictionaries, symbol tables, priority queues, and linear lists; it can  ...  We use the result to compute explicitly integrated costs of various implementations of dictionaries and priority queues.  ...  ACKNOWLEDGMENTS The authors would like to thank J. Giraud and G. Vieunot for several interesting discussions relative to this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0196-6774(80)90020-6">doi:10.1016/0196-6774(80)90020-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vb4qy27llzf3lmtwkz6fccbvfe">fatcat:vb4qy27llzf3lmtwkz6fccbvfe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130114223402/http://algo.inria.fr/flajolet/Publications/FlFrVu80.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/52/e0/52e06b1da86027641f8569499a2c034dad339043.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0196-6774(80)90020-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 5,764 results