Giorgi Nadiradze

Graduate School
Alistarh Group

12 Publications

Mark all

[12]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “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, 353–67. Association for Computing Machinery, 2022. https://doi.org/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, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Zenodo, 2022. https://doi.org/10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[9]
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “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. https://doi.org/10.4230/LIPIcs.DISC.2021.4.
[Published Version] View | Files available | DOI
 
[8]
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Giorgi Nadiradze, Salvatore Di Girolamo, Nikoli Dryden, Dan-Adrian Alistarh, and Torsten Hoefler. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2021. https://doi.org/10.1109/TPDS.2020.3040606.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[6]
2021 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429.
[Published Version] View | Files available | DOI
 
[5]
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “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, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2021. https://doi.org/10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “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. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2017 | Conference Paper | IST-REx-ID: 791 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed

12 Publications

Mark all

[12]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “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, 353–67. Association for Computing Machinery, 2022. https://doi.org/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, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Zenodo, 2022. https://doi.org/10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[9]
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “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. https://doi.org/10.4230/LIPIcs.DISC.2021.4.
[Published Version] View | Files available | DOI
 
[8]
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Giorgi Nadiradze, Salvatore Di Girolamo, Nikoli Dryden, Dan-Adrian Alistarh, and Torsten Hoefler. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2021. https://doi.org/10.1109/TPDS.2020.3040606.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[6]
2021 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429.
[Published Version] View | Files available | DOI
 
[5]
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “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, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2021. https://doi.org/10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “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. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2017 | Conference Paper | IST-REx-ID: 791 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed