39 Publications

Mark all

[39]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2020:37-49. doi:10.1145/3350755.3400213
View | DOI
 
[38]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.15
View | Files available | DOI | arXiv
 
[37]
2020 | Conference Paper | IST-REx-ID: 7635
Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. ACM; 2020:423-424. doi:10.1145/3332466.3374503
View | DOI
 
[36]
2020 | Conference Paper | IST-REx-ID: 7636
Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. ACM; 2020:276-291. doi:10.1145/3332466.3374542
View | DOI
 
[35]
2019 | Conference Paper | IST-REx-ID: 7542 | OA
Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.
View | Download Preprint (ext.) | arXiv
 
[34]
2019 | Conference Poster | IST-REx-ID: 6485
Koval N, Alistarh D-A, Elizarov R. Lock-Free Channels for Programming via Communicating Sequential Processes. ACM Press; 2019:417-418. doi:10.1145/3293883.3297000
View | DOI
 
[33]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201
View | DOI | Download Preprint (ext.) | arXiv
 
[32]
2019 | Conference Paper | IST-REx-ID: 6676 | OA
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Why extension-based proofs fail. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ACM Press; 2019:986-996. doi:10.1145/3313276.3316407
View | DOI | Download Preprint (ext.) | arXiv
 
[31]
2019 | Conference Paper | IST-REx-ID: 7122
Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited convex optimization. In: 2018 IEEE Conference on Decision and Control. IEEE; 2019. doi:10.1109/cdc.2018.8619625
View | DOI
 
[30]
2019 | Conference Paper | IST-REx-ID: 7201 | OA
Renggli C, Ashkboos S, Aghagolzadeh M, Alistarh D-A, Hoefler T. SparCML: High-performance sparse communication for machine learning. In: International Conference for High Performance Computing, Networking, Storage and Analysis, SC. ACM; 2019. doi:10.1145/3295500.3356222
View | DOI | Download Preprint (ext.) | arXiv
 
[29]
2019 | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23
View | DOI
 
[28]
2019 | Conference Paper | IST-REx-ID: 7437 | OA
Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: 36th International Conference on Machine Learning, ICML 2019. Vol 2019-June. IMLS; 2019:12481-12512.
View | Download Preprint (ext.) | arXiv
 
[27]
2018 | Conference Paper | IST-REx-ID: 7123 | OA
Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144
View | DOI | Download Preprint (ext.) | arXiv
 
[26]
2018 | Journal Article | IST-REx-ID: 536 | OA
Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1
View | Files available | DOI
 
[25]
2018 | Conference Paper | IST-REx-ID: 5961
Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798
View | DOI
 
[24]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:169-178. doi:10.1145/3212734.3212763
View | DOI | Download Preprint (ext.) | arXiv
 
[23]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756
View | DOI | Download Preprint (ext.) | arXiv
 
[22]
2018 | Conference Paper | IST-REx-ID: 5964 | OA
Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785
View | DOI | Download Submitted Version (ext.)
 
[21]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411
View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2018 | Conference Paper | IST-REx-ID: 5966 | OA
Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406
View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2018 | Journal Article | IST-REx-ID: 6001
Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4). doi:10.1145/3201897
View | Files available | DOI
 
[18]
2018 | Conference Paper | IST-REx-ID: 6031
Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: 2018 IEEE International Workshop on Signal Processing Systems. Vol 2018-October. IEEE; 2018. doi:10.1109/SiPS.2018.8598402
View | DOI
 
[17]
2018 | Conference Paper | IST-REx-ID: 6558 | OA
Alistarh D-A, Allen-Zhu Z, Li J. Byzantine Stochastic Gradient Descent. In: Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Advances in Neural Information Processing Systems. Vol Volume 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.
View | Download Published Version (ext.) | arXiv
 
[16]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: Advances in Neural Information Processing Systems 31. Vol Volume 2018. Neural information processing systems; 2018:5973-5983.
View | Download Preprint (ext.) | arXiv
 
[15]
2018 | Conference Paper | IST-REx-ID: 7116 | OA
Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14
View | Files available | DOI
 
[14]
2018 | Conference Paper | IST-REx-ID: 7812 | OA
Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 2018.
View | Files available | arXiv
 
[13]
2017 | Conference Paper | IST-REx-ID: 431 | OA
Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing Systems Foundation, Inc.; 2017:1710-1721.
View | Download Submitted Version (ext.) | arXiv
 
[12]
2017 | Conference Paper | IST-REx-ID: 787 | OA
Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. Time-space trade-offs in population protocols. In: SIAM; 2017:2560-2579. doi:doi.org/10.1137/1.9781611974782.169
View | DOI | Download None (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 788 | OA
Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. Robust detection in leak-prone population protocols. In: Vol 10467 LNCS. Springer; 2017:155-171. doi:10.1007/978-3-319-66799-7_11
View | DOI | Download None (ext.)
 
[10]
2017 | Conference Paper | IST-REx-ID: 789
Alistarh D-A, Leiserson W, Matveev A, Shavit N. Forkscan: Conservative memory reclamation for modern operating systems. In: ACM; 2017:483-498. doi:10.1145/3064176.3064214
View | DOI
 
[9]
2017 | Conference Paper | IST-REx-ID: 790
Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. FPGA-accelerated dense linear machine learning: A precision-convergence trade-off. In: IEEE; 2017:160-167. doi:10.1109/FCCM.2017.39
View | DOI
 
[8]
2017 | Conference Paper | IST-REx-ID: 432 | OA
Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In: Proceedings of Machine Learning Research. Vol 70. PMLR; 2017:4035-4043.
View | Files available
 
[7]
2017 | Conference Paper | IST-REx-ID: 487
Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367
View | DOI
 
[6]
2017 | Conference Paper | IST-REx-ID: 791 | OA
Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority scheduling. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Vol Part F129314. ACM; 2017:283-292. doi:10.1145/3087801.3087810
View | DOI | Download Submitted Version (ext.)
 
[5]
2016 | Conference Paper | IST-REx-ID: 785
Haider S, Hasenplaugh W, Alistarh D-A. Lease/Release: Architectural support for scaling contended data structures. In: Vol 12-16-March-2016. ACM; 2016. doi:10.1145/2851141.2851155
View | DOI
 
[4]
2016 | Journal Article | IST-REx-ID: 786 | OA
Alistarh D-A, Censor Hillel K, Shavit N. Are lock free concurrent algorithms practically wait free . Journal of the ACM. 2016;63(4). doi:10.1145/2903136
View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2015 | Conference Paper | IST-REx-ID: 778 | OA
Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13
View | DOI | Download None (ext.) | arXiv
 
[2]
2015 | Conference Paper | IST-REx-ID: 780 | OA
Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2015 | Conference Paper | IST-REx-ID: 784
Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035
View | DOI
 

Search

Filter Publications

39 Publications

Mark all

[39]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2020:37-49. doi:10.1145/3350755.3400213
View | DOI
 
[38]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.15
View | Files available | DOI | arXiv
 
[37]
2020 | Conference Paper | IST-REx-ID: 7635
Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. ACM; 2020:423-424. doi:10.1145/3332466.3374503
View | DOI
 
[36]
2020 | Conference Paper | IST-REx-ID: 7636
Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. ACM; 2020:276-291. doi:10.1145/3332466.3374542
View | DOI
 
[35]
2019 | Conference Paper | IST-REx-ID: 7542 | OA
Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.
View | Download Preprint (ext.) | arXiv
 
[34]
2019 | Conference Poster | IST-REx-ID: 6485
Koval N, Alistarh D-A, Elizarov R. Lock-Free Channels for Programming via Communicating Sequential Processes. ACM Press; 2019:417-418. doi:10.1145/3293883.3297000
View | DOI
 
[33]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201
View | DOI | Download Preprint (ext.) | arXiv
 
[32]
2019 | Conference Paper | IST-REx-ID: 6676 | OA
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Why extension-based proofs fail. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ACM Press; 2019:986-996. doi:10.1145/3313276.3316407
View | DOI | Download Preprint (ext.) | arXiv
 
[31]
2019 | Conference Paper | IST-REx-ID: 7122
Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited convex optimization. In: 2018 IEEE Conference on Decision and Control. IEEE; 2019. doi:10.1109/cdc.2018.8619625
View | DOI
 
[30]
2019 | Conference Paper | IST-REx-ID: 7201 | OA
Renggli C, Ashkboos S, Aghagolzadeh M, Alistarh D-A, Hoefler T. SparCML: High-performance sparse communication for machine learning. In: International Conference for High Performance Computing, Networking, Storage and Analysis, SC. ACM; 2019. doi:10.1145/3295500.3356222
View | DOI | Download Preprint (ext.) | arXiv
 
[29]
2019 | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23
View | DOI
 
[28]
2019 | Conference Paper | IST-REx-ID: 7437 | OA
Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: 36th International Conference on Machine Learning, ICML 2019. Vol 2019-June. IMLS; 2019:12481-12512.
View | Download Preprint (ext.) | arXiv
 
[27]
2018 | Conference Paper | IST-REx-ID: 7123 | OA
Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144
View | DOI | Download Preprint (ext.) | arXiv
 
[26]
2018 | Journal Article | IST-REx-ID: 536 | OA
Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1
View | Files available | DOI
 
[25]
2018 | Conference Paper | IST-REx-ID: 5961
Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798
View | DOI
 
[24]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:169-178. doi:10.1145/3212734.3212763
View | DOI | Download Preprint (ext.) | arXiv
 
[23]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756
View | DOI | Download Preprint (ext.) | arXiv
 
[22]
2018 | Conference Paper | IST-REx-ID: 5964 | OA
Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785
View | DOI | Download Submitted Version (ext.)
 
[21]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411
View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2018 | Conference Paper | IST-REx-ID: 5966 | OA
Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406
View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2018 | Journal Article | IST-REx-ID: 6001
Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4). doi:10.1145/3201897
View | Files available | DOI
 
