Obserwuj
Maged M Michael
Maged M Michael
Concurrent Algorithms
Zweryfikowany adres z acm.org
Tytuł
Cytowane przez
Cytowane przez
Rok
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
12331996
Hazard pointers: Safe memory reclamation for lock-free objects
MM Michael
IEEE Transactions on Parallel and Distributed Systems 15 (6), 491-504, 2004
7532004
High performance dynamic lock-free hash tables and list-based sets
MM Michael
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
6472002
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
4272008
Scalable lock-free dynamic memory allocation
MM Michael
Proceedings of the ACM SIGPLAN 2004 conference on Programming language …, 2004
3402004
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
3201998
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
2872012
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
2872007
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
2642002
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
1812008
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
1762011
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
1702013
Idempotent work stealing
MM Michael, MT Vechev, VA Saraswat
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of …, 2009
1492009
Correction of a memory management method for lock-free data structures
MM Michael, ML Scott
University of Rochester, Department of Computer Science, 1995
1401995
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
1382015
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
1311996
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
1232013
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
1192007
An efficient algorithm for concurrent priority queue heaps
GC Hunt, MM Michael, S Parthasarathy, ML Scott
Information Processing Letters 60 (3), 151-157, 1996
1141996
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20