Scalable high performance main memory system using phase-change memory technology
Moinuddin K. Qureshi;Vijayalakshmi Srinivasan;Jude A. Rivers.
international symposium on computer architecture (2009)
Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches
Moinuddin K. Qureshi;Yale N. Patt.
international symposium on microarchitecture (2006)
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling
Moinuddin K. Qureshi;John Karidis;Michele Franceschini;Vijayalakshmi Srinivasan.
international symposium on microarchitecture (2009)
Adaptive insertion policies for high performance caching
Moinuddin K. Qureshi;Aamer Jaleel;Yale N. Patt;Simon C. Steely.
international symposium on computer architecture (2007)
Adaptive insertion policies for managing shared caches
Aamer Jaleel;William Hasenplaugh;Moinuddin Qureshi;Julien Sebot.
international conference on parallel architectures and compilation techniques (2008)
A Case for MLP-Aware Cache Replacement
Moinuddin K. Qureshi;Daniel N. Lynch;Onur Mutlu;Yale N. Patt.
international symposium on computer architecture (2006)
Accelerating critical section execution with asymmetric multi-core architectures
M. Aater Suleman;Onur Mutlu;Moinuddin K. Qureshi;Yale N. Patt.
architectural support for programming languages and operating systems (2009)
Improving read performance of Phase Change Memories via Write Cancellation and Write Pausing
Moinuddin K. Qureshi;Michele M. Franceschini;Luis A. Lastras-Montano.
high-performance computer architecture (2010)
The V-Way Cache: Demand Based Associativity via Global Replacement
Moinuddin K. Qureshi;David Thompson;Yale N. Patt.
international symposium on computer architecture (2005)
Fundamental Latency Trade-off in Architecting DRAM Caches: Outperforming Impractical SRAM-Tags with a Simple and Practical Design
Moinuddin K. Qureshi;Gabe H. Loh.
international symposium on microarchitecture (2012)
If you think any of the details on this page are incorrect, let us know.
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: