iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/40/944.rss
dblp: Adam Morrison https://dblp.org/pid/40/944.html dblp person page RSS feed Mon, 07 Oct 2024 21:24:10 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Adam Morrisonhttps://dblp.org/pid/40/944.html14451 Everywhere All at Once: Co-Location Attacks on Public Cloud FaaS.https://doi.org/10.1145/3617232.3624867, , , :
Everywhere All at Once: Co-Location Attacks on Public Cloud FaaS. ASPLOS (1) : 133-149]]>https://dblp.org/rec/conf/asplos/Zhao0FT24Mon, 01 Jan 2024 00:00:00 +0100 Last-Level Cache Side-Channel Attacks Are Feasible in the Modern Public Cloud.https://doi.org/10.1145/3620665.3640403, , , :
Last-Level Cache Side-Channel Attacks Are Feasible in the Modern Public Cloud. ASPLOS (2) : 582-600]]>https://dblp.org/rec/conf/asplos/Zhao0FT24aMon, 01 Jan 2024 00:00:00 +0100 Last-Level Cache Side-Channel Attacks Are Feasible in the Modern Public Cloud (Extended Version).https://doi.org/10.48550/arXiv.2405.12469, , , :
Last-Level Cache Side-Channel Attacks Are Feasible in the Modern Public Cloud (Extended Version). CoRR abs/2405.12469 ()]]>https://dblp.org/rec/journals/corr/abs-2405-12469Mon, 01 Jan 2024 00:00:00 +0100 RLS Side Channels: Investigating Leakage of Row-Level Security Protected Data Through Query Execution Time.https://doi.org/10.1145/3588943, , :
RLS Side Channels: Investigating Leakage of Row-Level Security Protected Data Through Query Execution Time. Proc. ACM Manag. Data 1(1): 89:1-89:25 ()]]>https://dblp.org/rec/journals/pacmmod/DarH023Sun, 01 Jan 2023 00:00:00 +0100 Untangle: A Principled Framework to Design Low-Leakage, High-Performance Dynamic Partitioning Schemes.https://doi.org/10.1145/3582016.3582033, , , :
Untangle: A Principled Framework to Design Low-Leakage, High-Performance Dynamic Partitioning Schemes. ASPLOS (3) : 771-788]]>https://dblp.org/rec/conf/asplos/Zhao0FT23Sun, 01 Jan 2023 00:00:00 +0100 Declassiflow: A Static Analysis for Modeling Non-Speculative Knowledge to Relax Speculative Execution Security Measures.https://doi.org/10.1145/3576915.3623065, , , , :
Declassiflow: A Static Analysis for Modeling Non-Speculative Knowledge to Relax Speculative Execution Security Measures. CCS : 2053-2067]]>https://dblp.org/rec/conf/ccs/ChoudharyWZ0F23Sun, 01 Jan 2023 00:00:00 +0100 ShRing: Networking with Shared Receive Rings.https://www.usenix.org/conference/osdi23/presentation/pismenny, , :
ShRing: Networking with Shared Receive Rings. OSDI : 949-968]]>https://dblp.org/rec/conf/osdi/Pismenny0T23Sun, 01 Jan 2023 00:00:00 +0100 WISE: Predicting the Performance of Sparse Matrix Vector Multiplication with Machine Learning.https://doi.org/10.1145/3572848.3577506, , , :
WISE: Predicting the Performance of Sparse Matrix Vector Multiplication with Machine Learning. PPoPP : 329-341]]>https://dblp.org/rec/conf/ppopp/YesilH0T23Sun, 01 Jan 2023 00:00:00 +0100 Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure.https://www.usenix.org/conference/atc23/presentation/kaufman, , :
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure. USENIX ATC : 719-733]]>https://dblp.org/rec/conf/usenix/KaufmanH023Sun, 01 Jan 2023 00:00:00 +0100 Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version).https://doi.org/10.48550/arXiv.2306.04602, , :
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version). CoRR abs/2306.04602 ()]]>https://dblp.org/rec/journals/corr/abs-2306-04602Sun, 01 Jan 2023 00:00:00 +0100 DECLASSIFLOW: A Static Analysis for Modeling Non-Speculative Knowledge to Relax Speculative Execution Security Measures (Full Version).https://doi.org/10.48550/arXiv.2312.09336, , , , :
DECLASSIFLOW: A Static Analysis for Modeling Non-Speculative Knowledge to Relax Speculative Execution Security Measures (Full Version). CoRR abs/2312.09336 ()]]>https://dblp.org/rec/journals/corr/abs-2312-09336Sun, 01 Jan 2023 00:00:00 +0100 Prefix Filter: Practically and Theoretically Better Than Bloom.https://www.vldb.org/pvldb/vol15/p1311-even.pdf, , :
Prefix Filter: Practically and Theoretically Better Than Bloom. Proc. VLDB Endow. 15(7): 1311-1323 ()]]>https://dblp.org/rec/journals/pvldb/EvenEM22Sat, 01 Jan 2022 00:00:00 +0100 Pinned loads: taming speculative loads in secure processors.https://doi.org/10.1145/3503222.3507724, , , , :
Pinned loads: taming speculative loads in secure processors. ASPLOS : 314-328]]>https://dblp.org/rec/conf/asplos/ZhaoJ0MT22Sat, 01 Jan 2022 00:00:00 +0100 The benefits of general-purpose on-NIC memory.https://doi.org/10.1145/3503222.3507711, , , :
The benefits of general-purpose on-NIC memory. ASPLOS : 1130-1147]]>https://dblp.org/rec/conf/asplos/PismennyL0T22Sat, 01 Jan 2022 00:00:00 +0100 Elastic Indexes: Dynamic Space vs. Query Efficiency Tuning for In-Memory Database Indexing.https://doi.org/10.48786/edbt.2022.18, , , :
Elastic Indexes: Dynamic Space vs. Query Efficiency Tuning for In-Memory Database Indexing. EDBT : 2:312-2:324]]>https://dblp.org/rec/conf/edbt/HershcovitchKW022Sat, 01 Jan 2022 00:00:00 +0100 Occualizer: Optimistic Concurrent Search Trees From Sequential Code.https://www.usenix.org/conference/osdi22/presentation/shanny, :
Occualizer: Optimistic Concurrent Search Trees From Sequential Code. OSDI : 321-337]]>https://dblp.org/rec/conf/osdi/Shanny022Sat, 01 Jan 2022 00:00:00 +0100 Augury: Using Data Memory-Dependent Prefetchers to Leak Data at Rest.https://doi.org/10.1109/SP46214.2022.9833570, , , , , , :
Augury: Using Data Memory-Dependent Prefetchers to Leak Data at Rest. SP : 1491-1505]]>https://dblp.org/rec/conf/sp/VicarteFPG0FK22Sat, 01 Jan 2022 00:00:00 +0100 Evaluating compressed indexes in DBMS.https://doi.org/10.1145/3534056.3535006, , , :
Evaluating compressed indexes in DBMS. SYSTOR : 149]]>https://dblp.org/rec/conf/systor/AnaniLH022Sat, 01 Jan 2022 00:00:00 +0100 System-level crash safe sorting on persistent memory.https://doi.org/10.1145/3534056.3535008, , , , , :
System-level crash safe sorting on persistent memory. SYSTOR : 151]]>https://dblp.org/rec/conf/systor/AradSZWH022Sat, 01 Jan 2022 00:00:00 +0100 Privbox: Faster System Calls Through Sandboxed Privileged Execution.https://www.usenix.org/conference/atc22/presentation/kuznetsov, :
Privbox: Faster System Calls Through Sandboxed Privileged Execution. USENIX ATC ]]>https://dblp.org/rec/conf/usenix/Kuznetsov022Sat, 01 Jan 2022 00:00:00 +0100 Binoculars: Contention-Based Side-Channel Attacks Exploiting the Page Walker.https://www.usenix.org/conference/usenixsecurity22/presentation/zhao-zirui, , , :
Binoculars: Contention-Based Side-Channel Attacks Exploiting the Page Walker. USENIX Security Symposium : 699-716]]>https://dblp.org/rec/conf/uss/Zhao0FT22Sat, 01 Jan 2022 00:00:00 +0100 Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing.https://arxiv.org/abs/2201.09331, :
Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing. CoRR abs/2201.09331 ()]]>https://dblp.org/rec/journals/corr/abs-2201-09331Sat, 01 Jan 2022 00:00:00 +0100 Prefix Filter: Practically and Theoretically Better Than Bloom.https://doi.org/10.48550/arXiv.2203.17139, , :
Prefix Filter: Practically and Theoretically Better Than Bloom. CoRR abs/2203.17139 ()]]>https://dblp.org/rec/journals/corr/abs-2203-17139Sat, 01 Jan 2022 00:00:00 +0100 Speculative taint tracking (STT): a comprehensive protection for speculatively accessed data.https://doi.org/10.1145/3491201, , , , , :
Speculative taint tracking (STT): a comprehensive protection for speculatively accessed data. Commun. ACM 64(12): 105-112 ()]]>https://dblp.org/rec/journals/cacm/YuYKMTF21Fri, 01 Jan 2021 00:00:00 +0100 Specification and space complexity of collaborative text editing.https://doi.org/10.1016/j.tcs.2020.11.046, , , , , :
Specification and space complexity of collaborative text editing. Theor. Comput. Sci. 855: 141-160 ()]]>https://dblp.org/rec/journals/tcs/AttiyaBGMYZ21Fri, 01 Jan 2021 00:00:00 +0100 Autonomous NIC offloads.https://doi.org/10.1145/3445814.3446732, , , , , :
Autonomous NIC offloads. ASPLOS : 18-35]]>https://dblp.org/rec/conf/asplos/PismennyEYL0T21Fri, 01 Jan 2021 00:00:00 +0100 Speculative interference attacks: breaking invisible speculation schemes.https://doi.org/10.1145/3445814.3446708, , , , , , , , , , , , , , , :
Speculative interference attacks: breaking invisible speculation schemes. ASPLOS : 1046-1060]]>https://dblp.org/rec/conf/asplos/BehniaSPYZZUTR021Fri, 01 Jan 2021 00:00:00 +0100 Characterizing, exploiting, and detecting DMA code injection vulnerabilities in the presence of an IOMMU.https://doi.org/10.1145/3447786.3456249, , , , , , :
Characterizing, exploiting, and detecting DMA code injection vulnerabilities in the presence of an IOMMU. EuroSys : 395-409]]>https://dblp.org/rec/conf/eurosys/MarkuzeVKPA0T21Fri, 01 Jan 2021 00:00:00 +0100 Opening Pandora's Box: A Systematic Study of New Ways Microarchitecture Can Leak Private Data.https://doi.org/10.1109/ISCA52012.2021.00035, , , , , , :
Opening Pandora's Box: A Systematic Study of New Ways Microarchitecture Can Leak Private Data. ISCA : 347-360]]>https://dblp.org/rec/conf/isca/VicarteSNT0KF21Fri, 01 Jan 2021 00:00:00 +0100 Speculative Privacy Tracking (SPT): Leaking Information From Speculative Execution Without Compromising Privacy.https://doi.org/10.1145/3466752.3480068, , , :
Speculative Privacy Tracking (SPT): Leaking Information From Speculative Execution Without Compromising Privacy. MICRO : 607-622]]>https://dblp.org/rec/conf/micro/ChoudharyYF021Fri, 01 Jan 2021 00:00:00 +0100 Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory.https://doi.org/10.1145/3437801.3441582, :
Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory. PPoPP : 191-204]]>https://dblp.org/rec/conf/ppopp/Solomon021Fri, 01 Jan 2021 00:00:00 +0100 Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing.https://doi.org/10.1145/3477132.3483551, :
Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing. SOSP : 147-162]]>https://dblp.org/rec/conf/sosp/Zeitak021Fri, 01 Jan 2021 00:00:00 +0100 An Analysis of Speculative Type Confusion Vulnerabilities in the Wild.https://www.usenix.org/conference/usenixsecurity21/presentation/kirzner, :
An Analysis of Speculative Type Confusion Vulnerabilities in the Wild. USENIX Security Symposium : 2399-2416]]>https://dblp.org/rec/conf/uss/Kirzner021Fri, 01 Jan 2021 00:00:00 +0100 An Analysis of Speculative Type Confusion Vulnerabilities in the Wild.https://arxiv.org/abs/2106.15601, :
An Analysis of Speculative Type Confusion Vulnerabilities in the Wild. CoRR abs/2106.15601 ()]]>https://dblp.org/rec/journals/corr/abs-2106-15601Fri, 01 Jan 2021 00:00:00 +0100 Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data.https://doi.org/10.1109/MM.2020.2985359, , , , , :
Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data. IEEE Micro 40(3): 81-90 ()]]>https://dblp.org/rec/journals/micro/YuYKMTF20Wed, 01 Jan 2020 00:00:00 +0100 Proving highly-concurrent traversals correct.https://doi.org/10.1145/3428196, , , , , , :
Proving highly-concurrent traversals correct. Proc. ACM Program. Lang. 4(OOPSLA): 128:1-128:29 ()]]>https://dblp.org/rec/journals/pacmpl/FeldmanKE0NRS20Wed, 01 Jan 2020 00:00:00 +0100 IOctopus: Outsmarting Nonuniform DMA.https://doi.org/10.1145/3373376.3378509, , , , , , , , :
IOctopus: Outsmarting Nonuniform DMA. ASPLOS : 101-115]]>https://dblp.org/rec/conf/asplos/SmolyarMPEZBL0T20Wed, 01 Jan 2020 00:00:00 +0100 V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging.https://doi.org/10.1145/3392717.3392739, , , , , :
V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging. ICS : 9:1-9:13]]>https://dblp.org/rec/conf/ics/HeidarshenasYSM20Wed, 01 Jan 2020 00:00:00 +0100 Snug: architectural support for relaxed concurrent priority queueing in chip multiprocessors.https://doi.org/10.1145/3392717.3392740, , , , :
Snug: architectural support for relaxed concurrent priority queueing in chip multiprocessors. ICS : 18:1-18:13]]>https://dblp.org/rec/conf/ics/HeidarshenasGYM20Wed, 01 Jan 2020 00:00:00 +0100 Speculative Data-Oblivious Execution: Mobilizing Safe Prediction For Safe and Efficient Speculative Execution.https://doi.org/10.1109/ISCA45697.2020.00064, , , , :
Speculative Data-Oblivious Execution: Mobilizing Safe Prediction For Safe and Efficient Speculative Execution. ISCA : 707-720]]>https://dblp.org/rec/conf/isca/YuMT0F20Wed, 01 Jan 2020 00:00:00 +0100 Speculation Invariance (InvarSpec): Faster Safe Execution Through Program Analysis.https://doi.org/10.1109/MICRO50266.2020.00094, , , , , , , :
Speculation Invariance (InvarSpec): Faster Safe Execution Through Program Analysis. MICRO : 1138-1152]]>https://dblp.org/rec/conf/micro/ZhaoJYYF0MT20Wed, 01 Jan 2020 00:00:00 +0100 Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity.https://doi.org/10.4230/LIPIcs.OPODIS.2020.15, :
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. OPODIS : 15:1-15:16]]>https://dblp.org/rec/conf/opodis/Katzan020Wed, 01 Jan 2020 00:00:00 +0100 Scaling concurrent queues by using HTM to profit from failed atomic operations.https://doi.org/10.1145/3332466.3374511, :
Scaling concurrent queues by using HTM to profit from failed atomic operations. PPoPP : 89-101]]>https://dblp.org/rec/conf/ppopp/OstrovskyM20Wed, 01 Jan 2020 00:00:00 +0100 Speeding up SpMV for power-law graph analytics by enhancing locality & vectorization.https://doi.org/10.1109/SC41405.2020.00090, , , :
Speeding up SpMV for power-law graph analytics by enhancing locality & vectorization. SC : 86]]>https://dblp.org/rec/conf/sc/YesilH0T20Wed, 01 Jan 2020 00:00:00 +0100 Speculative Interference Attacks: Breaking Invisible Speculation Schemes.https://arxiv.org/abs/2007.11818, , , , , , , , , , , , , , , :
Speculative Interference Attacks: Breaking Invisible Speculation Schemes. CoRR abs/2007.11818 ()]]>https://dblp.org/rec/journals/corr/abs-2007-11818Wed, 01 Jan 2020 00:00:00 +0100 Proving Highly-Concurrent Traversals Correct.https://arxiv.org/abs/2010.00911, , , , , , :
Proving Highly-Concurrent Traversals Correct. CoRR abs/2010.00911 ()]]>https://dblp.org/rec/journals/corr/abs-2010-00911Wed, 01 Jan 2020 00:00:00 +0100 Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity.https://arxiv.org/abs/2011.07622, :
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. CoRR abs/2011.07622 ()]]>https://dblp.org/rec/journals/corr/abs-2011-07622Wed, 01 Jan 2020 00:00:00 +0100 Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data.https://doi.org/10.1145/3352460.3358274, , , , , :
Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data. MICRO : 954-968]]>https://dblp.org/rec/conf/micro/YuYK0TF19Tue, 01 Jan 2019 00:00:00 +0100 InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy (Corrigendum).https://doi.org/10.1145/3352460.3361129, , , , , :
InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy (Corrigendum). MICRO : 1076]]>https://dblp.org/rec/conf/micro/YanCS0FT19Tue, 01 Jan 2019 00:00:00 +0100 Understanding priority-based scheduling of graph algorithms on a shared-memory platform.https://doi.org/10.1145/3295500.3356160, , , :
Understanding priority-based scheduling of graph algorithms on a shared-memory platform. SC : 46:1-46:14]]>https://dblp.org/rec/conf/sc/YesilH0T19Tue, 01 Jan 2019 00:00:00 +0100 Proceedings of the 12th ACM International Conference on Systems and Storage, SYSTOR 2019, Haifa, Israel, June 3-5, 2019.https://doi.org/10.1145/3319647, , :
Proceedings of the 12th ACM International Conference on Systems and Storage, SYSTOR 2019, Haifa, Israel, June 3-5, 2019. ACM , ISBN 978-1-4503-6749-3 [contents]]]>https://dblp.org/rec/conf/systor/2019Tue, 01 Jan 2019 00:00:00 +0100 DAMN: Overhead-Free IOMMU Protection for Networking.https://doi.org/10.1145/3173162.3173175, , , :
DAMN: Overhead-Free IOMMU Protection for Networking. ASPLOS : 301-315]]>https://dblp.org/rec/conf/asplos/MarkuzeSMT18Mon, 01 Jan 2018 00:00:00 +0100 InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy.https://doi.org/10.1109/MICRO.2018.00042, , , , , :
InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy. MICRO : 428-441]]>https://dblp.org/rec/conf/micro/YanCS0FT18Mon, 01 Jan 2018 00:00:00 +0100 Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity.https://doi.org/10.1145/3212734.3212759, :
Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity. PODC : 27-36]]>https://dblp.org/rec/conf/podc/AlonM18Mon, 01 Jan 2018 00:00:00 +0100 Getting to the Root of Concurrent Binary Search Tree Performance.https://www.usenix.org/conference/atc18/presentation/arbel-raviv, , :
Getting to the Root of Concurrent Binary Search Tree Performance. USENIX ATC : 295-306]]>https://dblp.org/rec/conf/usenix/Arbel-Raviv0018Mon, 01 Jan 2018 00:00:00 +0100 Order out of Chaos: Proving Linearizability Using Local Views.https://doi.org/10.4230/LIPIcs.DISC.2018.23, , , , :
Order out of Chaos: Proving Linearizability Using Local Views. DISC : 23:1-23:21]]>https://dblp.org/rec/conf/wdag/FeldmanE0RS18Mon, 01 Jan 2018 00:00:00 +0100 Order out of Chaos: Proving Linearizability Using Local Views.http://arxiv.org/abs/1805.03992, , , , :
Order out of Chaos: Proving Linearizability Using Local Views. CoRR abs/1805.03992 ()]]>https://dblp.org/rec/journals/corr/abs-1805-03992Mon, 01 Jan 2018 00:00:00 +0100 Limitations of Highly-Available Eventually-Consistent Data Stores.https://doi.org/10.1109/TPDS.2016.2556669, , :
Limitations of Highly-Available Eventually-Consistent Data Stores. IEEE Trans. Parallel Distributed Syst. 28(1): 141-155 ()]]>https://dblp.org/rec/journals/tpds/AttiyaEM17Sun, 01 Jan 2017 00:00:00 +0100 Scaling synchronization in multicore programs.https://doi.org/10.1145/2980987:
Scaling synchronization in multicore programs. Commun. ACM 59(11): 44-51 ()]]>https://dblp.org/rec/journals/cacm/Morrison16Fri, 01 Jan 2016 00:00:00 +0100 Scaling Synchronization in Multicore Programs.https://doi.org/10.1145/2984629.2991130:
Scaling Synchronization in Multicore Programs. ACM Queue 14(4): 20 ()]]>https://dblp.org/rec/journals/queue/Morrison16Fri, 01 Jan 2016 00:00:00 +0100 True IOMMU Protection from DMA Attacks: When Copy is Faster than Zero Copy.https://doi.org/10.1145/2872362.2872379, , :
True IOMMU Protection from DMA Attacks: When Copy is Faster than Zero Copy. ASPLOS : 249-262]]>https://dblp.org/rec/conf/asplos/MarkuzeMT16Fri, 01 Jan 2016 00:00:00 +0100 CASPAR: Breaking Serialization in Lock-Free Multicore Synchronization.https://doi.org/10.1145/2872362.2872400, , :
CASPAR: Breaking Serialization in Lock-Free Multicore Synchronization. ASPLOS : 789-804]]>https://dblp.org/rec/conf/asplos/GangwaniMT16Fri, 01 Jan 2016 00:00:00 +0100 Specification and Complexity of Collaborative Text Editing.https://doi.org/10.1145/2933057.2933090, , , , , :
Specification and Complexity of Collaborative Text Editing. PODC : 259-268]]>https://dblp.org/rec/conf/podc/AttiyaBGMYZ16Fri, 01 Jan 2016 00:00:00 +0100 Temporally Bounding TSO for Fence-Free Asymmetric Synchronization.https://doi.org/10.1145/2694344.2694374, :
Temporally Bounding TSO for Fence-Free Asymmetric Synchronization. ASPLOS : 45-58]]>https://dblp.org/rec/conf/asplos/MorrisonA15Thu, 01 Jan 2015 00:00:00 +0100 A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms.https://doi.org/10.4230/LIPIcs.OPODIS.2015.15, , :
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms. OPODIS : 15:1-15:16]]>https://dblp.org/rec/conf/opodis/TamirMR15Thu, 01 Jan 2015 00:00:00 +0100 Limitations of Highly-Available Eventually-Consistent Data Stores.https://doi.org/10.1145/2767386.2767419, , :
Limitations of Highly-Available Eventually-Consistent Data Stores. PODC : 385-394]]>https://dblp.org/rec/conf/podc/AttiyaEM15Thu, 01 Jan 2015 00:00:00 +0100 Predicate RCU: an RCU for scalable concurrent updates.https://doi.org/10.1145/2688500.2688518, :
Predicate RCU: an RCU for scalable concurrent updates. PPoPP : 21-30]]>https://dblp.org/rec/conf/ppopp/ArbelM15Thu, 01 Jan 2015 00:00:00 +0100 Utilizing the IOMMU Scalably.https://www.usenix.org/conference/atc15/technical-session/presentation/peleg, , , :
Utilizing the IOMMU Scalably. USENIX ATC : 549-562]]>https://dblp.org/rec/conf/usenix/PelegMST15Thu, 01 Jan 2015 00:00:00 +0100 The CB tree: a practical concurrent self-adjusting search tree.https://doi.org/10.1007/s00446-014-0229-0, , , , :
The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. 27(6): 393-417 ()]]>https://dblp.org/rec/journals/dc/AfekKKMT14Wed, 01 Jan 2014 00:00:00 +0100 Fence-free work stealing on bounded TSO processors.https://doi.org/10.1145/2541940.2541987, :
Fence-free work stealing on bounded TSO processors. ASPLOS : 413-426]]>https://dblp.org/rec/conf/asplos/MorrisonA14Wed, 01 Jan 2014 00:00:00 +0100 Software-improved hardware lock elision.https://doi.org/10.1145/2611462.2611482, , :
Software-improved hardware lock elision. PODC : 212-221]]>https://dblp.org/rec/conf/podc/AfekLM14Wed, 01 Jan 2014 00:00:00 +0100 FAst and Scalable Software Execution on Multicores/ Adam, Morrison.https://tau.primo.exlibrisgroup.com/permalink/972TAU_INST/bai57q/alma990028360940204146:
FAst and Scalable Software Execution on Multicores/ Adam, Morrison. Tel Aviv University, Israel, ]]>https://dblp.org/rec/phd/il/Morrison13Tue, 01 Jan 2013 00:00:00 +0100 Fast and scalable rendezvousing.https://doi.org/10.1007/s00446-013-0185-0, , :
Fast and scalable rendezvousing. Distributed Comput. 26(4): 243-269 ()]]>https://dblp.org/rec/journals/dc/AfekHM13Tue, 01 Jan 2013 00:00:00 +0100 Fast concurrent queues for x86 processors.https://doi.org/10.1145/2442516.2442527, :
Fast concurrent queues for x86 processors. PPoPP : 103-112]]>https://dblp.org/rec/conf/ppopp/MorrisonA13Tue, 01 Jan 2013 00:00:00 +0100 Programming with hardware lock elision.https://doi.org/10.1145/2442516.2442552, , :
Programming with hardware lock elision. PPoPP : 295-296]]>https://dblp.org/rec/conf/ppopp/AfekLM13Tue, 01 Jan 2013 00:00:00 +0100 CBTree: A Practical Concurrent Self-Adjusting Search Tree.https://doi.org/10.1007/978-3-642-33651-5_1, , , , :
CBTree: A Practical Concurrent Self-Adjusting Search Tree. DISC : 1-15]]>https://dblp.org/rec/conf/wdag/AfekKKMT12Sun, 01 Jan 2012 00:00:00 +0100 A review of DISC 2011.https://doi.org/10.1145/2078162.2078181, :
A review of DISC 2011. SIGACT News 42(4): 87-91 ()]]>https://dblp.org/rec/journals/sigact/HakimiM11Sat, 01 Jan 2011 00:00:00 +0100 Cache index-aware memory allocation.https://doi.org/10.1145/1993478.1993486, , :
Cache index-aware memory allocation. ISMM : 55-64]]>https://dblp.org/rec/conf/iwmm/AfekDM11Sat, 01 Jan 2011 00:00:00 +0100 From bounded to unbounded concurrency objects and back.https://doi.org/10.1145/1993806.1993823, , :
From bounded to unbounded concurrency objects and back. PODC : 119-128]]>https://dblp.org/rec/conf/podc/AfekMW11Sat, 01 Jan 2011 00:00:00 +0100 Coping with context switches in lock-based software transactional memory.https://doi.org/10.1145/1987816.1987831, , :
Coping with context switches in lock-based software transactional memory. SYSTOR : 11]]>https://dblp.org/rec/conf/systor/AfekCM11Sat, 01 Jan 2011 00:00:00 +0100 Fast and Scalable Rendezvousing.https://doi.org/10.1007/978-3-642-24100-0_2, , :
Fast and Scalable Rendezvousing. DISC : 16-31]]>https://dblp.org/rec/conf/wdag/AfekHM11Sat, 01 Jan 2011 00:00:00 +0100 Brief announcement: view transactions: transactional model with relaxed consistency checks.https://doi.org/10.1145/1835698.1835711, , :
Brief announcement: view transactions: transactional model with relaxed consistency checks. PODC : 65-66]]>https://dblp.org/rec/conf/podc/AfekMT10Fri, 01 Jan 2010 00:00:00 +0100 Common2 extended to stacks and unbounded concurrency.https://doi.org/10.1007/s00446-007-0023-3, , :
Common2 extended to stacks and unbounded concurrency. Distributed Comput. 20(4): 239-252 ()]]>https://dblp.org/rec/journals/dc/AfekGM07Mon, 01 Jan 2007 00:00:00 +0100 Common2 extended to stacks and unbounded concurrency.https://doi.org/10.1145/1146381.1146415, , :
Common2 extended to stacks and unbounded concurrency. PODC : 218-227]]>https://dblp.org/rec/conf/podc/AfekGM06Sun, 01 Jan 2006 00:00:00 +0100