Adam Morrison

According to our database1, Adam Morrison authored at least 42 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Specification and space complexity of collaborative text editing.
Theor. Comput. Sci., 2021

Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

2020
Proving highly-concurrent traversals correct.
Proc. ACM Program. Lang., 2020

Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data.
IEEE Micro, 2020

Speculative Interference Attacks: Breaking Invisible Speculation Schemes.
CoRR, 2020

Speeding up SpMV for power-law graph analytics by enhancing locality & vectorization.
Proceedings of the SC '20: The International Conference for High Performance Computing, 2020

Scaling concurrent queues by using HTM to profit from failed atomic operations.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Speculation Invariance (InvarSpec): Faster Safe Execution Through Program Analysis.
Proceedings of the 53rd Annual IEEE/ACM International Symposium on Microarchitecture, 2020

Speculative Data-Oblivious Execution: Mobilizing Safe Prediction For Safe and Efficient Speculative Execution.
Proceedings of the 47th ACM/IEEE Annual International Symposium on Computer Architecture, 2020

V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging.
Proceedings of the ICS '20: 2020 International Conference on Supercomputing, 2020

Snug: architectural support for relaxed concurrent priority queueing in chip multiprocessors.
Proceedings of the ICS '20: 2020 International Conference on Supercomputing, 2020

IOctopus: Outsmarting Nonuniform DMA.
Proceedings of the ASPLOS '20: Architectural Support for Programming Languages and Operating Systems, 2020

2019
Understanding priority-based scheduling of graph algorithms on a shared-memory platform.
Proceedings of the International Conference for High Performance Computing, 2019

InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy (Corrigendum).
Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture, 2019

2018
Order out of Chaos: Proving Linearizability Using Local Views.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Getting to the Root of Concurrent Binary Search Tree Performance.
Proceedings of the 2018 USENIX Annual Technical Conference, 2018

Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy.
Proceedings of the 51st Annual IEEE/ACM International Symposium on Microarchitecture, 2018

DAMN: Overhead-Free IOMMU Protection for Networking.
Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, 2018

2017
Limitations of Highly-Available Eventually-Consistent Data Stores.
IEEE Trans. Parallel Distributed Syst., 2017

2016
Scaling synchronization in multicore programs.
Commun. ACM, 2016

Specification and Complexity of Collaborative Text Editing.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

True IOMMU Protection from DMA Attacks: When Copy is Faster than Zero Copy.
Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, 2016

CASPAR: Breaking Serialization in Lock-Free Multicore Synchronization.
Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, 2016

2015
Utilizing the IOMMU Scalably.
Proceedings of the 2015 USENIX Annual Technical Conference, 2015

Predicate RCU: an RCU for scalable concurrent updates.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Temporally Bounding TSO for Fence-Free Asymmetric Synchronization.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014
The CB tree: a practical concurrent self-adjusting search tree.
Distributed Comput., 2014

Software-improved hardware lock elision.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Fence-free work stealing on bounded TSO processors.
Proceedings of the Architectural Support for Programming Languages and Operating Systems, 2014

2013
Fast and scalable rendezvousing.
Distributed Comput., 2013

Fast concurrent queues for x86 processors.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Programming with hardware lock elision.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

2012
CBTree: A Practical Concurrent Self-Adjusting Search Tree.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011
A review of DISC 2011.
SIGACT News, 2011

Coping with context switches in lock-based software transactional memory.
Proceedings of of SYSTOR 2011: The 4th Annual Haifa Experimental Systems Conference, Haifa, Israel, May 30, 2011

From bounded to unbounded concurrency objects and back.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Cache index-aware memory allocation.
Proceedings of the 10th International Symposium on Memory Management, 2011

2010
Brief announcement: view transactions: transactional model with relaxed consistency checks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2007
Common2 extended to stacks and unbounded concurrency.
Distributed Comput., 2007


  Loading...