Dan Alistarh

CoRR, 2024

2023

Distributed Computing Column 86 The Environmental Cost of Our Conferences.

[BibT_eX]

[DOI]

SIGACT News, December, 2023

Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds.

[BibT_eX]

[DOI]

SIGACT News, September, 2023

The splay-list: a distribution-adaptive concurrent skip-list.

[BibT_eX]

[DOI]

Alexandra Drozdova

Amirkeivan Mohtashami

Distributed Comput., September, 2023

Why Extension-Based Proofs Fail.

[BibT_eX]

[DOI]

SIAM J. Comput., August, 2023

A Brief Summary of PODC 2022.

[BibT_eX]

[DOI]

SIGACT News, March, 2023

Distributed Computing Column 86: A Summary of PODC 2022.

[BibT_eX]

[DOI]

SIGACT News, March, 2023

Wait-free approximate agreement on graphs.

[BibT_eX]

[DOI]

Faith Ellen

Theor. Comput. Sci., February, 2023

CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.

[BibT_eX]

[DOI]

Dmitry Khalanskiy

Proc. ACM Program. Lang., 2023

How to Prune Your Language Model: Recovering Accuracy on the "Sparsity May Cry" Benchmark.

[BibT_eX]

[DOI]

CoRR, 2023

ELSA: Partial Weight Freezing for Overhead-Free Sparse Network Deployment.

[BibT_eX]

[DOI]

CoRR, 2023

AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithms.

[BibT_eX]

[DOI]

Rustem Islamov

Mher Safaryan

CoRR, 2023

QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Models.

[BibT_eX]

[DOI]

CoRR, 2023

Towards End-to-end 4-Bit Inference on Generative Large Language Models.

[BibT_eX]

[DOI]

CoRR, 2023

Sparse Fine-tuning for Inference Acceleration of Large Language Models.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Self-Adjusting Search Trees via Lazy Updates.

[BibT_eX]

[DOI]

Alexander Slastin

CoRR, 2023

Wait-free Trees with Asymptotically-Efficient Range Queries.

[BibT_eX]

[DOI]

Ilya Kokorin

CoRR, 2023

SPADE: Sparsity-Guided Debugging for Deep Neural Networks.

[BibT_eX]

[DOI]

Arshia Soltani Moakhar

Eugenia Iofinova

CoRR, 2023

Scaling Laws for Sparsely-Connected Foundation Models.

[BibT_eX]

[DOI]

CoRR, 2023

Accurate Neural Network Pruning Requires Rethinking Sparse Optimization.

[BibT_eX]

[DOI]

CoRR, 2023

Repeated Game Dynamics in Population Protocols.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Mehrdad Karrabi

John Lazarsfeld

CoRR, 2023

QIGen: Generating Efficient Kernels for Quantized Inference on Large Language Models.

[BibT_eX]

[DOI]

CoRR, 2023

Decentralized Learning Dynamics in the Gossip Model.

[BibT_eX]

[DOI]

John Lazarsfeld

CoRR, 2023

Error Feedback Can Accurately Compress Preconditioners.

[BibT_eX]

[DOI]

CoRR, 2023

SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression.

[BibT_eX]

[DOI]

CoRR, 2023

Vision Models Can Be Efficiently Specialized via Few-Shot Task-Aware Compression.

[BibT_eX]

[DOI]

CoRR, 2023

SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2023

ZipLM: Hardware-Aware Structured Pruning of Language Models.

[BibT_eX]

[DOI]

CoRR, 2023

Provably-Efficient and Internally-Deterministic Parallel Union-Find.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Fast and Scalable Channels in Kotlin Coroutines.

[BibT_eX]

[DOI]

Roman Elizarov

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Knowledge Distillation Performs Partial Variance Reduction.

[BibT_eX]

[DOI]

Mher Safaryan

Alexandra Peste

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

ZipLM: Inference-Aware Structured Pruning of Language Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Quantized Distributed Training of Large Models with Convergence Guarantees.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

