Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hans-Christian Hoppe

dblp:12/4979 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0001-3546-090XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 61% Parallel and multicore computing · 30% GPUs and heterogeneous computing · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource allocation
dynamic resource allocation
0.812024
Malleability in Modern HPC Systems: Current Experiences, Challenges, and Future Opportunities · IEEE Trans. Parallel Distributed Syst. 2024
Parallel and multicore computing › task scheduling
malleable jobs
0.812024
Malleability in Modern HPC Systems: Current Experiences, Challenges, and Future Opportunities · IEEE Trans. Parallel Distributed Syst. 2024
Cloud and datacenter computing
resource management
0.812024
Malleability in Modern HPC Systems: Current Experiences, Challenges, and Future Opportunities · IEEE Trans. Parallel Distributed Syst. 2024
GPUs and heterogeneous computing
heterogeneous computing systems
0.212024
Malleability in Modern HPC Systems: Current Experiences, Challenges, and Future Opportunities · IEEE Trans. Parallel Distributed Syst. 2024

Methods — techniques the papers use, named apart from their topics

survey · 0.8
YearPublicationVenuePosition
2024 Malleability in Modern HPC Systems: Current Experiences, Challenges, and Future Opportunities
abstract
With the increase of complex scientific simulations driven by workflows and heterogeneous workload profiles, managing system resources effectively is essential for improving performance and system throughput, especially due to trends like heterogeneous HPC and deeply integrated systems with on-chip accelerators. For optimal resource utilization, dynamic resource allocation can improve productivity across all system and application levels, by adapting the applications' configurations to the system's resources. In this context, malleable jobs, which can change resources at runtime, can increase the system throughput and resource utilization while bringing various advantages for HPC users (e.g., shorter waiting time). Malleability has received much attention recently, even though it has been an active research area for almost two decades [1]. This paper presents the state-of-the-art of malleable implementations in HPC systems, targeting mainly malleability in compute and I/O resources. Based on our experiences, we state our current concerns and list future opportunities for research.
Ahmad Tarraf, Martin Schreiber 0001, Alberto Cascajo, Jean-Baptiste Besnard, Marc-Andre Vef, Dominik Huber, Sonja Happ, André Brinkmann, David E. Singh, Hans-Christian Hoppe, Alberto Miranda, Antonio J. Peña, Marta Garcia-Gasulla, Martin Schulz 0001, Paul M. Carpenter, Simon Pickartz, Tiberiu Rotaru, Sergio Iserte, Víctor López 0003, Jorge Ejarque, Heena Sirwani, Jesús Carretero 0001, Felix Wolf 0001
IEEE Trans. Parallel Distributed Syst.10
2018 Understanding memory access patterns using the BSC performance tools
Harald Servat, Jesús Labarta, Hans-Christian Hoppe, Judit Giménez, Antonio J. Peña
Parallel Comput.3
2017 Automating the Application Data Placement in Hybrid Memory Systems
abstract
Multi-tiered memory systems, such as those based on Intel®Xeon Phi™ processors, are equipped with several memory tiers with different characteristics including, among others, capacity, access latency, bandwidth, energy consumption, and volatility. The proper distribution of the application data objects into the available memory layers is key to shorten the time- to-solution, but the way developers and end-users determine the most appropriate memory tier to place the application data objects has not been properly addressed to date. In this paper we present a novel methodology to build an extensible framework to automatically identify and place the application's most relevant memory objects into the Intel Xeon Phi fast on-package memory. Our proposal works on top of inproduction binaries by first exploring the application behavior and then substituting the dynamic memory allocations. This makes this proposal valuable even for end-users who do not have the possibility of modifying the application source code. We demonstrate the value of a framework based in our methodology for several relevant HPC applications using different allocation strategies to help end-users improve performance with minimal intervention. The results of our evaluation reveal that our proposal is able to identify the key objects to be promoted into fast on-package memory in order to optimize performance, leading to even surpassing hardware-based solutions.
Harald Servat, Antonio J. Peña, Germán Llort, Estanislao Mercadal, Hans-Christian Hoppe, Jesús Labarta
CLUSTER5
2005 Monitoring cache behavior on parallel SMP architectures and related programming tools
Thomas Brandes, Helmut Schwamborn, Michael Gerndt, Jürgen Jeitner, Edmond Kereku, Martin Schulz 0001, Holger Brunst, Wolfgang E. Nagel, Reinhard Neumann, Ralph Müller-Pfefferkorn, Bernd Trenkler, Wolfgang Karl, Jie Tao 0001, Hans-Christian Hoppe
Future Gener. Comput. Syst.14
2001 Group-Based Performance Analysis for Multithreaded SMP Cluster Applications
Holger Brunst, Wolfgang E. Nagel, Hans-Christian Hoppe
Euro-Par3
1994 Portable Programming with the PARMACS Message-Passing Library
Robin Calkin, Rolf Hempel, Hans-Christian Hoppe, Peter Wypior
Parallel Comput.3
1986 Parallel adaptive full-multigrid methods on message-based multiprocessors
Hans-Christian Hoppe, Heinz Mühlenbein
Parallel Comput.1