M
Moinuddin K. Qureshi
Researcher at Georgia Institute of Technology
Publications - 144
Citations - 11625
Moinuddin K. Qureshi is an academic researcher from Georgia Institute of Technology. The author has contributed to research in topics: Cache & Computer science. The author has an hindex of 44, co-authored 131 publications receiving 9956 citations. Previous affiliations of Moinuddin K. Qureshi include IBM & University of Texas at Austin.
Papers
More filters
Patent
Method for optimizing refresh rate for dram
Michele M. Franceschini,Hillery C. Hunter,Ashish Jagmohan,Charles A. Kilmer,Kyu-hyoun Kim,Luis A. Lastras,Moinuddin K. Qureshi +6 more
TL;DR: In this paper, a method for determining an optimized refresh rate involves testing a refresh rate on rows of cells, determining an error rate of the rows, evaluating the error rate, and repeating these steps for a decreased refresh rate until the error rates is greater than a constraint, at which point a slow refresh rate is set.
Patent
Current-aware floorplanning to overcome current delivery limitations in integrated circuits
TL;DR: In this article, a dynamic system coupled with pre-silicon design methodologies and post-Silicon current optimizing programming methodologies is proposed to improve and optimize current delivery into a chip, which is limited by the physical properties of the connections.
Proceedings Article
{MIRAGE}: Mitigating Conflict-Based Cache Attacks with a Practical Fully-Associative Design
TL;DR: Mirage as mentioned in this paper proposes to select eviction candidates randomly from all lines resident in the cache, to be immune to set-conflicts, thus offering a principled defense against any eviction-set discovery and any potential conflict based attacks.
Posted Content
CRAM: Efficient Hardware-Based Memory Compression for Bandwidth Enhancement
TL;DR: CRAM is proposed, a bandwidth-efficient design for memory compression that is entirely hardware based and does not require any OS support or changes to the memory modules or interfaces, and uses a novel implicit-metadata mechanism, whereby the compressibility of the line can be determined by scanning the line for a special marker word, eliminating the overheads of metadata access.
Patent
Memory access prediction
TL;DR: In this paper, a cache snoop and access to physical memory are initiated in parallel for the data item if the indicator bit is a first predetermined bit (one (1) or zero (0)).