SparseGPT: Massive Language Models Can be Accurately Pruned in One-Shot.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

CrAM: A Compression-Aware Minimizer.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

OPTQ: Accurate Quantization for Generative Pre-trained Transformers.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.

[BibT_eX]

[DOI]

Eugenia Iofinova

Alexandra Peste

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Elastic Consistency: A Consistency Criterion for Distributed Optimization.

[BibT_eX]

[DOI]

SIGACT News, 2022

Distributed Computing Column 85 Elastic Consistency: A Consistency Criterion for Distributed Optimization.

[BibT_eX]

[DOI]

Mohammadreza Alimohammadi

SIGACT News, 2022

L-GreCo: An Efficient and General Framework for Layerwise-Adaptive Gradient Compression.

[BibT_eX]

[DOI]

CoRR, 2022

GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers.

[BibT_eX]

[DOI]

CoRR, 2022

oViT: An Accurate Second-Order Pruning Framework for Vision Transformers.

[BibT_eX]

[DOI]

CoRR, 2022

Hybrid Decentralized Optimization: First- and Zeroth-Order Optimizers Can Be Jointly Leveraged For Faster Convergence.

[BibT_eX]

[DOI]

Shayan Talaei

CoRR, 2022

GMP*: Well-Tuned Global Magnitude Pruning Can Outperform Most BERT-Pruning Methods.

[BibT_eX]

[DOI]

CoRR, 2022

CrAM: A Compression-Aware Minimizer.

[BibT_eX]

[DOI]

CoRR, 2022

QuAFL: Federated Averaging Can Be Both Asynchronous and Communication-Efficient.

[BibT_eX]

[DOI]

CoRR, 2022

Scaling the Wild: Decentralizing Hogwild!-style Shared-memory SGD.

[BibT_eX]

[DOI]

CoRR, 2022

Dynamic Averaging Load Balancing on Cycles.

[BibT_eX]

[DOI]

Amirmojtaba Sabour

Algorithmica, 2022

Multi-queues can be state-of-the-art priority schedulers.

[BibT_eX]

[DOI]

Anastasiia Postnikova

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

PathCAS: an efficient middle ground for concurrent search data structures.

[BibT_eX]

[DOI]

William Sigouin

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Near-Optimal Leader Election in Population Protocols on Graphs.

[BibT_eX]

[DOI]

Sasha Voitovych

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

CGX: adaptive system support for communication-efficient deep learning.

[BibT_eX]

[DOI]

Hamidreza Ramezani-Kebrya

Proceedings of the Middleware '22: 23rd International Middleware Conference, Quebec, QC, Canada, November 7, 2022

SPDY: Accurate Pruning with Speedup Guarantees.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models.

[BibT_eX]

[DOI]

Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, 2022

How Well Do Sparse ImageNet Models Transfer?

[BibT_eX]

[DOI]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021

Breaking (Global) Barriers in Parallel Stochastic Optimization With Wait-Avoiding Group Averaging.

[BibT_eX]

[DOI]

Shigang Li

Tal Ben-Nun

Salvatore Di Girolamo

Nikoli Dryden

IEEE Trans. Parallel Distributed Syst., 2021

Distributed Computing Column 84: Perspectives on the Paper "CCS Expressions, Finite State Processes, and Three Problems of Equivalence".

[BibT_eX]

[DOI]

SIGACT News, 2021

Distributed Computing Column 83 Five Ways Not To Fool Yourself: Designing Experiments for Understanding Performance.

[BibT_eX]

[DOI]

SIGACT News, 2021

Distributed Computing Column 82 Distributed Computability: A Few Results Masters Students Should Know.

[BibT_eX]

[DOI]

SIGACT News, 2021

Distributed Computing Column 81: Byzantine Agreement with Less Communication: Recent Advances.

[BibT_eX]

[DOI]

SIGACT News, 2021

NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

A Formally-Verified Framework for Fair Synchronization in Kotlin Coroutines.

[BibT_eX]

[DOI]

Dmitry Khalanskiy

CoRR, 2021

Project CGX: Scalable Deep Learning on Commodity GPUs.

[BibT_eX]

[DOI]

Hamidreza Ramezani-Kebrya

CoRR, 2021

SSSE: Efficiently Erasing Samples from Trained Machine Learning Models.

[BibT_eX]

[DOI]

Alexandra Peste

Christoph H. Lampert

CoRR, 2021

Efficient Matrix-Free Approximations of Second-Order Information, with Applications to Pruning and Optimization.

[BibT_eX]

[DOI]

CoRR, 2021

Brief Announcement: Fast Graphical Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

A Scalable Concurrent Algorithm for Dynamic Connectivity.

[BibT_eX]

[DOI]

Alexander Fedorov

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Collecting Coupons is Faster with Friends.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2021

Comparison Dynamics in Population Protocols.

[BibT_eX]

[DOI]

Martin Töpfer

Przemyslaw Uznanski

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Fast Graphical Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Asynchronous Decentralized SGD with Quantized and Local Updates.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Towards Tight Communication Lower Bounds for Distributed Optimisation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Distributed Principal Component Analysis with Limited Communication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Communication-Efficient Distributed Optimization with Quantized Preconditioners.

[BibT_eX]

[DOI]

Foivos Alimisis

Proceedings of the 38th International Conference on Machine Learning, 2021

New Bounds For Distributed Mean Estimation and Variance Reduction.

[BibT_eX]

[DOI]

Vijaykrishna Gurunanthan

Niusha Moshrefi

Saleh Ashkboos

Proceedings of the 9th International Conference on Learning Representations, 2021

Byzantine-Resilient Non-Convex Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Zeyuan Allen-Zhu

Faeze Ebrahimianghazani

Jerry Li

Proceedings of the 9th International Conference on Learning Representations, 2021

Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.

[BibT_eX]

[DOI]

Malcolm Egan

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Compressive Sensing Using Iterative Hard Thresholding With Low Precision Data Representation: Theory and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2020

Distributed Computing Column 80: Annual Review 2020.

[BibT_eX]

[DOI]

SIGACT News, 2020

Distributed Computing Column 79: Using Round Elimination to Understand Locality.

[BibT_eX]

[DOI]

SIGACT News, 2020

Distributed Computing Column 78: 60 Years of Mastering Concurrent Computing through Sequential Thinking.

[BibT_eX]

[DOI]

SIGACT News, 2020

Distributed Computing Column 77 Consensus Dynamics: An Overview.

[BibT_eX]

[DOI]

SIGACT News, 2020

Improved Communication Lower Bounds for Distributed Optimisation.

[BibT_eX]

[DOI]

CoRR, 2020

Fast General Distributed Transactions with Opacity using Global Time.

[BibT_eX]

[DOI]

Alex Shamis

Matthew Renzelmann

Stanko Novakovic

Georgios Chatzopoulos

Anders T. Gjerdrum

Aleksandar Dragojevic

Dushyanth Narayanan

Miguel Castro

CoRR, 2020

Stochastic Gradient Langevin with Delayed Gradients.

[BibT_eX]

[DOI]

CoRR, 2020

Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.

[BibT_eX]

[DOI]

Shigang Li

Tal Ben-Nun

Salvatore Di Girolamo

Nikoli Dryden

CoRR, 2020

WoodFisher: Efficient second-order approximations for model compression.

[BibT_eX]

[DOI]

Sidak Pal Singh

CoRR, 2020

Robust Comparison in Population Protocols.

[BibT_eX]

[DOI]

Martin Töpfer

Przemyslaw Uznanski

CoRR, 2020

Relaxed Scheduling for Scalable Belief Propagation.

[BibT_eX]

[DOI]

CoRR, 2020

