Pieter Hijma

Pieter Hijma

Auto-generated profile, based on publicly available information

Pieter Hijma

Eindhoven University of Technology

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
16 March 2023 in ACM Computing Surveys
Verified
Journal Article
Open access
PHPieter Hijma
Pieter Hijma
SHStijn Heldens
Stijn Heldens
ASAlessio Sclocco
Alessio Sclocco
BWBen van Werkhoven
Ben van Werkhoven
HBHenri E. Bal
Henri E. Bal
In the past decade, Graphics Processing Units have played an important role in the field of high-performance computing and they still advance new fields such as IoT, autonomous vehicles, and exascale computing. It is therefore important to understand how to extract performance from these processors, something that is not trivial. This survey discusses various optimization techniques found in 450 articles published in the last 14 years. We analyze the optimizations from different perspectives which shows that the various optimizations are highly interrelated, explaining the need for techniques such as auto-tuning.

28 October 2021
Verified
Book Chapter
Open access
PDF file
JMJan Martens
Jan Martens
Jan Friso GrooteJan Friso Groote
Jan Friso Groote
LHLars van Den Haak
Lars van Den Haak
PHPieter Hijma
Pieter Hijma
AWAnton Wijs
Anton Wijs
The most efficient way to calculate strong bisimilarity is by finding the relational coarsest partition of a transition system. We provide the first linear-time algorithm to calculate strong bisimulation using parallel random access machines (PRAMs). More precisely, withnstates,mtransitions and $$| Act |\le m$$|Act|≤m action labels, we provide an algorithm for $$\max (n,m)$$max(n,m) processors that calculates strong bisimulation in time $$\mathcal {O}(n+| Act |)$$O(n+|Act|) and space $$\mathcal {O}(n+m)$$O(n+m) . The best-known PRAM algorithm has time complexity $$\mathcal {O}(n\log n)$$O(nlogn) on a smaller number of processors making it less suitable for massive parallel devices such as GPUs. An implementation on a GPU shows that the linear time-bound is achievable on contemporary hardware.

1 May 2011
Verified
Conference Paper
Open access
AVAna Lucia Varbanescu
Ana Lucia Varbanescu
PHPieter Hijma
Pieter Hijma
RNRob van Nieuwpoort
Rob van Nieuwpoort
HBHenri Bal
Henri Bal
Building an effective programming model for many-core processors is challenging. On the one hand, the increasing variety of platforms and their specific programming models force users to take a hardware-centric approach not only for implementing parallel applications, but also for designing them. This approach diminishes portability and, eventually, limits performance. On the other hand, to effectively cope with the increased number of large-scale workloads that require parallelization, a portable, application-centric programming model is desirable. Such a model enables programmers to focus first on extracting and exploiting parallelism from their applications, as opposed to generating parallelism for specific hardware, and only second on platform-specific implementation and optimizations. In this paper, we first present a survey of programming models designed for programming three families of many-cores: general purpose many-cores (GPMCs), graphics processing units (GPUs), and the Cell/B.E.. We analyze the usability of these models, their ability to improve platform programmability, and the specific features that contribute to this improvement. Next, we also discuss two types of generic models: parallelism-centric and application-centric. We also analyze their features and impact on platform programmability. Based on this analysis, we recommend two application-centric models (OmpSs and OpenCL) as promising candidates for a unified programming model for many-cores and we discuss potential enhancements for them.

6 December 2022 in Software and Systems Modeling
Verified
Journal Article
Open access
PDF file
JMJan Martens
Jan Martens
Jan Friso GrooteJan Friso Groote
Jan Friso Groote
LHLars B. van Den Haak
Lars B. van Den Haak
PHPieter Hijma
Pieter Hijma
AWAnton Wijs
Anton Wijs
We present the first parallel algorithms that decide strong and branching bisimilarity in linear time. More precisely, if a transition system has n states, m transitions and $$\vert Act \vert $$ | A c t | action labels, we introduce an algorithm that decides strong bisimilarity in $$\mathcal {O}(n+\vert Act \vert )$$ O ( n + | A c t | ) time on $$\max (n,m)$$ max ( n , m ) processors and an algorithm that decides branching bisimilarity in $$\mathcal {O}(n+\vert Act \vert )$$ O ( n + | A c t | ) time using up to $$\max (n^2,m,\vert Act \vert n)$$ max ( n 2 , m , | A c t | n ) processors.

14 August 2023 in Journal of Open Hardware
Verified
Journal Article
Closed access
JMJorge Cesar Mariscal-Melgar
Jorge Cesar Mariscal-Melgar
PHPieter Hijma
Pieter Hijma
MMManuel Moritz
Manuel Moritz
TRTobias Redlich
Tobias Redlich

27 January 2015 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
PHP. Hijma
P. Hijma
RNR. V. van Nieuwpoort
R. V. van Nieuwpoort
CJC. J. H. Jacobs
C. J. H. Jacobs
HBH. E. Bal
H. E. Bal