Fazal Hameed

Fazal Hameed

Auto-generated profile, based on publicly available information

Fazal Hameed

Department of Computer Science and Engineering American University of Sharja Sharjah UAE

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2020 in Proceedings of the IEEE
Verified
Journal Article
Open access
RBRobin Blasing
Robin Blasing
AKAsif Ali Khan
Asif Ali Khan
PFPanagiotis Ch. Filippou
Panagiotis Ch. Filippou
CGChirag Garg
Chirag Garg
FHFazal Hameed
Fazal Hameed
SPStuart S. P. Parkin
Stuart S. P. Parkin
Racetrack memory (RTM) is a novel spintronic memory-storage technology that has the potential to overcome fundamental constraints of existing memory and storage devices. It is unique in that its core differentiating feature is the movement of data, which is composed of magnetic domain walls (DWs), by short current pulses. This enables more data to be stored per unit area compared to any other current technologies. On the one hand, RTM has the potential for mass data storage with unlimited endurance using considerably less energy than today's technologies. On the other hand, RTM promises an ultrafast nonvolatile memory competitive with static random access memory (SRAM) but with a much smaller footprint. During the last decade, the discovery of novel physical mechanisms to operate RTM has led to a major enhancement in the efficiency with which nanoscopic, chiral DWs can be manipulated. New materials and artificially atomically engineered thin-film structures have been found to increase the speed and lower the threshold current with which the data bits can be manipulated. With these recent developments, RTM has attracted the attention of the computer architecture community that has evaluated the use of RTM at various levels in the memory stack. Recent studies advocate RTM as a promising compromise between, on the one hand, power-hungry, volatile memories and, on the other hand, slow, nonvolatile storage. By optimizing the memory subsystem, significant performance improvements can be achieved, enabling a new era of cache, graphical processing units, and high capacity memory devices. In this article, we provide an overview of the major developments of RTM technology from both the physics and computer architecture perspectives over the past decade. We identify the remaining challenges and give an outlook on its future.

14 February 2019 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
AKAsif Ali Khan
Asif Ali Khan
FHFazal Hameed
Fazal Hameed
RBRobin Blaesing
Robin Blaesing
SPStuart Parkin
Stuart Parkin
JCJeronimo Castrillon
Jeronimo Castrillon
Racetrack memories (RTMs) have drawn considerable attention from computer architects of late. Owing to their SRAM's comparable access latency and ultra-high capacity, RTMs are promising candidates to revolutionize the memory subsystem. In order to evaluate their performance and appraise their suitability at various levels in the memory hierarchy, it is crucial to have RTM-specific simulation tools that accurately model their behavior and enable exhaustive design space exploration. To this end, we propose RTSim, an open source cycle-accurate memory simulator that empowers performance evaluation of the domain-wall-based racetrack memories. The skyrmions-based RTMs can also be modeled with RTSim because they are architecturally similar to domain-wall-based RTMs. RTSim is developed in collaboration with physicists and computer scientists. It accurately models RTM-specific shifting operations, access ports and the sequence of memory commands beside handling the routine read/write operations. RTSim is built on top of NVMain2.0, rendering larger design space for exploration.

26 December 2019 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
PDF file
AKAsif Ali Khan
Asif Ali Khan
FHFazal Hameed
Fazal Hameed
RBRobin Bläsing
Robin Bläsing
SPStuart S. P. Parkin
Stuart S. P. Parkin
JCJeronimo Castrillon
Jeronimo Castrillon
Racetrack memories (RMs) have significantly evolved since their conception in 2008, making them a serious contender in the field of emerging memory technologies. Despite key technological advancements, the access latency and energy consumption of an RM-based system are still highly influenced by the number of shift operations. These operations are required to move bits to the right positions in the racetracks. This article presents data-placement techniques for RMs that maximize the likelihood that consecutive references access nearby memory locations at runtime, thereby minimizing the number of shifts. We present an integer linear programming (ILP) formulation for optimal data placement in RMs, and we revisit existing offset assignment heuristics, originally proposed for random-access memories. We introduce a novel heuristic tailored to a realistic RM and combine it with a genetic search to further improve the solution. We show a reduction in the number of shifts of up to 52.5%, outperforming the state of the art by up to 16.1%.

23 June 2019
Verified
Conference Paper
Open access
AKAsif Ali Khan
Asif Ali Khan
NRNorman A. Rink
Norman A. Rink
FHFazal Hameed
Fazal Hameed
JCJeronimo Castrillon
Jeronimo Castrillon

2 July 2021 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
FHFazal Hameed
Fazal Hameed
AKAsif Ali Khan
Asif Ali Khan
JCJeronimo Castrillon
Jeronimo Castrillon
Sequence alignment is a fundamental operation in genomic analysis where DNA fragments called reads are mapped to a long reference DNA sequence. There exist a number of (in)exact alignment algorithms with varying sensitivity for both local and global alignments, however, they are all computationally expensive. With the advent of high-throughput sequencing (HTS) technologies that generate a mammoth amount of data, there is increased pressure on improving the performance and capacity of the analysis algorithms in general and the mapping algorithms in particular. While many works focus on improving the performance of the aligner themselves, recently it has been demonstrated that restricting the mapping space for input reads and filtering out mapping positions that will result in a poor match can significantly improve the performance of the alignment operation. However, this is only true if it is guaranteed that the filtering operation can be performed significantly faster. Otherwise, it can easily outweigh the benefits of the aligner. To expedite this pre-alignment filtering, among others, the recently proposed GRIM-Filter uses highly-parallel processing-in-memory operations benefiting from light-weight computational units on the logic-in-memory layer. However, the significant amount of data transferring between the memory and logic-in-memory layers quickly becomes a performance and energy bottleneck for the memory subsystem and ultimately for the overall system. By analyzing input genomes, we found that there are unexpected data-reuse opportunities in the filtering operation. We propose an algorithm-hardware co-design that exploits the data-reuse in the seed location filtering operation and, compared to the GRIM-Filter, cuts the number of memory accesses by 22-54 percent. This reduction in memory accesses improves the overall performance and energy consumption by 19-44 and 21-49 percent, respectively.

11 June 2019 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
FHFazal Hameed
Fazal Hameed
JCJeronimo Castrillon
Jeronimo Castrillon
High-capacity L4 architectures as a last-level cache (LLC) have been recently introduced between L3-SRAM and off-chip memory. These LLC architectures have either employed DRAM or spin-transfer torque (STT-RAM) memory technologies. It is a known fact that DRAM LLCs feature a higher energy consumption, while STT-RAM LLCs feature a lower write endurance compared to their counterparts. This paper proposes an efficient hybrid DRAM/STT-RAM LLC architecture that exploits the best characteristics offered by individual memory technologies while mitigating their drawbacks. More precisely, we introduce a novel mechanism for the storage and management of the hybrid LLC tags and a proactive L3-SRAM writeback policy that combines multiple dirty blocks that are mapped to the same LLC row. Our hybrid architecture reduces the LLC interference by having less writeback accesses and row fetches. The endurance is improved by reducing the number of STT-RAM block writes. We show that our LLC architecture reduces the total number of STT-RAM block writes by 78% and improves the average performance by 13% compared to a recently proposed STT-RAM LLC. Compared to the state-of-the-art DRAM LLC, we report an average energy and performance improvement of 24% and 17.1%, respectively.