Giorgi Nadiradze

Graduate School
Alistarh Group

12 Publications

Mark all

[12]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271. doi:10.1145/3558481.3591082
[Published Version] View | Files available | DOI | arXiv
 
[11]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2022:353-367. doi:10.1145/3503221.3508432
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. 2022. doi:10.5281/ZENODO.5733408
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[9]
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.4
[Published Version] View | Files available | DOI
 
[8]
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li S, Tal Ben-Nun TB-N, Nadiradze G, et al. Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. 2021;32(7). doi:10.1109/TPDS.2020.3040606
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[6]
2021 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
[Published Version] View | Files available | DOI
 
[5]
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized SGD with quantized and local updates. In: 35th Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation; 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[4]
2021 | Journal Article | IST-REx-ID: 8286 | OA
Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. Algorithmica. 2021. doi:10.1007/s00453-021-00905-9
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7
[Published Version] View | Files available | DOI | arXiv
 
[2]
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: AMA

    Export / Embed

12 Publications

Mark all

[12]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271. doi:10.1145/3558481.3591082
[Published Version] View | Files available | DOI | arXiv
 
[11]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2022:353-367. doi:10.1145/3503221.3508432
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. 2022. doi:10.5281/ZENODO.5733408
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[9]
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.4
[Published Version] View | Files available | DOI
 
[8]
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li S, Tal Ben-Nun TB-N, Nadiradze G, et al. Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. 2021;32(7). doi:10.1109/TPDS.2020.3040606
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[6]
2021 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
[Published Version] View | Files available | DOI
 
[5]
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized SGD with quantized and local updates. In: 35th Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation; 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[4]
2021 | Journal Article | IST-REx-ID: 8286 | OA
Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. Algorithmica. 2021. doi:10.1007/s00453-021-00905-9
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7
[Published Version] View | Files available | DOI | arXiv
 
[2]
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: AMA

    Export / Embed