Maged M. Michael

Amy Wang, Matthew Gaudet, Peng Wu, José Nelson Amaral, Martin Ohmacht, Christopher Barton, Raúl Silvera, Maged M. Michael: Evaluation of blue Gene/Q hardware support for transactional memories. PACT 2012: 127-136

Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. POPL 2011: 487-498

Paul E. McKenney, Maged M. Michael, Josh Triplett, Jonathan Walpole: Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory. Operating Systems Review 44(3): 93-101 (2010)

Maged M. Michael: Memory Management in Concurrent Algorithms. CAV 2010: 23

Takuya Nakaike, Rei Odaira, Toshio Nakatani, Maged M. Michael: Real Java applications in software transactional memory. IISWC 2010: 1-10

Michael Wong, Barna L. Bihari, Bronis R. de Supinski, Peng Wu, Maged M. Michael, Yan Liu, Wang Chen: A Case for Including Transactions in OpenMP. IWOMP 2010: 149-160

Takuya Nakaike, Maged M. Michael: Lock elision for read-only critical sections in Java. PLDI 2010: 269-278

Peng Wu, Maged M. Michael, Christoph von Praun, Takuya Nakaike, Rajesh Bordawekar, Harold W. Cain, Calin Cascaval, Siddhartha Chatterjee, Stefanie Chiras, Rui Hou, Mark F. Mergen, Xiaowei Shen, Michael F. Spear, Huayong Wang, Kun Wang: Compiler and runtime techniques for software transactional memory optimization. Concurrency and Computation: Practice and Experience 21(1): 7-23 (2009)

Michael F. Spear, Maged M. Michael, Michael L. Scott, Peng Wu: Reducing Memory Ordering Overheads in Software Transactional Memory. CGO 2009: 13-24

Maged M. Michael, Martin T. Vechev, Vijay A. Saraswat: Idempotent work stealing. PPOPP 2009: 45-54

Calin Cascaval, Colin Blundell, Maged M. Michael, Harold W. Cain, Peng Wu, Stefanie Chiras, Siddhartha Chatterjee: Software transactional memory: why is it only a research toy? Commun. ACM 51(11): 40-46 (2008)

Calin Cascaval, Colin Blundell, Maged M. Michael, Harold W. Cain, Peng Wu, Stefanie Chiras, Siddhartha Chatterjee: Software Transactional Memory: Why Is It Only a Research Toy? ACM Queue 6(5): 46-58 (2008)

Michael F. Spear, Michael Silverman, Luke Dalessandro, Maged M. Michael, Michael L. Scott: Implementing and Exploiting Inevitability in Software Transactional Memory. ICPP 2008: 59-66

Michael F. Spear, Maged M. Michael, Christoph von Praun: RingSTM: scalable transactions with a single atomic instruction. SPAA 2008: 275-284

Robert W. Wisniewski, Reza Azimi, Mathieu Desnoyers, Maged M. Michael, José E. Moreira, Doron Shiloach, Livio Soares: Experiences Understanding Performance in a Commercial Scale-Out Environment. Euro-Par 2007: 139-149

José E. Moreira, Maged M. Michael, Dilma Da Silva, Doron Shiloach, Parijat Dube, Li Zhang: Scalability of the Nutch search engine. ICS 2007: 3-12

Maged M. Michael, José E. Moreira, Doron Shiloach, Robert W. Wisniewski: Scale-up x Scale-out: A Case Study using Nutch/Lucene. IPDPS 2007: 1-8

Vijay A. Saraswat, Radha Jagadeesan, Maged M. Michael, Christoph von Praun: A theory of memory models. PPOPP 2007: 161-172

Maged M. Michael: Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Trans. Parallel Distrib. Syst. 15(6): 491-504 (2004)

Maged M. Michael: Scalable lock-free dynamic memory allocation. PLDI 2004: 35-46

Maged M. Michael: Brief announcement: completing the lock-free dynamic cycle. PODC 2004: 372

Maged M. Michael: Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS. DISC 2004: 144-158

Maged M. Michael: CAS-Based Lock-Free Algorithm for Shared Deques. Euro-Par 2003: 651-660

Maged M. Michael: Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. PODC 2002: 21-30

Maged M. Michael: High performance dynamic lock-free hash tables and list-based sets. SPAA 2002: 73-82

Ashwini K. Nanda, Anthony-Trung Nguyen, Maged M. Michael, Douglas J. Joseph: High-throughout coherence control and hardware messaging in Everest. IBM Journal of Research and Development 45(2): 229-244 (2001)

Ashwini K. Nanda, Anthony-Trung Nguyen, Maged M. Michael, Douglas J. Joseph: High-Throughput Coherence Controllers. HPCA 2000: 145-155

Maged M. Michael, Ashwini K. Nanda, Beng-Hong Lim: Coherence Controller Architectures for Scalable Shared-Memory Multiprocessors. IEEE Trans. Computers 48(2): 245-255 (1999)

Maged M. Michael, Ashwini K. Nanda: Design and Performance of Directory Caches for Scalable Shared Memory Multiprocessors. HPCA 1999: 142-151

Maged M. Michael, Michael L. Scott: Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors. J. Parallel Distrib. Comput. 51(1): 1-26 (1998)

Ashwini K. Nanda, Yiming Hu, Moriyoshi Ohara, Caroline Benveniste, Mark Giampapa, Maged M. Michael: The Design of COMPASS: An Execution Driven Simulator for Commercial Applications Running on Shared Memory Multiprocessors. IPPS/SPDP 1998: 503-509

Anthony-Trung Nguyen, Pradip Bose, Kattamuri Ekanadham, Ashwini K. Nanda, Maged M. Michael: Accuracy and Speedup of Parallel Trace-Driven Architectural Simulation. IPPS 1997: 39-44

Maged M. Michael, Michael L. Scott: Relative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory Multiprocessors. IPPS 1997: 267-273

Maged M. Michael, Ashwini K. Nanda, Beng-Hong Lim, Michael L. Scott: Coherence Controller Architectures for SMP-Based CC-NUMA Multiprocessors. ISCA 1997: 219-228

Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott: An Efficient Algorithm for Concurrent Priority Queue Heaps. Inf. Process. Lett. 60(3): 151-157 (1996)

Anthony-Trung Nguyen, Maged M. Michael, Arun Sharma, Josep Torrellas: The Augmint multiprocessor simulation toolkit for Intel x86 architectures. ICCD 1996: 486-490

Maged M. Michael, Michael L. Scott: Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. PODC 1996: 267-275

Maged M. Michael, Michael L. Scott: Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors. HPCA 1995: 222-231