{"id":27,"date":"2014-03-18T19:19:43","date_gmt":"2014-03-18T19:19:43","guid":{"rendered":"http:\/\/people.csail.mit.edu\/amatveev\/MCA\/?page_id=27"},"modified":"2023-02-13T07:36:46","modified_gmt":"2023-02-13T07:36:46","slug":"publications-3","status":"publish","type":"page","link":"https:\/\/mag-r1.csail.mit.edu\/?page_id=27","title":{"rendered":"Publications"},"content":{"rendered":"
\n

Journal Publications<\/strong><\/h4>\n
\n
2020<\/h5>\n

<\/strong>
\nA complexity-based classification for multiprocessor synchronization.<\/a><\/strong> Ellen, Faith, Gelashvili, Rati, Shavit, Nir, Zhu, Leqi. Distributed Comput. 33(2): 125-144, 2020. <\/p>\n

2015<\/strong><\/h5>\n

Lock Cohorting: A General Technique for Designing NUMA Locks<\/a><\/span><\/strong>. David Dice, Virendra J. Marathe and Nir Shavit. ACM Trans. Parallel Comput.<\/em> Vol. 1, Issue 2, Article 13 (February 2015), 42 pages.<\/p>\n

\n

Conference Publications<\/strong><\/h4>\n
\n
2017<\/strong><\/h5>\n

The power of choice in priority scheduling<\/strong>. Dan Alistarh, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. Proceedings of the ACM Symposium on Principles of Distributed Computing (New York, NY, USA), PODC \u201917, ACM, 2017, pp. 283\u2013292.<\/p>\n

2015<\/strong><\/h5>\n

On the Optimal Space Complexity of Consensus for Anonymous Processes<\/a><\/span><\/strong>. Rati Gelashvili. In proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), Tokyo, Japan, October 2015. Best Paper Award!<\/p>\n

Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming<\/a><\/span><\/strong>. Alexander Matveev, Nir Shavit, Pascal Felber, Patrick Marlier. In proceedings of the 25th ACM Symposium on Operating Systems Principles (SOSP 2015), October 4-7, 2015, Monterey, California, USA.<\/p>\n

\u0417\u0430\u0431\u0438\u0440\u0430\u0439 \u0432\u044b\u0438\u0433\u0440\u044b\u0448\u0438 \u0432 \u043a\u0430\u0437\u0438\u043d\u043e Vavada<\/a>, \u0438\u0433\u0440\u0430\u0439 \u0432 \u043e\u043d\u043b\u0430\u0439\u043d \u0438\u0433\u0440\u044b, \u0442\u0443\u0440\u043d\u0438\u0440\u044b \u0438 \u0441\u043b\u043e\u0442\u044b.<\/p>\n

Amalgamated Lock-Elision<\/a><\/span><\/strong>. Yehuda Afek, Alexander Matveev, Oscar R. Moll, Nir Shavit. In proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), October 5-9, 2015, Tokyo, Japan.<\/p>\n

ThreadScan: Automatic and Scalable Memory Reclamation<\/a><\/span><\/strong>. Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit. In proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2015), June 13-15, 2015, Portland, Oregon, USA.<\/p>\n

Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory<\/a><\/span><\/strong>. Alexander Matveev, Nir Shavit. In proceedings of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), March 14-18, 2015, Istanbul, Turkey.<\/p>\n

The SprayList: A Scalable Relaxed Priority Queue<\/a><\/span><\/strong>. Dan Alistarh, Justin Kopinsky, Jerry Li, Nir Shavit. In proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2015), February 7-8, 2015, San Francisco, California. WINNER: Highest-Ranked Artifacts — First Place<\/strong>.<\/p>\n

\n

\u0421\u0430\u0439\u0442 \u043a\u0430\u0437\u0438\u043d\u043e \u0412\u0430\u0432\u0430\u0434\u0430 https:\/\/dubaimorethanshopping.ru<\/a> – \u043e\u0444\u0438\u0446\u0438\u0430\u043b\u044c\u043d\u043e\u0435 \u0437\u0435\u0440\u043a\u0430\u043b\u043e \u0438 \u0440\u0435\u0433\u0438\u0441\u0442\u0440\u0430\u0446\u0438\u044f. \u041f\u0440\u0438\u043c\u0438\u0442\u0435 \u0443\u0447\u0430\u0441\u0442\u0438\u0435 \u0432 \u043e\u043d\u043b\u0430\u0439\u043d \u0438\u0433\u0440\u0430\u0445, \u0441\u0442\u043e\u043b\u0430\u0445 \u0438 \u0442\u0443\u0440\u043d\u0438\u0440\u0430\u0445.<\/p>\n

2014<\/strong><\/h5>\n

On the Importance of Registers for Computability<\/a><\/span><\/strong>. Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit. In proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS 2014), December 16-19, 2014, Cortina d’Amprezzo, Italy.<\/p>\n

Brief Announcement: Persistent Unfairness Arising From Cache Residency Imbalance<\/a><\/span><\/strong>. David Dice, Virendra J. Marathe, Nir Shavit. In proceedings of the 26th Annual ACM Symposium on Parallelism in Algorithms and Architecture (SPAA 2014), Prague, Czech Republic.<\/p>\n

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm<\/a><\/span><\/strong>. Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit. In proceedings of the 34th Annual International Conference on Distributed Computing Systems (ICDCS 2014), Madrid, Spain.<\/p>\n

Balls-into-Leaves: Sub-logarithmic Renaming in Synchronous Message-Passing Systems<\/a><\/span><\/strong>. Dan Alistarh, Oksana Denysyuk, Luis Rodrigues and Nir Shavit. In proceedings of the 33rd Annual ACM Symposium on Principles of Distributed Computing (PoDC 2014), Paris, France.<\/p>\n