Distributed Mean Estimation with Optimal Error Bounds.

[BibT_eX]

[DOI]

Saleh Ashkboos

CoRR, 2020

Elastic Consistency: A General Consistency Model for Distributed Stochastic Gradient Descent.

[BibT_eX]

[DOI]

CoRR, 2020

Analysis and Evaluation of Non-Blocking Interpolation Search Trees.

[BibT_eX]

[DOI]

Aleksandar Prokopec

CoRR, 2020

Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.

[BibT_eX]

[DOI]

Nandini Singhal

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Taming unbalanced training workloads in deep learning with partial collective operations.

[BibT_eX]

[DOI]

Shigang Li

Tal Ben-Nun

Salvatore Di Girolamo

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Testing concurrency on the JVM with lincheck.

[BibT_eX]

[DOI]

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Non-blocking interpolation search trees with doubly-logarithmic running time.

[BibT_eX]

[DOI]

Aleksandar Prokopec

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Brief Announcement: Why Extension-Based Proofs Fail.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.

[BibT_eX]

[DOI]

Sidak Pal Singh

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adaptive Gradient Quantization for Data-Parallel SGD.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Scalable Belief Propagation via Relaxed Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

On the Sample Complexity of Adversarial Multi-Source PAC Learning.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Distributed Computing Column 76: Annual Review 2019.

[BibT_eX]

[DOI]

SIGACT News, 2019

PopSGD: Decentralized Stochastic Gradient Descent in the Population Model.

[BibT_eX]

[DOI]

CoRR, 2019

Performance Prediction for Coarse-Grained Locking.

[BibT_eX]

[DOI]

Dimitris S. Papailiopoulos

Petr Kuznetsov

CoRR, 2019

SysML: The New Frontier of Machine Learning Systems.

[BibT_eX]

[DOI]

Alexandros G. Dimakis

Anastasios Kyrillidis

Shivaram Venkataraman

CoRR, 2019

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

SparCML: high-performance sparse communication for machine learning.

[BibT_eX]

[DOI]

Proceedings of the International Conference for High Performance Computing, 2019

Lock-free channels for programming via communicating sequential processes: poster.

[BibT_eX]

[DOI]

Roman Elizarov

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

In Search of the Fastest Concurrent Union-Find Algorithm.

[BibT_eX]

[DOI]

Alexander Fedorov

Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Powerset Convolutional Neural Networks.

[BibT_eX]

[DOI]

Chris Wendler

Markus Püschel

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Distributed Learning over Unreliable Networks.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Scalable FIFO Channels for Programming via Communicating Sequential Processes.

[BibT_eX]

[DOI]

Roman Elizarov

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018

ThreadScan: Automatic and Scalable Memory Reclamation.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2018

Recent Algorithmic Advances in Population Protocols.

[BibT_eX]

[DOI]

SIGACT News, 2018

Inherent limitations of hybrid transactional memory.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Communication-efficient randomized consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2018

SparCML: High-Performance Sparse Communication for Machine Learning.

[BibT_eX]

[DOI]

Cédric Renggli

CoRR, 2018

Compressive Sensing with Low Precision Data Representation: Radio Astronomy and Beyond.

[BibT_eX]

[DOI]

CoRR, 2018

DataBright: Towards a Global Exchange for Decentralized Data Ownership and Trusted Computation.

[BibT_eX]

[DOI]

CoRR, 2018

The Transactional Conflict Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Distributionally Linearizable Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Space-Optimal Majority in Population Protocols.

[BibT_eX]

[DOI]

James Aspnes

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Fast Quantized Arithmetic on x86: Trading Compute for Data Movement.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Workshop on Signal Processing Systems, 2018

The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.

[BibT_eX]

[DOI]

Christopher De Sa

Nikola Konstantinov

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

A Brief Tutorial on Distributed and Concurrent Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Session details: Session 1B: Shared Memory Theory.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Brief Announcement: Performance Prediction for Coarse-Grained Locking.

