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. 2023. Provably-efficient and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 261–271.
[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. 2022. Multi-queues can be state-of-the-art priority schedulers. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 353–367.
[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. 2022. Multi-queues can be state-of-the-art priority schedulers, Zenodo, 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. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 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, Girolamo SD, Dryden N, Alistarh D-A, Hoefler T. 2021. Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. 32(7), 9271898.
[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. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[6]
2021 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.
[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. 2021. Asynchronous decentralized SGD with quantized and local updates. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.
[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. 2021. Dynamic averaging load balancing on cycles. Algorithmica.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 145–154.
[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. 2017. The power of choice in priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed

12 Publications

Mark all

[12]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. 2023. Provably-efficient and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 261–271.
[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. 2022. Multi-queues can be state-of-the-art priority schedulers. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 353–367.
[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. 2022. Multi-queues can be state-of-the-art priority schedulers, Zenodo, 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. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 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, Girolamo SD, Dryden N, Alistarh D-A, Hoefler T. 2021. Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. 32(7), 9271898.
[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. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[6]
2021 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.
[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. 2021. Asynchronous decentralized SGD with quantized and local updates. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.
[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. 2021. Dynamic averaging load balancing on cycles. Algorithmica.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 145–154.
[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. 2017. The power of choice in priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed