Jesper Larsson Träff

ORCID

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 73

Top Venues

University Kopenhagen (PHD)

Education History

University Kopenhagen

PHD

Publications

Jesper Larsson Träff, Sascha Hunold, Ioannis Vardas, Nikolaus Manes Funk
Uniform Algorithms for Reduce-scatter and (most) other Collectives for MPI. CLUSTER (2023)
Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff
Preliminary Performance and Memory Access Scalability Study of Thick Control Flow Processors. NorCAS (2023)
Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff
Realizing multioperations and multiprefixes in Thick Control Flow processors. Microprocess. Microsystems 98 (2023)
Philippe Swartvagher, Sascha Hunold, Jesper Larsson Träff, Ioannis Vardas
Using Mixed-Radix Decomposition to Enumerate Computational Resources of Deeply Hierarchical Architectures. SC Workshops (2023)
Jesper Larsson Träff
Round-optimal n-Block Broadcast Schedules in Logarithmic Time. CoRR (2023)
Jesper Larsson Träff, Ioannis Vardas
Library Development with MPI: Attributes, Request Objects, Group Communicator Creation, Local Reductions, and Datatypes. EuroMPI (2023)
Jesper Larsson Träff
(Poly)Logarithmic Time Construction of Round-optimal n-Block Broadcast Schedules for Broadcast and irregular Allgather in MPI. CoRR (2022)
Sascha Hunold, Jordy I. Ajanohoun, Ioannis Vardas, Jesper Larsson Träff
An Overhead Analysis of MPI Profiling and Tracing Tools. PERMAVOST@HPDC (2022)
Ioannis Vardas, Sascha Hunold, Jordy I. Ajanohoun, Jesper Larsson Träff
mpisee: MPI Profiling for Communication and Communicator Structure. IPDPS Workshops (2022)
Martti Forsell, Sara Nikula, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff
Performance and programmability comparison of the thick control flow architecture and current multicore processors. J. Supercomput. 78 (3) (2022)
Jesper Larsson Träff
Fast(er) Construction of Round-optimal $n$-Block Broadcast Schedules. CLUSTER (2022)
Jesper Larsson Träff
Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules. SPAA (2022)
Jesper Larsson Träff, Sascha Hunold, Guillaume Mercier, Daniel J. Holmes
MPI collective communication through a single set of interfaces: A case for orthogonality. Parallel Comput. 107 (2021)
Jesper Larsson Träff
A Doubly-pipelined, Dual-root Reduction-to-all Algorithm and Implementation. CoRR (2021)
Jesper Larsson Träff, Manuel Pöter
A more pragmatic implementation of the lock-free, ordered, linked list. PPoPP (2021)
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz
High-Quality Hierarchical Process Mapping. SEA (2020)
Konrad von Kirchbach, Markus Lehr, Sascha Hunold, Christian Schulz, Jesper Larsson Träff
Efficient Process-to-Node Mapping Algorithms for Stencil Computations. CLUSTER (2020)
Jesper Larsson Träff
Signature Datatypes for Type Correct Collective Operations, Revisited. EuroMPI (2020)
Jesper Larsson Träff, Torsten Hoefler
Special issue: Selected papers from EuroMPI 2019. Parallel Comput. 99 (2020)
Jesper Larsson Träff, Sascha Hunold
Decomposing MPI Collectives for Exploiting Multi-lane Communication. CLUSTER (2020)
Jesper Larsson Träff
k-ported vs. k-lane Broadcast, Scatter, and Alltoall Algorithms. CoRR (2020)
Jesper Larsson Träff, Sascha Hunold, Guillaume Mercier, Daniel J. Holmes
Collectives and Communicators: A Case for Orthogonality: (Or: How to get rid of MPI neighbor and enhance Cartesian collectives). EuroMPI (2020)
Martti Forsell, Jussi Roivainen, Jesper Larsson Träff
Optimizing Memory Access in TCF Processors with Compute-Update Operations. IPDPS Workshops (2020)
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz
High-Quality Hierarchical Process Mapping. CoRR (2020)
Konrad von Kirchbach, Christian Schulz, Jesper Larsson Träff
Better Process Mapping and Sparse Quadratic Assignment. ACM J. Exp. Algorithmics 25 (2020)
Jesper Larsson Träff, Manuel Pöter
A more Pragmatic Implementation of the Lock-free, Ordered, Linked List. CoRR (2020)
Sascha Hunold, Konrad von Kirchbach, Markus Lehr, Christian Schulz, Jesper Larsson Träff
Efficient Process-to-Node Mapping Algorithms for Stencil Computations. CoRR (2020)
Michael Kainer, Jesper Larsson Träff
More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm. CoRR (2019)
Jesper Larsson Träff
On Optimal Trees for Irregular Gather and Scatter Collectives. IEEE Trans. Parallel Distributed Syst. 30 (9) (2019)
Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. ICPP (2019)
Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. CoRR (2019)
Qiao Kang, Jesper Larsson Träff, Reda Al-Bahrani, Ankit Agrawal, Alok N. Choudhary, Wei-keng Liao
Scalable Algorithms for MPI Intergroup Allgather and Allgatherv. Parallel Comput. 85 (2019)
Jesper Larsson Träff, Sascha Hunold
Cartesian Collective Communication. ICPP (2019)
Jesper Larsson Träff
Decomposing Collectives for Exploiting Multi-lane Communication. CoRR (2019)
Jesper Larsson Träff, Torsten Hoefler
Foreword EuroMPI 2019. EuroMPI (2019)
Jesper Larsson Träff
Parallel Quicksort without Pairwise Element Exchange. CoRR (2018)
Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff
Implementation of Multioperations in Thick Control Flow Processors. IPDPS Workshops (2018)
Manuel Pöter, Jesper Larsson Träff
, amortized constant-time memory reclamation in comparison to five other schemes. PPOPP (2018)
Manuel Pöter, Jesper Larsson Träff
Memory Models for C/C++ Programmers. CoRR (2018)
Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff
Supporting concurrent memory access in TCF processor architectures. Microprocess. Microsystems 63 (2018)
Manuel Pöter, Jesper Larsson Träff
Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model. CoRR (2018)
Manuel Pöter, Jesper Larsson Träff
Brief Announcement: Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model. SPAA (2018)
Qiao Kang, Jesper Larsson Träff, Reda Al-Bahrani, Ankit Agrawal, Alok N. Choudhary, Wei-keng Liao
Full-Duplex Inter-Group All-to-All Broadcast Algorithms with Optimal Bandwidth. EuroMPI (2018)
Jesper Larsson Träff
Practical, distributed, low overhead algorithms for irregular gather and scatter collectives. Parallel Comput. 75 (2018)
Jesper Larsson Träff
On Optimal Trees for Irregular Gather and Scatter Collectives. CoRR (2017)
Christian Schulz, Jesper Larsson Träff
Better Process Mapping and Sparse Quadratic Assignment. CoRR (2017)
Seyed Hessam Mirsadeghi, Jesper Larsson Träff, Pavan Balaji, Ahmad Afsahi
Exploiting Common Neighborhoods to Optimize MPI Neighborhood Collectives. HiPC (2017)
Jesper Larsson Träff
Practical, linear-time, fully distributed algorithms for irregular gather and scatter. EuroMPI/USA (2017)
Christian Schulz, Jesper Larsson Träff
Better Process Mapping and Sparse Quadratic Assignment. SEA (2017)
Christian Schulz, Jesper Larsson Träff
VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide. CoRR (2017)
Jesper Larsson Träff
Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter. CoRR (2017)
Manuel Pöter, Jesper Larsson Träff
A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it). CoRR (2017)
Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff
Supporting concurrent memory access in TCF-aware processor architectures. NORCAS (2017)
Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff
On expected and observed communication performance with MPI derived datatypes. Parallel Comput. 69 (2017)
Jakob Gruber, Jesper Larsson Träff, Martin Wimmer
Brief Announcement: Benchmarking Concurrent Priority Queues. SPAA (2016)
Christian Lengauer, Luc Bougé, Jesper Larsson Träff
Special issue: Euro-Par 2015. Concurr. Comput. Pract. Exp. 28 (12) (2016)
Jesper Larsson Träff
(Mis)managing parallel computing research through EU project funding. Commun. ACM 59 (12) (2016)
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. IPDPS (2016)
Stefano Markidis, Ivy Bo Peng, Jesper Larsson Träff, Antoine Rougier, Valeria Bartsch, Rui Machado, Mirko Rahn, Alistair Hart, Daniel J. Holmes, Mark Bull, Erwin Laure
The EPiGRAM Project: Preparing Parallel Programming Models for Exascale. ISC Workshops (2016)
Jesper Larsson Träff, Alexandra Carpen-Amarie, Sascha Hunold, Antoine Rougier
Message-Combining Algorithms for Isomorphic, Sparse Collective Communication. CoRR (2016)
Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff
MPI Derived Datatypes: Performance Expectations and Status Quo. CoRR (2016)
Sascha Hunold, Alexandra Carpen-Amarie, Felix Donatus Lübbe, Jesper Larsson Träff
PGMPI: Automatically Verifying Self-Consistent MPI Performance Guidelines. CoRR (2016)
Jakob Gruber, Jesper Larsson Träff, Martin Wimmer
Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures. CoRR (2016)
Jesper Larsson Träff
A Library for Advanced Datatype Programming. EuroMPI (2016)
Sascha Hunold, Alexandra Carpen-Amarie, Felix Donatus Lübbe, Jesper Larsson Träff
Automatic Verification of Self-consistent MPI Performance Guidelines. Euro-Par (2016)
Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff
On the Expected and Observed Communication Performance with MPI Derived Datatypes. EuroMPI (2016)
Martin Kalany, Jesper Larsson Träff
Efficient, Optimal MPI Datatype Reconstruction for Vector and Index Types. EuroMPI (2015)
Jesper Larsson Träff, Felix Donatus Lübbe, Antoine Rougier, Sascha Hunold
Isomorphic, Sparse MPI-like Collective Communication Operations for Parallel Stencil Computations. EuroMPI (2015)
Martin Wimmer, Jakob Gruber, Jesper Larsson Träff, Philippas Tsigas
The Lock-free k-LSM Relaxed Priority Queue. CoRR (2015)
Jesper Larsson Träff
The Shortest Path Problem with Edge Information Reuse is NP-Complete. CoRR (2015)
Martin Wimmer, Jakob Gruber, Jesper Larsson Träff, Philippas Tsigas
The lock-free k-LSM relaxed priority queue. PPOPP (2015)
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. CoRR (2015)
Jesper Larsson Träff, Felix Donatus Lübbe
Specification Guideline Violations by MPI_Dims_create. EuroMPI (2015)
Jesper Larsson Träff, Antoine Rougier, Sascha Hunold
Implementing a classic: zero-copy all-to-all communication with mpi datatypes. ICS (2014)
Jesper Larsson Träff
Optimal MPI Datatype Normalization for Vector and Index-block Types. EuroMPI/ASIA (2014)
Jesper Larsson Träff, Antoine Rougier
Zero-copy, Hierarchical Gather is not possible with MPI Datatypes and Collectives. EuroMPI/ASIA (2014)
Christian Siebert, Jesper Larsson Träff
Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge. Parallel Process. Lett. 24 (1) (2014)
Martin Wimmer, Francesco Versaci, Jesper Larsson Träff, Daniel Cederman, Philippas Tsigas
Data structures for task-based priority scheduling. PPOPP (2014)
Jesper Larsson Träff, Antoine Rougier
MPI Collectives and Datatypes for Hierarchical All-to-all Communication. EuroMPI/ASIA (2014)
Sascha Hunold, Alexandra Carpen-Amarie, Jesper Larsson Träff
Reproducible MPI Micro-Benchmarking Isn't As Easy As You Think. EuroMPI/ASIA (2014)
Jesper Larsson Träff, Martin Wimmer
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning. CoRR (2014)
Jesper Larsson Träff, Siegfried Benkner
Selected Papers from EuroMPI 2012 - 19th European MPI Users' Group Meeting. Computing 96 (4) (2014)
Sascha Hunold, Jesper Larsson Träff
On the State and Importance of Reproducible Experimental Research in Parallel Computing. CoRR (2013)
Christian Siebert, Jesper Larsson Träff
Perfectly load-balanced, optimal, stable, parallel merge CoRR (2013)
Martin Wimmer, Daniel Cederman, Jesper Larsson Träff, Philippas Tsigas
Work-stealing with configurable scheduling strategies. PPOPP (2013)
Martin Wimmer, Daniel Cederman, Francesco Versaci, Jesper Larsson Träff, Philippas Tsigas
Data Structures for Task-based Priority Scheduling. CoRR (2013)
Jesper Larsson Träff
A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination CoRR (2013)
Martin Wimmer, Manuel Pöter, Jesper Larsson Träff
The Pheet Task-Scheduling Framework on the Intel® Xeon Phi Coprocessor and other Multicore Architectures. IPDPS Workshops (2013)
Martin Wimmer, Daniel Cederman, Jesper Larsson Träff, Philippas Tsigas
Configurable Strategies for Work-stealing CoRR (2013)
Jesper Larsson Träff
mpicroscope: Towards an MPI Benchmark Tool for Performance Guideline Verification. EuroMPI (2012)
Christoph W. Kessler, Usman Dastgeer, Samuel Thibault, Raymond Namyst, Andrew Richards, Uwe Dolinsky, Siegfried Benkner, Jesper Larsson Träff, Sabri Pllana
Programmability and performance portability aspects of heterogeneous multi-/manycore systems. DATE (2012)
Christian Siebert, Jesper Larsson Träff
Efficient MPI Implementation of a Parallel, Stable Merge Algorithm. EuroMPI (2012)
Jesper Larsson Träff
Simplified, stable parallel merging CoRR (2012)
Christoph W. Kessler, Usman Dastgeer, Mudassar Majeed, Nathalie Furmento, Samuel Thibault, Raymond Namyst, Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Martin Wimmer
Abstract: Leveraging PEPPHER Technology for Performance Portable Supercomputing. SC Companion (2012)
Christoph W. Keßler, Usman Dastgeer, Mudassar Majeed, Nathalie Furmento, Samuel Thibault, Raymond Namyst, Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Martin Wimmer
Poster: Leveraging PEPPHER Technology for Performance Portable Supercomputing. SC Companion (2012)
Torsten Hoefler, Patrick Geoffray, Fabrizio Petrini, Jesper Larsson Träff
Top Picks from Hot Interconnects 2011: Petascale Network Architectures. IEEE Micro 32 (1) (2012)
Jesper Larsson Träff
Alternative, uniformly expressive and more scalable interfaces for collective communication in MPI. Parallel Comput. 38 (1-2) (2012)
Martin Wimmer, Jesper Larsson Träff
Work-stealing for mixed-mode parallelism by deterministic team-building. SPAA (2011)
Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Philippas Tsigas, Uwe Dolinsky, Cédric Augonnet, Beverly Bachmayer, Christoph W. Kessler, David Moloney, Vitaly Osipov
PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems. IEEE Micro 31 (5) (2011)
Torsten Hoefler, Rolf Rabenseifner, Hubert Ritzdorf, Bronis R. de Supinski, Rajeev Thakur, Jesper Larsson Träff
The scalable process topology interface of MPI 2.2. Concurr. Comput. Pract. Exp. 23 (4) (2011)

Jesper Larsson Träff.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jesper Larsson Träff