[BibT_eX]

[DOI]

Petr Kuznetsov

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

The Convergence of Sparsified Gradient Methods.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Byzantine Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Zeyuan Allen-Zhu

Jerry Li

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Model compression via distillation and quantization.

[BibT_eX]

[DOI]

Antonio Polino

Razvan Pascanu

Proceedings of the 6th International Conference on Learning Representations, 2018

Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Extending Database Technology, 2018

Gradient compression for communication-limited convex optimization.

[BibT_eX]

[DOI]

Sarit Khirirat

Mikael Johansson

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017

Lease/Release: Architectural Support for Scaling Contended Data Structures.

[BibT_eX]

[DOI]

Syed Kamran Haider

William Hasenplaugh

ACM Trans. Parallel Comput., 2017

Time-Space Trade-offs in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

The Power of Choice in Priority Scheduling.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2017

Forkscan: Conservative Memory Reclamation for Modern Operating Systems.

[BibT_eX]

[DOI]

Proceedings of the Twelfth European Conference on Computer Systems, 2017

Robust Detection in Leak-Prone Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Towards unlicensed cellular networks in TV white spaces.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

2016

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

[BibT_eX]

[DOI]

Keren Censor-Hillel

Nir Shavit

J. ACM, 2016

ZipML: An End-to-end Bitwise Framework for Dense Generalized Linear Models.

[BibT_eX]

[DOI]

CoRR, 2016

QSGD: Randomized Quantization for Communication-Optimal Stochastic Gradient Descent.

[BibT_eX]

[DOI]

CoRR, 2016

2015

The Renaming Problem: Recent Developments and Open Questions.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States.

[BibT_eX]

[DOI]

CoRR, 2015

A High-Radix, Low-Latency Optical Switch for Data Centers.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

The SprayList: a scalable relaxed priority queue.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

Lock-Free Algorithms under Stochastic Schedulers.

[BibT_eX]

[DOI]

Thomas Sauerwald

Milan Vojnovic

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

How To Elect a Leader Faster than a Tournament.

[BibT_eX]

[DOI]

Adrian Vladu

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Fast and Exact Majority in Population Protocols.

[BibT_eX]

[DOI]

Milan Vojnovic

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Streaming Min-max Hypergraph Partitioning.

[BibT_eX]

[DOI]

Jennifer Iglesias

Milan Vojnovic

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Polylogarithmic-Time Leader Election in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Tight Bounds for Asynchronous Renaming.

[BibT_eX]

[DOI]

J. ACM, 2014

Dynamic Task Allocation in Asynchronous Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Brief announcement: are lock-free concurrent algorithms practically wait-free?

[BibT_eX]

[DOI]

Keren Censor-Hillel

Nir Shavit

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

StackTrack: an automated transactional approach to concurrent memory reclamation.

[BibT_eX]

[DOI]

Proceedings of the Ninth Eurosys Conference 2014, 2014

Distributed Algorithms.

[BibT_eX]

Rachid Guerraoui

Proceedings of the Computing Handbook, 2014

2013

Randomized loose renaming in O(log log n) time.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Randomized versus Deterministic Implementations of Concurrent Data Structures.

[BibT_eX]

[DOI]

PhD thesis, 2012

Generating Fast Indulgent Algorithms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.

[BibT_eX]

[DOI]

Algorithmica, 2012

On the cost of composing shared-memory algorithms.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

How to Allocate Tasks Asynchronously.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Sub-logarithmic Test-and-Set against a Weak Adversary.

[BibT_eX]

[DOI]

James Aspnes

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Optimal-time adaptive strong renaming, with applications to counting.

[BibT_eX]

[DOI]

Morteza Zadimoghaddam

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

The Complexity of Renaming.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Brief Announcement: New Bounds for Partially Synchronous Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Fast Randomized Test-and-Set and Renaming.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Securing every bit: authenticated broadcast in radio networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).

[BibT_eX]

[DOI]