[18]
2018 | Conference Paper | IST-REx-ID: 6031
Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: 2018 IEEE International Workshop on Signal Processing Systems. Vol 2018-October. IEEE; 2018. doi:10.1109/SiPS.2018.8598402
View | DOI
 
[17]
2018 | Conference Paper | IST-REx-ID: 6558 | OA
Alistarh D-A, Allen-Zhu Z, Li J. Byzantine Stochastic Gradient Descent. In: Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Advances in Neural Information Processing Systems. Vol Volume 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.
View | Download Published Version (ext.) | arXiv
 
[16]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: Advances in Neural Information Processing Systems 31. Vol Volume 2018. Neural information processing systems; 2018:5973-5983.
View | Download Preprint (ext.) | arXiv
 
[15]
2018 | Conference Paper | IST-REx-ID: 7116 | OA
Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14
View | Files available | DOI
 
[14]
2018 | Conference Paper | IST-REx-ID: 7812 | OA
Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 2018.
View | Files available | arXiv
 
[13]
2017 | Conference Paper | IST-REx-ID: 431 | OA
Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing Systems Foundation, Inc.; 2017:1710-1721.
View | Download Submitted Version (ext.) | arXiv
 
[12]
2017 | Conference Paper | IST-REx-ID: 787 | OA
Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. Time-space trade-offs in population protocols. In: SIAM; 2017:2560-2579. doi:doi.org/10.1137/1.9781611974782.169
View | DOI | Download None (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 788 | OA
Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. Robust detection in leak-prone population protocols. In: Vol 10467 LNCS. Springer; 2017:155-171. doi:10.1007/978-3-319-66799-7_11
View | DOI | Download None (ext.)
 
[10]
2017 | Conference Paper | IST-REx-ID: 789
Alistarh D-A, Leiserson W, Matveev A, Shavit N. Forkscan: Conservative memory reclamation for modern operating systems. In: ACM; 2017:483-498. doi:10.1145/3064176.3064214
View | DOI
 
[9]
2017 | Conference Paper | IST-REx-ID: 790
Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. FPGA-accelerated dense linear machine learning: A precision-convergence trade-off. In: IEEE; 2017:160-167. doi:10.1109/FCCM.2017.39
View | DOI
 
[8]
2017 | Conference Paper | IST-REx-ID: 432 | OA
Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In: Proceedings of Machine Learning Research. Vol 70. PMLR; 2017:4035-4043.
View | Files available
 
[7]
2017 | Conference Paper | IST-REx-ID: 487
Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367
View | DOI
 
[6]
2017 | Conference Paper | IST-REx-ID: 791 | OA
Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority scheduling. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Vol Part F129314. ACM; 2017:283-292. doi:10.1145/3087801.3087810
View | DOI | Download Submitted Version (ext.)
 
[5]
2016 | Conference Paper | IST-REx-ID: 785
Haider S, Hasenplaugh W, Alistarh D-A. Lease/Release: Architectural support for scaling contended data structures. In: Vol 12-16-March-2016. ACM; 2016. doi:10.1145/2851141.2851155
View | DOI
 
[4]
2016 | Journal Article | IST-REx-ID: 786 | OA
Alistarh D-A, Censor Hillel K, Shavit N. Are lock free concurrent algorithms practically wait free . Journal of the ACM. 2016;63(4). doi:10.1145/2903136
View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2015 | Conference Paper | IST-REx-ID: 778 | OA
Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13
View | DOI | Download None (ext.) | arXiv
 
[2]
2015 | Conference Paper | IST-REx-ID: 780 | OA
Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2015 | Conference Paper | IST-REx-ID: 784
Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035
View | DOI
 

Search

Filter Publications