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

Tiberiu Rotaru

dblp:18/6543 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2024
0009-0000-8455-5553ORCID · corroborated

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

Systems, architecture and hardware · 3 · 2 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.18
2010 Service-oriented middleware for financial Monte Carlo simulations on the cell broadband engine
abstract
Abstract Financial Monte Carlo simulations are computationally intensive applications that must meet tight deadlines in terms of job completion times. The completion time might have a huge impact on the financial profits made from decisions derived from the simulation results. Naturally, there is a huge interest in being able to simulate as fast as possible. While single simulations can be done on one machine, decisions often depend on portfolios of simulations. Distributing the workload among resources is crucial to achieve low latency. In this article we present a combination of a middleware with a high‐performance implementation of an Asian options evaluation code on the Cell Broadband Engine (CBE). We handle workload distribution with our PHASTGrid middleware and provide users with a web service interface to the whole infrastructure. The CBE is particularly suitable for Monte Carlo simulations. We implemented a well‐known algorithm on both the CBE and the Intel x86 multicore architectures. Both codes are integrated in our middleware, allowing a direct comparison of the performance and scalability. In addition to the Monte Carlo simulation, we also use different applications and compare our middleware with Globus. Copyright © 2009 John Wiley & Sons, Ltd.
Tiberiu Rotaru, Mathias Dalheimer, Franz-Josef Pfreundt
Concurr. Comput. Pract. Exp.1
2004 Dynamic load balancing by diffusion in heterogeneous systems
Tiberiu Rotaru, Hans-Heinrich Nägeli
J. Parallel Distributed Comput.1