World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
8125
World Ranking
10068
National Ranking
4246

Research.com Recognitions

  • 2012 - ACM Distinguished Member
  • 2011 - ACM Senior Member

Overview

Maged M. Michael is affiliated with Facebook, United States, where they contribute to research and development within the organization. Their recognized contributions to the field have earned them memberships in the Association for Computing Machinery (ACM), including the ACM Senior Member in 2011 and the ACM Distinguished Member in 2012.

Their academic record does not list recent papers, published books, frequent co-authors, or specific publication venues. Information about the specific fields of study, subfields, and main research topics related to their work is not publicly detailed.

The honors received by Maged M. Michael reflect their involvement and standing within the computing and information technology community, as recognized by ACM.

Best Publications

  • Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

    Maged M. Michael;Michael L. Scott

  • Hazard pointers: safe memory reclamation for lock-free objects

    M.M. Michael

  • High performance dynamic lock-free hash tables and list-based sets

    Maged M. Michael

  • Software transactional memory: why is it only a research toy?

    Calin Cascaval;Colin Blundell;Maged Michael;Harold W. Cain

  • Scalable lock-free dynamic memory allocation

    Maged M. Michael

  • Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors

    Maged M. Michael;Michael L. Scott

  • Scale-up x Scale-out: A Case Study using Nutch/Lucene

    M. Michael;J.E. Moreira;D. Shiloach;R.W. Wisniewski

  • Evaluation of Blue Gene/Q hardware support for transactional memories

    Amy Wang;Matthew Gaudet;Peng Wu;Jose Nelson Amaral

  • Safe memory reclamation for dynamic lock-free objects using atomic reads and writes

    Maged M. Michael

  • Transactional Conflict Resolution Based on Locality

    Harold W. Cain;Gheorghe C. Cascaval;Maged M. Michael

  • RingSTM: scalable transactions with a single atomic instruction

    Michael F. Spear;Maged M. Michael;Christoph von Praun

  • Robust architectural support for transactional memory in the power architecture

    Harold W. Cain;Maged M. Michael;Brad Frey;Cathy May

  • Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated

    Hagit Attiya;Rachid Guerraoui;Danny Hendler;Petr Kuznetsov

  • Idempotent work stealing

    Maged M. Michael;Martin T. Vechev;Vijay A. Saraswat

  • The Augmint multiprocessor simulation toolkit for Intel x86 architectures

    A.-T. Nguyen;M. Michael;A. Sharma;J. Torrellas

  • Correction of a Memory Management Method for Lock-Free Data Structures

    Maged M. Michael;Michael L. Scott

  • Transactional Memory System Supporting Unbroken Suspended Execution

    Harold W. Cain;Bradly G. Frey;Benjamin Herrenschmidt;Hung Q. Le

  • Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER8

    Takuya Nakaike;Rei Odaira;Matthew Gaudet;Maged M. Michael

  • A theory of memory models

    Vijay A. Saraswat;Radha Jagadeesan;Maged Michael;Christoph von Praun

  • An Efficient Algorithm for Concurrent Priority Queue Heaps

    Galen C. Hunt;Maged M. Michael;Srinivasan Parthasarathy;Michael L. Scott

  • Software Transactional Memory: Why Is It Only a Research Toy?: The promise of STM may likely be undermined by its overheads and workload applicabilities.

    Calin Cascaval;Colin Blundell;Maged Michael;Harold W. Cain

Frequent Co-Authors

Michael Karl Gschwind
Michael Karl Gschwind IBM (United States)
Valentina Salapura
Valentina Salapura Google (United States)
Michael L. Scott
Michael L. Scott University of Rochester
Paul E. McKenney
Paul E. McKenney Facebook (United States)
José E. Moreira
José E. Moreira IBM (United States)
Galen C. Hunt
Galen C. Hunt Microsoft (United States)
Vijay Saraswat
Vijay Saraswat Goldman Sachs Research
Jonathan Walpole
Jonathan Walpole Portland State University
Calin Cascaval
Calin Cascaval Google (United States)
Martin Vechev
Martin Vechev ETH Zurich

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online study options in the U.S. opens diverse opportunities for aspiring computer science students. Many seek cheap online colleges to manage costs while receiving a quality education. These accredited programs help reduce student debt and make a degree more accessible.

Students concerned about their academic history can consider a college with low gpa entry requirements. These institutions offer alternative pathways, giving more learners the chance to start or advance their computer science studies.

If you’re interested in environmental technology or sustainability, a background in computer science pairs well with further study. Explore what you can achieve with cross-disciplinary education by reading about what can you get with an environmental science degree.

For those aiming to enter the workforce quickly, look into programs like a 2-year computer science degree online. Accelerated degrees help students gain in-demand technical skills in less time, improving job prospects across various industries.

Best Scientists Citing Maged M. Michael

Trending Scientists

Recently Published Articles