Are Lock-Free Concurrent Algorithms Practically Wait-Free?<\/a><\/strong>. Dan Alistarh, Keren Censor-Hillel, Nir Shavit. In proceedings of the ACM 46th Annual Symposium on the Theory of Computing (SToC 2014), New York, New York, USA.<\/p>\n

StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation<\/a><\/span><\/strong>. Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, Nir Shavit. In proceedings of EuroSys 2014, Amsterdam, The Netherlands.<\/p>\n

Inherent Limitations of Hybrid Transactional Memory<\/a><\/strong>. Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit. In proceedings of the ( ) 2014, USA.<\/p>\n

Dynamic Task Allocation in Asynchronous Shared Memory<\/a><\/strong>. Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert. In proceedings of the ACM-SIAM 25th Annual Symposium on Discrete Algorithms (SODA 2014), Portland, Oregon, USA.<\/p>\n

\n
2013<\/strong><\/h5>\n

Amalgamated Transactions: Executing Long Transactions Mostly in Hardware<\/a><\/span><\/strong>. Yehuda Afek, Alexander Matveev, Nir Shavit. Compiler, Architecture and Tools Conference, Haifa, Israel, 2013.<\/p>\n

The SkipTrie: low-depth concurrent search without rebalancing<\/a><\/strong>. Rotem Oshman, Nir Shavit. Proceedings of the ACM Annual Conference on the Principles of Distributed Computing (PODC 2013), Montreal, Canada.<\/p>\n

Leaplist: lessons learned in designing tm-supported range queries <\/a><\/strong>. Hillel Avni, Nir Shavit, Adi Suissa. Proceedings of the ACM Annual Conference on the Principles of Distributed Computing (PODC 2013), Montreal, Canada.<\/p>\n

Randomized Loose Renaming in O(log log n) Time<\/a><\/strong>. Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel. Proceedings of the ACM Annual Conference on the Principles of Distributed Computing (PODC 2013), Montreal, Canada.<\/p>\n

Reduced Hardware Transactions: A New Approach to Hybrid Transactional Memory<\/a><\/strong>. Alexander Matveev, Nir Shavit. Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2013), Montreal, Canada.<\/p>\n

NUMA-aware reader-writer locks<\/a><\/strong>. Irina Calciu, David Dice, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Nir Shavit. Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2013), Shenzhen, China.<\/p>\n

\n
2012<\/strong><\/h5>\n

How to Allocate Tasks Asynchronously<\/a><\/strong>. Dan Alistarh, Michael A. Bender, Seth Gilbert, Rachid Guerraoui. Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FoCS 2012), New Brunswick, New Jersey, USA.<\/p>\n

Pessimistic Software Lock-Elision<\/a><\/strong>. Yehuda Afek, Alexander Matveev, Nir Shavit. Proceedings of the 26th Annual International Symposium on Distributed Computing (DISC 2012), Salvador, Brazil.<\/p>\n

\n
2010<\/strong><\/h5>\n

Implicit Privatization Using Private Transactions<\/a><\/strong>. Dave Dice, Alexander Matveev, Nir Shavit. TRANSACT 2010, Paris, France.<\/p>\n

Dynamic Identification of Shared Transactional Locations<\/a><\/strong>. Alexander Matveev, Nir Shavit. Technical Report 2010, Tel-Aviv University, Israel.<\/p>\n

\n

Thesis Publications<\/strong><\/h4>\n
\n

Hvis du har visse kvinders seksuelle sundhed<\/a> eller prikken i brystet, armene, nakken, eller simpelthen fordi s\u00e5danne personer ikke tager flere doser sildenafil uden at tale med deres l\u00e6ge.<\/p>\n

2015<\/strong><\/h5>\n

Parallel and Scalable Neural Image Segmentation for Connectome Graph Extraction<\/a><\/span><\/strong>. Quan Nguyen. Graduate Thesis – Master of Engineering in Electrical Engineering and Computer Science at MIT, Cambridge, MA (USA), June 2015. <\/em><\/p>\n

Medicinen var fast i Tyskland p\u00e5 obest\u00e4md tid. P\u00e5 l\u00e4karens rekommendation tog Ekaterina kontakt med en ny leverant\u00f6r. Det var meningen att han skulle k\u00f6pa medicinen i Israel och ta med den till Ryssland. Ekaterina vet fortfarande inte om det var en privatperson expressapotek<\/a>, en f\u00f6retr\u00e4dare f\u00f6r en klinik eller ett l\u00e4kemedelsf\u00f6retag.<\/p>\n

Investigation of Hardware Transactional Memory<\/a><\/span><\/strong>. Andrew T. Nguyen. Graduate Thesis – Master of Engineering in Electrical Engineering and Computer Science at MIT, Cambridge, MA (USA), June 2015.<\/em><\/p>\n

Accessibility<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Journal Publications 2020 A complexity-based classification for multiprocessor synchronization. Ellen, Faith, Gelashvili, Rati, Shavit, Nir, Zhu, Leqi. Distributed Comput. 33(2): 125-144, 2020. 2015 Lock Cohorting: A General Technique for Designing NUMA Locks. David Dice, Virendra J. Marathe and Nir Shavit. ACM Trans. Parallel Comput. Vol. 1, Issue 2, Article 13 (February 2015), 42 pages. Conference […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-27","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=\/wp\/v2\/pages\/27"}],"collection":[{"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=27"}],"version-history":[{"count":160,"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=\/wp\/v2\/pages\/27\/revisions"}],"predecessor-version":[{"id":928,"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=\/wp\/v2\/pages\/27\/revisions\/928"}],"wp:attachment":[{"href":"https:\/\/mag-r1.csail.mit.edu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=27"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}