Filters








132 Hits in 5.0 sec

Mounds: Array-Based Concurrent Priority Queues

Yujie Liu, Michael Spear
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3qrmigawsbhbljazwy2rerl5ni" style="color: black;">2012 41st International Conference on Parallel Processing</a> </i> &nbsp;
It supports O(log(log(N))) insert and O(log(N)) extractMin operations, making it suitable for use as a priority queue.  ...  We present two mound algorithms: the first achieves lock freedom via the use of a pure-software double-compareand-swap (DCAS), and the second uses fine grained locks.  ...  We focus on the operations needed to implement a lock-free priority queue with a mound, namely extractMin and insert.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpp.2012.42">doi:10.1109/icpp.2012.42</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icpp/LiuS12.html">dblp:conf/icpp/LiuS12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t3fxb3bbfba53o7vcrsbeiqj24">fatcat:t3fxb3bbfba53o7vcrsbeiqj24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811074219/http://www.cse.lehigh.edu/~spear/liu_icpp_2012.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/34/57343b2bb1969ffaab9b66955b9bcbf0341f7bce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpp.2012.42"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Combinable memory-block transactions

Guy E. Blelloch, Phillip B. Gibbons, S. Harsha Vardhan
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA &#39;08</a> </i> &nbsp;
We show how MBTs can be used to design simple and efficient implementations of a variety of protocols and algorithms, including a priority write, a semaphore with a nonblocking P operation, a bounded queue  ...  The idea is to encode short programs that operate on a single cache/memory block and then to specify such a program with a memory request.  ...  It is lock-free but assumes an unbounded queue and hence that infinite memory has been allocated ahead of time. It also sequentializes access to the queue. Gottlieb et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1378533.1378537">doi:10.1145/1378533.1378537</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/BlellochGV08.html">dblp:conf/spaa/BlellochGV08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3lnfn755mfhi3l66rgpnojvjdu">fatcat:3lnfn755mfhi3l66rgpnojvjdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921202601/http://www.cs.cmu.edu/~guyb/papers/BGV08.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/22/21/2221f71d9a20ec866f0186bc77c160e6ba62c0a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1378533.1378537"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Adapting Persistent Data Structures for Concurrency and Speculation [article]

Thomas Dickerson
<span title="2020-03-16">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It exploits a correspondence between design goals for efficient concurrent data structures and efficient immutable persistent data structures, to produce novel implementations of mutable concurrent trees  ...  with low contention and an efficient snapshot operation to support speculative execution models.  ...  The priority queues were initialized with 2 20 entries, using 10 warmup runs and 40 experimental runs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.07395v1">arXiv:2003.07395v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aad7ireyebbhrec77vafywhm6q">fatcat:aad7ireyebbhrec77vafywhm6q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320185541/https://arxiv.org/pdf/2003.07395v1.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/2003.07395v1" 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>

Improving STM performance with transactional structs

Ryan Yates, Michael L. Scott
<span title="">2017</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7v65k6c67beuveqr6z2ryoy2n4" style="color: black;">Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell - Haskell 2017</a> </i> &nbsp;
Our benchmarks show that concurrent data structures built with TStruct out-scale and out-perform their TVar-based equivalents.  ...  While safe concurrent computations are easy to express in Haskell's STM, concurrent data structures suffer unfortunate bloat in the implementation due to an extra level of indirection for mutable references  ...  Consider a program in which multiple threads are handling events that arrive in a series of queues ordered by priority, and an execution in which a thread T sees all the highest priority queues empty and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3122955.3122972">doi:10.1145/3122955.3122972</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/haskell/YatesS17.html">dblp:conf/haskell/YatesS17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v347di3j2beydjcnndl4vbixr4">fatcat:v347di3j2beydjcnndl4vbixr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171029231911/http://www.cs.rochester.edu/u/scott/papers/2017_Haskell_TStruct.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/f8/75/f8750426c6e7ec34a9ab5fe89271a892b5158f59.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3122955.3122972"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Improving STM performance with transactional structs

Ryan Yates, Michael L. Scott
<span title="2017-09-07">2017</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;
Our benchmarks show that concurrent data structures built with TStruct out-scale and out-perform their TVar-based equivalents.  ...  While safe concurrent computations are easy to express in Haskell's STM, concurrent data structures suffer unfortunate bloat in the implementation due to an extra level of indirection for mutable references  ...  Consider a program in which multiple threads are handling events that arrive in a series of queues ordered by priority, and an execution in which a thread T sees all the highest priority queues empty and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3156695.3122972">doi:10.1145/3156695.3122972</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fitw3xdy6neetguo5fjehffu7y">fatcat:fitw3xdy6neetguo5fjehffu7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171029231911/http://www.cs.rochester.edu/u/scott/papers/2017_Haskell_TStruct.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/f8/75/f8750426c6e7ec34a9ab5fe89271a892b5158f59.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3156695.3122972"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Fast and Fair Lock-Free Locks [article]

Naama Ben-David, Guy E. Blelloch
<span title="2021-08-10">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a randomized approach for lock-free locks with strong bounds on time and fairness in a context in which any process can be arbitrarily delayed.  ...  Given an upper bound κ known to the algorithm on the point contention for a tryLock it will succeed in acquiring its locks and running the code with probability at least 1/κ. It is thus fair.  ...  This general approach has been used in several concurrent algorithms to convert lock-based algorithms to lock-free algorithms (e.g., [13, 19] ), and to implement transactions in a lock-free manner [20  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.04520v1">arXiv:2108.04520v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mqisywstyjhvtdrcrmwq4vuefm">fatcat:mqisywstyjhvtdrcrmwq4vuefm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210815110151/https://arxiv.org/pdf/2108.04520v1.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/c4/6e/c46e2e979973a438851f1d751a1988b4bf89abd4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.04520v1" 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>

Optimistic parallelism requires abstractions

Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jpubwsjaozha5itdes6pzyz2fm" style="color: black;">Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI &#39;07</a> </i> &nbsp;
Acknowledgments We would like to thank Khubaib Khubaib in our group for his measurements of Galois overhead, and Ramesh Peri and David Levinthal at Intel, Austin Division for their help with VTune.  ...  One solution is to use a lock on object S; if this inhibits concurrency, we can use fine-grain locks within object S.  ...  The kd-tree interface is essentially the same as Set, but with the addition of the nearest neighbor (nearest) method. The priority queue is an instance of a poSet.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1250734.1250759">doi:10.1145/1250734.1250759</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pldi/KulkarniPWRBC07.html">dblp:conf/pldi/KulkarniPWRBC07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r3vothk2pfhbbnw43lyeque754">fatcat:r3vothk2pfhbbnw43lyeque754</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070611020814/http://www.cs.cornell.edu/~kb/publications/Galois_PLDI07.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/1d/b1/1db16377eb232c853ab309f6c63c1a804e98c532.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1250734.1250759"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Optimistic parallelism requires abstractions

Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
<span title="2007-06-10">2007</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;
Acknowledgments We would like to thank Khubaib Khubaib in our group for his measurements of Galois overhead, and Ramesh Peri and David Levinthal at Intel, Austin Division for their help with VTune.  ...  One solution is to use a lock on object S; if this inhibits concurrency, we can use fine-grain locks within object S.  ...  The kd-tree interface is essentially the same as Set, but with the addition of the nearest neighbor (nearest) method. The priority queue is an instance of a poSet.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1273442.1250759">doi:10.1145/1273442.1250759</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fzid5oftn5gfzjf44kiglymlym">fatcat:fzid5oftn5gfzjf44kiglymlym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070611020814/http://www.cs.cornell.edu/~kb/publications/Galois_PLDI07.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/1d/b1/1db16377eb232c853ab309f6c63c1a804e98c532.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1273442.1250759"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Optimistic parallelism requires abstractions

Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
<span title="2009-09-01">2009</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;
Acknowledgments We would like to thank Khubaib Khubaib in our group for his measurements of Galois overhead, and Ramesh Peri and David Levinthal at Intel, Austin Division for their help with VTune.  ...  One solution is to use a lock on object S; if this inhibits concurrency, we can use fine-grain locks within object S.  ...  The kd-tree interface is essentially the same as Set, but with the addition of the nearest neighbor (nearest) method. The priority queue is an instance of a poSet.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1562164.1562188">doi:10.1145/1562164.1562188</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s6dnqbpgq5cejjpbzxtgeocjeu">fatcat:s6dnqbpgq5cejjpbzxtgeocjeu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070611020814/http://www.cs.cornell.edu/~kb/publications/Galois_PLDI07.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/1d/b1/1db16377eb232c853ab309f6c63c1a804e98c532.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1562164.1562188"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Resource access control for dynamic priority distributed real-time systems

Chen Zhang, David Cordes
<span title="2006-06-23">2006</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6uj52ajhhrfhrh2at2niwfy6oq" style="color: black;">Real-time systems</a> </i> &nbsp;
local and remote priority inversion, and (iii) distributed preemption ceilings that delimit the priority inversion time further.  ...  One open problem in this area is resource access synchronization for tasks employing dynamic priority scheduling.  ...  Distributed Priority Inheritance Unbounded distributed priority inversion is a problem introduced by allowing jobs to lock resources on different processors simultaneously. Figure 5.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11241-006-8642-5">doi:10.1007/s11241-006-8642-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3j5tuxwvbvhsdjnjau7hz6iq5i">fatcat:3j5tuxwvbvhsdjnjau7hz6iq5i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060908131459/http://cs.ua.edu/research/TechnicalReports/TR-2003-01.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/49/df/49dfd89b1d3484da46ffdc98df76ded4acb1c3f7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11241-006-8642-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient parallel programming in Poly/ML and Isabelle/ML

David C.J. Matthews, Makarius Wenzel
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming - DAMP &#39;10</a> </i> &nbsp;
In addition, block-structured groups of futures with propagation of exceptions allow for alternative functional evaluation (such as parallel search), without requiring user code to tackle concurrency.  ...  Scheduling is implicit, but it is also possible to specify dependencies and priorities.  ...  unbounded message queue: operation send always adds a message without blocking, but receive blocks if the mailbox is empty.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1708046.1708058">doi:10.1145/1708046.1708058</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/MatthewsW10.html">dblp:conf/popl/MatthewsW10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zh2fs6336rds7bkc4jomwfznpq">fatcat:zh2fs6336rds7bkc4jomwfznpq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160914204452/http://www4.in.tum.de/~wenzelm/papers/parallel-ml.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/9f/a1/9fa11f0f9e3dbdef34f5d371d67f6e1ceb56ec78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1708046.1708058"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Programming languages as operating systems (or revenge of the son of the lisp machine)

Matthew Flatt, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen
<span title="">1999</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ug3n3jfg4jdcpdvbrhe3m4txqa" style="color: black;">Proceedings of the fourth ACM SIGPLAN international conference on Functional programming - ICFP &#39;99</a> </i> &nbsp;
We implemented DrScheme by first building MrEd [15], a portable Scheme [23] implementation with a graphical user interface (GUI) toolbox.  ...  MrEd: A Scheme Machine The DrScheme programming environment [10] provides students and programmers with a user-friendly environment for developing Scheme programs.  ...  Each queued procedure is either a high-priority or lowpriority callback, indicated by an optional second argument to queue-callback.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/317636.317793">doi:10.1145/317636.317793</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icfp/FlattFKF99.html">dblp:conf/icfp/FlattFKF99</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vaxqcbrf6bedfdqvjsio4f7yje">fatcat:vaxqcbrf6bedfdqvjsio4f7yje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417131230/http://www.ccs.neu.edu/scheme/pubs/icfp99-ffkf.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/45/48/45484df774be65d7764a2e03c9bb2f500355b484.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/317636.317793"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Programming languages as operating systems (or revenge of the son of the lisp machine)

Matthew Flatt, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen
<span title="1999-09-01">1999</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 implemented DrScheme by first building MrEd [15], a portable Scheme [23] implementation with a graphical user interface (GUI) toolbox.  ...  MrEd: A Scheme Machine The DrScheme programming environment [10] provides students and programmers with a user-friendly environment for developing Scheme programs.  ...  Each queued procedure is either a high-priority or lowpriority callback, indicated by an optional second argument to queue-callback.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/317765.317793">doi:10.1145/317765.317793</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r3szgzd7gvhtxk5h2pe75tgkwe">fatcat:r3szgzd7gvhtxk5h2pe75tgkwe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417131230/http://www.ccs.neu.edu/scheme/pubs/icfp99-ffkf.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/45/48/45484df774be65d7764a2e03c9bb2f500355b484.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/317765.317793"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

HiRes: A System for Predictable Hierarchical Resource Management

Gabriel Parmer, Richard West
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bb6eqaqalrhaffew6gpk6h6wue" style="color: black;">2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium</a> </i> &nbsp;
This increased resource management flexibility enables subsystems with different timing constraints to specialize resource management around meeting these requirements.  ...  Results show that HIRES has competitive performance with existing systems, and that HRM naturally provides both strong isolation guarantees, and flexible and efficient subsystem control over resources.  ...  This basic support is used to implement wait-queues, event notification, and higher-level synchronization primitives such as locks with priority inheritance and priority ceiling [15] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/rtas.2011.25">doi:10.1109/rtas.2011.25</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/rtas/ParmerW11.html">dblp:conf/rtas/ParmerW11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e7d6idaio5a7xdxtvzyf4w2tn4">fatcat:e7d6idaio5a7xdxtvzyf4w2tn4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809072542/http://www.cs.bu.edu/~richwest/papers/rtas11-hires.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/b7/b1/b7b174aae1c849e5c237666665a8b9e9d617e9f6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/rtas.2011.25"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Composable memory transactions

Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy
<span title="2008-08-01">2008</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;
Writing concurrent programs is notoriously difficult, and is of increasing practical importance.  ...  In this paper we present a new concurrency model, based on transactional memory, that offers far richer composition.  ...  A special thank-you to Andres Löh for help with typesetting the figures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1378704.1378725">doi:10.1145/1378704.1378725</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6pey7pbslnclvdgpnynu34jrtm">fatcat:6pey7pbslnclvdgpnynu34jrtm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131214234911/http://research.microsoft.com:80/pubs/67418/2005-ppopp-composable.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/2b/f4/2bf4940710deb2571e93b1c922e8e7452e854afd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1378704.1378725"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 132 results