Zia Ul Huda

Zia Ul Huda

Auto-generated profile, based on publicly available information

Zia Ul Huda

German Research School for Simulation Sciences, RWTH Aachen University, Aachen Germany

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 July 2016 in Journal of Systems and Software
Verified
Journal Article
Closed access
ZLZhen Li
Zhen Li
RARohit Atre
Rohit Atre
ZHZia Huda
Zia Huda
AJAli Jannesari
Ali Jannesari
FWFelix Wolf
Felix Wolf

9 January 2015 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
ZHZia Ul Huda
Zia Ul Huda
AJAli Jannesari
Ali Jannesari
FWFelix Wolf
Felix Wolf
The triumphant spread of multicore processors over the past decade increases the pressure on software developers to exploit the growing amount of parallelism available in the hardware. However, writing parallel programs is generally challenging. For sequential programs, the formulation of design patterns marked a turning point in software development, boosting programmer productivity and leading to more reusable and maintainable code. While the literature is now also reporting a rising number of parallel design patterns, programmers confronted with the task of parallelizing an existing sequential program still struggle with the question of which parallel pattern to apply where in their code. In this article, we show how template matching, a technique traditionally used in the discovery of sequential design patterns, can also be used to support parallelization decisions. After looking for matches in a previously extracted dynamic dependence graph, we classify code blocks of the input program according to the structure of the parallel patterns we find. Based on this information, the programmer can easily implement the detected pattern and create a parallel version of his or her program. We tested our approach with six programs, in which we successfully detected pipeline and do-all patterns.

1 May 2016
Verified
Conference Paper
Closed access
ZHZia Ul Huda
Zia Ul Huda
RARohit Atre
Rohit Atre
AJAli Jannesari
Ali Jannesari
FWFelix Wolf
Felix Wolf
Parallel design patterns have been developed to help programmers efficiently design and implement parallel applications. However, identifying a suitable parallel pattern for a specific code region in a sequential application is a difficult task. Transforming an application according to support structures applicable to these parallel patterns is also very challenging. In this paper, we present a novel approach to automatically find parallel patterns in the algorithm structure design space of sequential applications. In our approach, we classify code blocks in a region according to the appropriate supportstructure of the detected pattern. This classification eases the transformation of a sequential application into its parallel version. Weevaluated our approach on 17 applications from four different benchmark suites. Our method identified suitable algorithm structure patterns in the sequential applications. We confirmed our results by comparing them with the existing parallel versions of these applications. We also implemented the patterns we detected in cases in which parallel implementations were not available and achieved speedups of up to 14x.