default search action
Maged M. Michael
Person information
- affiliation: IBM Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c34]Maged M. Michael:
Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links. PODC 2020: 230-232
2010 – 2019
- 2019
- [c33]Tingzhe Zhou, Maged M. Michael, Michael F. Spear
:
A Practical, Scalable, Relaxed Priority Queue. ICPP 2019: 57:1-57:10 - 2015
- [j14]Hung Q. Le, Guy L. Guthrie, Derek Williams, Maged M. Michael, Brad Frey, William J. Starke, Cathy May, Rei Odaira, Takuya Nakaike:
Transactional memory support in the IBM POWER8 processor. IBM J. Res. Dev. 59(1) (2015) - [j13]Maged M. Michael:
PLDI 2004: Scalable Lock-Free Dynamic Memory Allocation. ACM SIGPLAN Notices 50(8s): 11-22 (2015) - [j12]Amy Wang, Matthew Gaudet, Peng Wu, Martin Ohmacht
Software Support and Evaluation of Hardware Transactional Memory on Blue Gene/Q. IEEE Trans. Computers 64(1): 233-246 (2015) - [c32]Takuya Nakaike, Rei Odaira, Matthew Gaudet, Maged M. Michael, Hisanobu Tomari:
Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER8. ISCA 2015: 144-157 - 2013
- [j11]Maged M. Michael:
The balancing act of choosing nonblocking features. Commun. ACM 56(9): 46-53 (2013) - [j10]Maged M. Michael:
The Balancing Act of Choosing Nonblocking Features. ACM Queue 11(7): 50 (2013) - [c31]Harold W. Cain, Maged M. Michael, Brad Frey, Cathy May, Derek Williams, Hung Q. Le:
Robust architectural support for transactional memory in the power architecture. ISCA 2013: 225-236 - 2012
- [c30]Amy Wang, Matthew Gaudet, Peng Wu, José Nelson Amaral, Martin Ohmacht
Evaluation of blue Gene/Q hardware support for transactional memories. PACT 2012: 127-136 - 2011
- [c29]Hagit Attiya
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. POPL 2011: 487-498 - 2010
- [j9]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. ACM SIGOPS Oper. Syst. Rev. 44(3): 93-101 (2010) - [c28]Maged M. Michael:
Memory Management in Concurrent Algorithms. CAV 2010: 23 - [c27]Takuya Nakaike, Rei Odaira, Toshio Nakatani, Maged M. Michael:
Real Java applications in software transactional memory. IISWC 2010: 1-10 - [c26]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 - [c25]Takuya Nakaike, Maged M. Michael:
Lock elision for read-only critical sections in Java. PLDI 2010: 269-278
2000 – 2009
- 2009
- [j8]Peng Wu, Maged M. Michael, Christoph von Praun, Takuya Nakaike, Rajesh Bordawekar, Harold W. Cain, Calin Cascaval
Compiler and runtime techniques for software transactional memory optimization. Concurr. Comput. Pract. Exp. 21(1): 7-23 (2009) - [c24]Michael F. Spear, Maged M. Michael, Michael L. Scott
Reducing Memory Ordering Overheads in Software Transactional Memory. CGO 2009: 13-24 - [c23]Maged M. Michael, Martin T. Vechev, Vijay A. Saraswat:
Idempotent work stealing. PPoPP 2009: 45-54 - 2008
- [j7]Calin Cascaval
Software transactional memory: why is it only a research toy? Commun. ACM 51(11): 40-46 (2008) - [j6]Calin Cascaval
Software Transactional Memory: Why Is It Only a Research Toy? ACM Queue 6(5): 46-58 (2008) - [c22]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 - [c21]Michael F. Spear
RingSTM: scalable transactions with a single atomic instruction. SPAA 2008: 275-284 - 2007
- [c20]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 - [c19]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 - [c18]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 - [c17]Vijay A. Saraswat, Radha Jagadeesan, Maged M. Michael, Christoph von Praun:
A theory of memory models. PPoPP 2007: 161-172 - [c16]Paul E. McKenney, Maged M. Michael, Jonathan Walpole:
Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory. PLOS@SOSP 2007: 6:1-6:5 - 2004
- [j5]Maged M. Michael:
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Trans. Parallel Distributed Syst. 15(6): 491-504 (2004) - [c15]Maged M. Michael:
Scalable lock-free dynamic memory allocation. PLDI 2004: 35-46 - [c14]Maged M. Michael:
Brief announcement: completing the lock-free dynamic cycle. PODC 2004: 372 - [c13]Maged M. Michael:
Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS. DISC 2004: 144-158 - 2003
- [c12]Maged M. Michael:
CAS-Based Lock-Free Algorithm for Shared Deques. Euro-Par 2003: 651-660 - 2002
- [c11]Maged M. Michael:
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. PODC 2002: 21-30 - [c10]Maged M. Michael:
High performance dynamic lock-free hash tables and list-based sets. SPAA 2002: 73-82 - 2001
- [j4]Ashwini K. Nanda, Anthony-Trung Nguyen, Maged M. Michael, Douglas J. Joseph:
High-throughout coherence control and hardware messaging in Everest. IBM J. Res. Dev. 45(2): 229-244 (2001) - 2000
- [c9]Ashwini K. Nanda, Anthony-Trung Nguyen, Maged M. Michael, Douglas J. Joseph:
High-Throughput Coherence Controllers. HPCA 2000: 145-155
1990 – 1999
- 1999
- [j3]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) - [c8]Maged M. Michael, Ashwini K. Nanda:
Design and Performance of Directory Caches for Scalable Shared Memory Multiprocessors. HPCA 1999: 142-151 - 1998
- [j2]Maged M. Michael, Michael L. Scott
Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors. J. Parallel Distributed Comput. 51(1): 1-26 (1998) - [c7]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 - 1997
- [c6]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 - [c5]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 - [c4]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 - 1996
- [j1]Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy
An Efficient Algorithm for Concurrent Priority Queue Heaps. Inf. Process. Lett. 60(3): 151-157 (1996) - [c3]Anthony-Trung Nguyen, Maged M. Michael, Arun Sharma, Josep Torrellas:
The Augmint multiprocessor simulation toolkit for Intel x86 architectures. ICCD 1996: 486-490 - [c2]Maged M. Michael, Michael L. Scott
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. PODC 1996: 267-275 - 1995
- [c1]Maged M. Michael, Michael L. Scott
Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors. HPCA 1995: 222-231
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: