| Simple, fast, and practical non-blocking and blocking concurrent queue algorithms MM Michael, ML Scott Proceedings of the fifteenth annual ACM symposium on Principles of …, 1996 | 1167 | 1996 |
| Hazard pointers: Safe memory reclamation for lock-free objects MM Michael IEEE Transactions on Parallel and Distributed Systems 15 (6), 491-504, 2004 | 699 | 2004 |
| High performance dynamic lock-free hash tables and list-based sets MM Michael Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 616 | 2002 |
| Software transactional memory: Why is it only a research toy? C Cascaval, C Blundell, M Michael, HW Cain, P Wu, S Chiras, ... Communications of the ACM 51 (11), 40-46, 2008 | 410 | 2008 |
| Scalable lock-free dynamic memory allocation MM Michael Proceedings of the ACM SIGPLAN 2004 conference on Programming language …, 2004 | 334 | 2004 |
| Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors MM Michael, ML Scott journal of parallel and distributed computing 51 (1), 1-26, 1998 | 315 | 1998 |
| Scale-up x scale-out: A case study using nutch/lucene M Michael, JE Moreira, D Shiloach, RW Wisniewski 2007 IEEE International Parallel and Distributed Processing Symposium, 1-8, 2007 | 280 | 2007 |
| Evaluation of Blue Gene/Q hardware support for transactional memories A Wang, M Gaudet, P Wu, JN Amaral, M Ohmacht, C Barton, R Silvera, ... Proceedings of the 21st international conference on Parallel architectures …, 2012 | 274 | 2012 |
| Safe memory reclamation for dynamic lock-free objects using atomic reads and writes MM Michael Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 253 | 2002 |
| RingSTM: scalable transactions with a single atomic instruction MF Spear, MM Michael, C Von Praun Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008 | 176 | 2008 |
| Robust architectural support for transactional memory in the power architecture HW Cain, MM Michael, B Frey, C May, D Williams, H Le ACM SIGARCH Computer Architecture News 41 (3), 225-236, 2013 | 157 | 2013 |
| Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated H Attiya, R Guerraoui, D Hendler, P Kuznetsov, MM Michael, M Vechev ACM SIGPLAN Notices 46 (1), 487-498, 2011 | 157 | 2011 |
| Idempotent work stealing MM Michael, MT Vechev, VA Saraswat Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of …, 2009 | 139 | 2009 |
| Correction of a memory management method for lock-free data structures MM Michael, ML Scott University of Rochester, Department of Computer Science, 1995 | 134 | 1995 |
| The augmint multiprocessor simulation toolkit for intel x86 architectures AT Nguyen, M Michael, A Sharma, J Torrellas Proceedings International Conference on Computer Design. VLSI in Computers …, 1996 | 128 | 1996 |
| Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER8 T Nakaike, R Odaira, M Gaudet, MM Michael, H Tomari ACM SIGARCH Computer Architecture News 43 (3S), 144-157, 2015 | 127 | 2015 |
| Transactional memory system supporting unbroken suspended execution US Patent 20,110,296,148, 2017 | 125* | 2017 |
| Transactional block conflict resolution based on the determination of executing threads in parallel or in serial mode HW Cain III, GC Cascaval, MM Michael US Patent 8,539,486, 2013 | 122 | 2013 |
| A theory of memory models VA Saraswat, R Jagadeesan, M Michael, C von Praun Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of …, 2007 | 116 | 2007 |
| An efficient algorithm for concurrent priority queue heaps GC Hunt, MM Michael, S Parthasarathy, ML Scott Information Processing Letters 60 (3), 151-157, 1996 | 109 | 1996 |
Michael K GschwindFacebookVerified email at fb.com
