default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesper Larsson Träff
Refine list
refinements active!
zoomed in on 216 of 216 records
view refined list in
export refined list as
showing all 216 records
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2024
[c124]Ioannis Vardas
, Sascha Hunold, Philippe Swartvagher, Jesper Larsson Träff:
Improved Parallel Application Performance and Makespan by Colocation and Topology-aware Process Mapping. CCGrid 2024: 119-124- [c123]Jesper Larsson Träff, Ioannis Vardas, Sascha Hunold:
Modes, Persistence and Orthogonality: Blowing MPI Up. SC Workshops 2024: 404-413 - [i36]Jesper Larsson Träff:
Optimal Broadcast Schedules in Logarithmic Time with Applications to Broadcast, All-Broadcast, Reduction and All-Reduction. CoRR abs/2407.18004 (2024) - [i35]Jesper Larsson Träff:
Lectures on Parallel Computing. CoRR abs/2407.18795 (2024) - [i34]Jesper Larsson Träff:
Optimal, Non-pipelined Reduce-scatter and Allreduce Algorithms. CoRR abs/2410.14234 (2024) - 2023
- [j38]Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff:
Realizing multioperations and multiprefixes in Thick Control Flow processors. Microprocess. Microsystems 98: 104807 (2023) - [c122]Jesper Larsson Träff, Sascha Hunold, Ioannis Vardas, Nikolaus Manes Funk:
Uniform Algorithms for Reduce-scatter and (most) other Collectives for MPI. CLUSTER 2023: 284-294 - [c121]Ioannis Vardas, Sascha Hunold, Philippe Swartvagher, Jesper Larsson Träff:
Exploring Mapping Strategies for Co-allocated HPC Applications. Euro-Par Workshops 2023: 271-276 - [c120]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: 1-7 - [c119]Jesper Larsson Träff, Ioannis Vardas:
Library Development with MPI: Attributes, Request Objects, Group Communicator Creation, Local Reductions, and Datatypes. EuroMPI 2023: 5:1-5:10 - [c118]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: 404-415 - [i33]Jesper Larsson Träff:
Round-optimal n-Block Broadcast Schedules in Logarithmic Time. CoRR abs/2312.11236 (2023) - 2022
- [j37]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): 3152-3183 (2022) - [c117]Jesper Larsson Träff:
Fast(er) Construction of Round-optimal $n$-Block Broadcast Schedules. CLUSTER 2022: 142-151 - [c116]Sascha Hunold, Jordy I. Ajanohoun, Ioannis Vardas, Jesper Larsson Träff:
An Overhead Analysis of MPI Profiling and Tracing Tools. PERMAVOST@HPDC 2022: 5-13 - [c115]Ioannis Vardas, Sascha Hunold, Jordy I. Ajanohoun, Jesper Larsson Träff:
mpisee: MPI Profiling for Communication and Communicator Structure. IPDPS Workshops 2022: 520-529 - [c114]Jesper Larsson Träff:
Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules. SPAA 2022: 143-146 - [i32]Jesper Larsson Träff:
(Poly)Logarithmic Time Construction of Round-optimal n-Block Broadcast Schedules for Broadcast and irregular Allgather in MPI. CoRR abs/2205.10072 (2022) - 2021
- [j36]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: 102826 (2021) - [c113]Jesper Larsson Träff, Manuel Pöter:
A more pragmatic implementation of the lock-free, ordered, linked list. PPoPP 2021: 457-459 - [i31]Jesper Larsson Träff:
A Doubly-pipelined, Dual-root Reduction-to-all Algorithm and Implementation. CoRR abs/2109.12626 (2021) - 2020
- [j35]Konrad von Kirchbach, Christian Schulz, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. ACM J. Exp. Algorithmics 25: 1-19 (2020) - [j34]Jesper Larsson Träff, Torsten Hoefler:
Special issue: Selected papers from EuroMPI 2019. Parallel Comput. 99: 102695 (2020) - [c112]Konrad von Kirchbach, Markus Lehr, Sascha Hunold, Christian Schulz, Jesper Larsson Träff:
Efficient Process-to-Node Mapping Algorithms for Stencil Computations. CLUSTER 2020: 1-11 - [c111]Jesper Larsson Träff, Sascha Hunold:
Decomposing MPI Collectives for Exploiting Multi-lane Communication. CLUSTER 2020: 270-280 - [c110]Martti Forsell, Jussi Roivainen, Jesper Larsson Träff:
Optimizing Memory Access in TCF Processors with Compute-Update Operations. IPDPS Workshops 2020: 577-586 - [c109]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: 31-38 - [c108]Jesper Larsson Träff:
Signature Datatypes for Type Correct Collective Operations, Revisited. EuroMPI 2020: 81-88 - [c107]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. SEA 2020: 4:1-4:15 - [i30]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. CoRR abs/2001.07134 (2020) - [i29]Sascha Hunold, Konrad von Kirchbach, Markus Lehr, Christian Schulz, Jesper Larsson Träff:
Efficient Process-to-Node Mapping Algorithms for Stencil Computations. CoRR abs/2005.09521 (2020) - [i28]Jesper Larsson Träff:
k-ported vs. k-lane Broadcast, Scatter, and Alltoall Algorithms. CoRR abs/2008.12144 (2020) - [i27]Jesper Larsson Träff, Manuel Pöter:
A more Pragmatic Implementation of the Lock-free, Ordered, Linked List. CoRR abs/2010.15755 (2020) - no results
2010 – 2019
- 2019
- [j33]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: 220-230 (2019) - [j32]Jesper Larsson Träff:
On Optimal Trees for Irregular Gather and Scatter Collectives. IEEE Trans. Parallel Distributed Syst. 30(9): 2060-2074 (2019) - [c106]Jesper Larsson Träff, Sascha Hunold:
Cartesian Collective Communication. ICPP 2019: 48:1-48:11 - [c105]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: 67:1-67:10 - [c104]Jesper Larsson Träff, Torsten Hoefler:
Foreword EuroMPI 2019. EuroMPI 2019: 1:1-1:2 - [e10]Torsten Hoefler, Jesper Larsson Träff:
Proceedings of the 26th European MPI Users' Group Meeting, EuroMPI 2019, Zürich, Switzerland, September 11-13, 2019. ACM 2019, ISBN 978-1-4503-7175-9 [contents] - [i26]Michael Kainer, Jesper Larsson Träff:
More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm. CoRR abs/1903.12085 (2019) - [i25]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 abs/1907.13077 (2019) - [i24]Jesper Larsson Träff:
Decomposing Collectives for Exploiting Multi-lane Communication. CoRR abs/1910.13373 (2019) - 2018
- [j31]Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff:
Supporting concurrent memory access in TCF processor architectures. Microprocess. Microsystems 63: 226-236 (2018) - [j30]Jesper Larsson Träff:
Practical, distributed, low overhead algorithms for irregular gather and scatter collectives. Parallel Comput. 75: 100-117 (2018) - [c103]Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff:
Implementation of Multioperations in Thick Control Flow Processors. IPDPS Workshops 2018: 744-752 - [c102]Manuel Pöter, Jesper Larsson Träff:
Stamp-it, amortized constant-time memory reclamation in comparison to five other schemes. PPoPP 2018: 413-414 - [c101]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: 1:1-1:10 - [c100]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: 355-358 - [i23]Manuel Pöter, Jesper Larsson Träff:
Memory Models for C/C++ Programmers. CoRR abs/1803.04432 (2018) - [i22]Jesper Larsson Träff:
Parallel Quicksort without Pairwise Element Exchange. CoRR abs/1804.07494 (2018) - [i21]Manuel Pöter, Jesper Larsson Träff:
Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model. CoRR abs/1805.08639 (2018) - 2017
- [j29]Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff:
On expected and observed communication performance with MPI derived datatypes. Parallel Comput. 69: 98-117 (2017) - [c99]Seyed Hessam Mirsadeghi, Jesper Larsson Träff, Pavan Balaji, Ahmad Afsahi:
Exploiting Common Neighborhoods to Optimize MPI Neighborhood Collectives. HiPC 2017: 348-357 - [c98]Martti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Larsson Träff:
Supporting concurrent memory access in TCF-aware processor architectures. NORCAS 2017: 1-6 - [c97]Jesper Larsson Träff:
Practical, linear-time, fully distributed algorithms for irregular gather and scatter. EuroMPI/USA 2017: 1:1-1:10 - [c96]Christian Schulz, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. SEA 2017: 4:1-4:15 - [i20]Christian Schulz, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. CoRR abs/1702.04164 (2017) - [i19]Jesper Larsson Träff:
Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter. CoRR abs/1702.05967 (2017) - [i18]Christian Schulz, Jesper Larsson Träff:
VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide. CoRR abs/1703.05509 (2017) - [i17]Jesper Larsson Träff:
On Optimal Trees for Irregular Gather and Scatter Collectives. CoRR abs/1711.08731 (2017) - [i16]Manuel Pöter, Jesper Larsson Träff:
A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it). CoRR abs/1712.06134 (2017) - 2016
- [j28]Jesper Larsson Träff:
(Mis)managing parallel computing research through EU project funding. Commun. ACM 59(12): 46-48 (2016) - [j27]Christian Lengauer, Luc Bougé, Jesper Larsson Träff:
Special issue: Euro-Par 2015. Concurr. Comput. Pract. Exp. 28(12): 3445-3446 (2016) - [c95]Sascha Hunold, Alexandra Carpen-Amarie, Felix Donatus Lübbe, Jesper Larsson Träff:
Automatic Verification of Self-consistent MPI Performance Guidelines. Euro-Par 2016: 433-446 - [c94]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. IPDPS 2016: 638-647 - [c93]Jesper Larsson Träff:
A Library for Advanced Datatype Programming. EuroMPI 2016: 98-107 - [c92]Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff:
On the Expected and Observed Communication Performance with MPI Derived Datatypes. EuroMPI 2016: 108-120 - [c91]Jakob Gruber, Jesper Larsson Träff, Martin Wimmer:
Brief Announcement: Benchmarking Concurrent Priority Queues. SPAA 2016: 361-362 - [c90]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: 56-68 - [e9]Jack J. Dongarra, Daniel J. Holmes, Antonia B. K. Collis, Jesper Larsson Träff, Lorna Smith:
Proceedings of the 23rd European MPI Users' Group Meeting, EuroMPI 2016, Edinburgh, United Kingdom, September 25-28, 2016. ACM 2016, ISBN 978-1-4503-4234-6 [contents] - [i15]Jakob Gruber, Jesper Larsson Träff, Martin Wimmer:
Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures. CoRR abs/1603.05047 (2016) - [i14]Sascha Hunold, Alexandra Carpen-Amarie, Felix Donatus Lübbe, Jesper Larsson Träff:
PGMPI: Automatically Verifying Self-Consistent MPI Performance Guidelines. CoRR abs/1606.00215 (2016) - [i13]Jesper Larsson Träff, Alexandra Carpen-Amarie, Sascha Hunold, Antoine Rougier:
Message-Combining Algorithms for Isomorphic, Sparse Collective Communication. CoRR abs/1606.07676 (2016) - [i12]Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff:
MPI Derived Datatypes: Performance Expectations and Status Quo. CoRR abs/1607.00178 (2016) - 2015
- [c89]Martin Wimmer, Jakob Gruber, Jesper Larsson Träff, Philippas Tsigas:
The lock-free k-LSM relaxed priority queue. PPoPP 2015: 277-278 - [c88]Martin Kalany, Jesper Larsson Träff:
Efficient, Optimal MPI Datatype Reconstruction for Vector and Index Types. EuroMPI 2015: 5:1-5:10 - [c87]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: 10:1-10:10 - [c86]Jesper Larsson Träff, Felix Donatus Lübbe:
Specification Guideline Violations by MPI_Dims_create. EuroMPI 2015: 19:1-19:2 - [e8]Jesper Larsson Träff, Sascha Hunold, Francesco Versaci:
Euro-Par 2015: Parallel Processing - 21st International Conference on Parallel and Distributed Computing, Vienna, Austria, August 24-28, 2015, Proceedings. Lecture Notes in Computer Science 9233, Springer 2015, ISBN 978-3-662-48095-3 [contents] - [i11]Martin Wimmer, Jakob Gruber, Jesper Larsson Träff, Philippas Tsigas:
The Lock-free k-LSM Relaxed Priority Queue. CoRR abs/1503.05698 (2015) - [i10]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. CoRR abs/1506.09100 (2015) - [i9]Jesper Larsson Träff:
The Shortest Path Problem with Edge Information Reuse is NP-Complete. CoRR abs/1509.05637 (2015) - 2014
- [j26]Jesper Larsson Träff, Siegfried Benkner:
Selected Papers from EuroMPI 2012 - 19th European MPI Users' Group Meeting. Computing 96(4): 259-261 (2014) - [j25]Christian Siebert, Jesper Larsson Träff:
Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge. Parallel Process. Lett. 24(1) (2014) - [c85]Jesper Larsson Träff, Antoine Rougier, Sascha Hunold:
Implementing a classic: zero-copy all-to-all communication with mpi datatypes. ICS 2014: 135-144 - [c84]Martin Wimmer, Francesco Versaci, Jesper Larsson Träff, Daniel Cederman, Philippas Tsigas:
Data structures for task-based priority scheduling. PPoPP 2014: 379-380 - [c83]Jesper Larsson Träff, Antoine Rougier:
MPI Collectives and Datatypes for Hierarchical All-to-all Communication. EuroMPI/ASIA 2014: 27 - [c82]Jesper Larsson Träff:
Optimal MPI Datatype Normalization for Vector and Index-block Types. EuroMPI/ASIA 2014: 33 - [c81]Jesper Larsson Träff, Antoine Rougier:
Zero-copy, Hierarchical Gather is not possible with MPI Datatypes and Collectives. EuroMPI/ASIA 2014: 39 - [c80]Sascha Hunold, Alexandra Carpen-Amarie, Jesper Larsson Träff:
Reproducible MPI Micro-Benchmarking Isn't As Easy As You Think. EuroMPI/ASIA 2014: 69 - [i8]Jesper Larsson Träff, Martin Wimmer:
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning. CoRR abs/1410.0462 (2014) - 2013
- [c79]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: 1587-1596 - [c78]Martin Wimmer, Daniel Cederman, Jesper Larsson Träff, Philippas Tsigas:
Work-stealing with configurable scheduling strategies. PPoPP 2013: 315-316 - [i7]Christian Siebert, Jesper Larsson Träff:
Perfectly load-balanced, optimal, stable, parallel merge. CoRR abs/1303.4312 (2013) - [i6]Jesper Larsson Träff:
A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination. CoRR abs/1305.1222 (2013) - [i5]Martin Wimmer, Daniel Cederman, Jesper Larsson Träff, Philippas Tsigas:
Configurable Strategies for Work-stealing. CoRR abs/1305.6474 (2013) - [i4]Sascha Hunold, Jesper Larsson Träff:
On the State and Importance of Reproducible Experimental Research in Parallel Computing. CoRR abs/1308.3648 (2013) - [i3]Martin Wimmer, Daniel Cederman, Francesco Versaci, Jesper Larsson Träff, Philippas Tsigas:
Data Structures for Task-based Priority Scheduling. CoRR abs/1312.2501 (2013) - 2012
- [j24]Torsten Hoefler, Patrick Geoffray, Fabrizio Petrini, Jesper Larsson Träff:
Top Picks from Hot Interconnects 2011: Petascale Network Architectures. IEEE Micro 32(1): 4-7 (2012) - [j23]Jesper Larsson Träff:
Alternative, uniformly expressive and more scalable interfaces for collective communication in MPI. Parallel Comput. 38(1-2): 26-36 (2012) - [c77]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: 1403-1408 - [c76]Jesper Larsson Träff:
mpicroscope: Towards an MPI Benchmark Tool for Performance Guideline Verification. EuroMPI 2012: 100-109 - [c75]Christian Siebert, Jesper Larsson Träff:
Efficient MPI Implementation of a Parallel, Stable Merge Algorithm. EuroMPI 2012: 204-213 - [c74]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: 1395-1396 - [c73]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: 1397 - [e7]Michael Alexander, Pasqua D'Ambra, Adam Belloum, George Bosilca, Mario Cannataro, Marco Danelutto, Beniamino Di Martino, Michael Gerndt, Emmanuel Jeannot, Raymond Namyst, Jean Roman, Stephen L. Scott, Jesper Larsson Träff, Geoffroy Vallée, Josef Weidendorfer:
Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29 - September 2, 2011, Revised Selected Papers, Part I. Lecture Notes in Computer Science 7155, Springer 2012, ISBN 978-3-642-29736-6 [contents] - [e6]Michael Alexander, Pasqua D'Ambra, Adam Belloum, George Bosilca, Mario Cannataro, Marco Danelutto, Beniamino Di Martino, Michael Gerndt, Emmanuel Jeannot, Raymond Namyst, Jean Roman, Stephen L. Scott, Jesper Larsson Träff, Geoffroy Vallée, Josef Weidendorfer:
Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29 - September 2, 2011, Revised Selected Papers, Part II. Lecture Notes in Computer Science 7156, Springer 2012, ISBN 978-3-642-29739-7 [contents] - [e5]Jesper Larsson Träff, Siegfried Benkner, Jack J. Dongarra:
Recent Advances in the Message Passing Interface - 19th European MPI Users' Group Meeting, EuroMPI 2012, Vienna, Austria, September 23-26, 2012. Proceedings. Lecture Notes in Computer Science 7490, Springer 2012, ISBN 978-3-642-33517-4 [contents] - [i2]Jesper Larsson Träff:
Simplified, stable parallel merging. CoRR abs/1202.6575 (2012) - 2011
- [j22]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): 293-310 (2011) - [j21]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): 28-41 (2011) - [j20]Pavan Balaji, Darius Buntinas, David Goodell, William Gropp, Torsten Hoefler, Sameer Kumar, Ewing L. Lusk, Rajeev Thakur, Jesper Larsson Träff:
Mpi on millions of Cores. Parallel Process. Lett. 21(1): 45-60 (2011) - [c72]Jesper Larsson Träff, Brice Goglin, Ulrich Brüning, Fabrizio Petrini:
Introduction. Euro-Par (2) 2011: 263 - [c71]Jesper Larsson Träff:
A (Radical) Proposal Addressing the Non-scalability of the Irregular MPI Collective Interfaces. IPDPS Workshops 2011: 1199-1207 - [c70]Martin Wimmer, Jesper Larsson Träff:
An Extended Work-Stealing Framework for Mixed-Mode Parallel Applications. IPDPS Workshops 2011: 1683-1690 - [c69]Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Philippas Tsigas, Andrew Richards, Raymond Namyst, Beverly Bachmayer, Christoph W. Kessler, David Moloney, Peter Sanders:
The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures. PARCO 2011: 361-368 - [c68]Enes Bajrovic, Jesper Larsson Träff:
Using MPI Derived Datatypes in Numerical Libraries. EuroMPI 2011: 29-38 - [c67]William Gropp, Torsten Hoefler, Rajeev Thakur, Jesper Larsson Träff:
Performance Expectations and Guidelines for MPI Derived Datatypes. EuroMPI 2011: 150-159 - [c66]Martin Wimmer, Jesper Larsson Träff:
Work-stealing for mixed-mode parallelism by deterministic team-building. SPAA 2011: 105-116 - [e4]Mario R. Guarracino, Frédéric Vivien, Jesper Larsson Träff, Mario Cannataro, Marco Danelutto, Anders Hast, Francesca Perla, Andreas Knüpfer, Beniamino Di Martino, Michael Alexander:
Euro-Par 2010 Parallel Processing Workshops - HeteroPar, HPCC, HiBB, CoreGrid, UCHPC, HPCF, PROPER, CCPI, VHPC, Ischia, Italy, August 31-September 3, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6586, Springer 2011, ISBN 978-3-642-21877-4 [contents] - [r5]Jesper Larsson Träff, Robert A. van de Geijn:
Allgather. Encyclopedia of Parallel Computing 2011: 39-42 - [r4]Jesper Larsson Träff, Robert A. van de Geijn:
All-to-All. Encyclopedia of Parallel Computing 2011: 42-47 - [r3]Jesper Larsson Träff, Robert A. van de Geijn:
Broadcast. Encyclopedia of Parallel Computing 2011: 186-192 - [r2]Robert A. van de Geijn, Jesper Larsson Träff:
Collective Communication. Encyclopedia of Parallel Computing 2011: 318-327 - [r1]Jesper Larsson Träff:
Scan for Distributed Memory, Message-Passing Systems. Encyclopedia of Parallel Computing 2011: 1785-1787 - 2010
- [j19]Jesper Larsson Träff, Andreas Ripke, Christian Siebert, Pavan Balaji, Rajeev Thakur, William Gropp:
A Pipelined Algorithm for Large, Irregular All-Gather Problems. Int. J. High Perform. Comput. Appl. 24(1): 58-68 (2010) - [j18]Jesper Larsson Träff, William D. Gropp, Rajeev Thakur:
Self-Consistent MPI Performance Guidelines. IEEE Trans. Parallel Distributed Syst. 21(5): 698-709 (2010) - [c65]Martti Forsell, Jesper Larsson Träff:
HPPC 2010: Forth Workshop on Highly Parallel Processing on a Chip. Euro-Par Workshops 2010: 73-75 - [c64]Beniamino Di Martino, Fabrizio Petrini, Siegfried Benkner, Kirk W. Cameron, Dieter Kranzlmüller, Jakub Kurzak, Davide Pasetto, Jesper Larsson Träff:
Multicore and Manycore Programming. Euro-Par (2) 2010: 137-138 - [c63]Martti Forsell, Jesper Larsson Träff:
HPPC 2010: 5th Workshop on Highly Parallel Processing on a Chip. Euro-Par Workshops (1) 2010: 245-247 - [c62]Torsten Hoefler, William Gropp, Rajeev Thakur, Jesper Larsson Träff:
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues. EuroMPI 2010: 21-30 - [c61]Jesper Larsson Träff:
Compact and Efficient Implementation of the MPI Group Operations. EuroMPI 2010: 170-178 - [c60]Jesper Larsson Träff:
Transparent Neutral Element Elimination in MPI Reduction Operations. EuroMPI 2010: 275-284 - [i1]Martin Wimmer, Jesper Larsson Träff:
Work-stealing for mixed-mode parallelism by deterministic team-building. CoRR abs/1012.5030 (2010) - no results
2000 – 2009
- 2009
- [b3]Jesper Larsson Träff:
Aspects of the efficient implementation of the message passing interface (MPI). Shaker 2009, pp. I-IV, 1-111 - [j17]Jesper Larsson Träff:
What the parallel-processing community has (failed) to offer the multi/many-core generation. J. Parallel Distributed Comput. 69(9): 807-812 (2009) - [j16]Peter Sanders, Jochen Speck, Jesper Larsson Träff:
Two-tree algorithms for full bandwidth broadcast, reduction and scan. Parallel Comput. 35(12): 581-594 (2009) - [j15]Jesper Larsson Träff:
Relationships between Regular and Irregular Collective Communication Operations on Clustered Multiprocessors. Parallel Process. Lett. 19(1): 85-96 (2009) - [j14]Sabri Pllana, Jesper Larsson Träff:
Introduction to the Scientific Programming Special Issue: Software Development for Multi-core Computing Systems. Sci. Program. 17(4): 283-284 (2009) - [j13]Sabri Pllana, Jesper Larsson Träff:
Reviewers for Scientific Programming Special Issue on Software Development for Multi-core Computing Systems. Sci. Program. 17(4): 337 (2009) - [c59]Martti Forsell, Jesper Larsson Träff:
HPPC 2009: 3rd Workshop on Highly Parallel Processing on a Chip. Euro-Par Workshops 2009: 3-5 - [c58]Martti Forsell, H. Peter Hofstee, Ahmed Jerraya, Chris R. Jesshope, Uzi Vishkin, Jesper Larsson Träff:
HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? Euro-Par Workshops 2009: 9-15 - [c57]Vinod Tipparaju, William Gropp, Hubert Ritzdorf, Rajeev Thakur, Jesper Larsson Träff:
Investigating High Performance RMA Interfaces for the MPI-3 Standard. ICPP 2009: 293-300 - [c56]Torsten Hoefler, Jesper Larsson Träff:
Sparse collective operations for MPI. IPDPS 2009: 1-8 - [c55]Pavan Balaji, Darius Buntinas, David Goodell, William Gropp, Sameer Kumar, Ewing L. Lusk, Rajeev Thakur, Jesper Larsson Träff:
MPI on a Million Processors. PVM/MPI 2009: 20-30 - [c54]Faisal Ghias Mir, Jesper Larsson Träff:
Exploiting Efficient Transpacking for One-Sided Communication and MPI-IO. PVM/MPI 2009: 154-163 - [e3]Eduardo César, Michael Alexander, Achim Streit, Jesper Larsson Träff, Christophe Cérin, Andreas Knüpfer, Dieter Kranzlmüller, Shantenu Jha:
Euro-Par 2008 Workshops - Parallel Processing, VHPC 2008, UNICORE 2008, HPPC 2008, SGS 2008, PROPER 2008, ROIA 2008, and DPA 2008, Las Palmas de Gran Canaria, Spain, August 25-26, 2008, Revised Selected Papers. Lecture Notes in Computer Science 5415, Springer 2009, ISBN 978-3-642-00954-9 [contents] - 2008
- [j12]Jesper Larsson Träff, Andreas Ripke:
Optimal broadcast for fully connected processor-node networks. J. Parallel Distributed Comput. 68(7): 887-901 (2008) - [c53]Jörg Wagner, Armin Jahanpanah, Jesper Larsson Träff:
User-Land Work Stealing Schedulers: Towards a Standard. CISIS 2008: 811-816 - [c52]Martti Forsell, Jesper Larsson Träff:
Second Workshop on Highly Parallel Processing on a Chip (HPPC 2008). Euro-Par Workshops 2008: 123-125 - [c51]Jesper Larsson Träff:
How to avoid making the same Mistakes all over again: What the parallel-processing community has (failed) to offer the multi/many-core generation. IPDPS 2008: 1-2 - [c50]Jesper Larsson Träff, Andreas Ripke, Christian Siebert, Pavan Balaji, Rajeev Thakur, William Gropp:
A Simple, Pipelined Algorithm for Large, Irregular All-gather Problems. PVM/MPI 2008: 84-93 - [c49]Faisal Ghias Mir, Jesper Larsson Träff:
Constructing MPI Input-output Datatypes for Efficient Transpacking. PVM/MPI 2008: 141-150 - [c48]William D. Gropp, Dries Kimpe, Robert B. Ross, Rajeev Thakur, Jesper Larsson Träff:
Self-consistent MPI-IO Performance Requirements and Expectations. PVM/MPI 2008: 167-176 - [e2]Luc Bougé, Martti Forsell, Jesper Larsson Träff, Achim Streit, Wolfgang Ziegler, Michael Alexander, Stephen Childs:
Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007, Rennes, France, August 28-31, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4854, Springer 2008, ISBN 978-3-540-78472-2 [contents] - 2007
- [j11]Michael Gerndt, Bernd Mohr, Jesper Larsson Träff:
A test suite for parallel performance analysis tools. Concurr. Comput. Pract. Exp. 19(11): 1465-1480 (2007) - [j10]Bernd Mohr, Jesper Larsson Träff, Joachim Worringen:
Selected papers from EuroPVM/MPI 2006. Parallel Comput. 33(9): 593-594 (2007) - [c47]Martti Forsell, Jesper Larsson Träff:
HPPC 2007: Workshop on Highly Parallel Processing on a Chip. Euro-Par Workshops 2007: 3-4 - [c46]Peter Sanders, Jochen Speck, Jesper Larsson Träff:
Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees. PVM/MPI 2007: 17-26 - [c45]Jesper Larsson Träff, William Gropp, Rajeev Thakur:
Self-consistent MPI Performance Requirements. PVM/MPI 2007: 36-45 - 2006
- [j9]Jesper Larsson Träff:
Direct graph k-partitioning with a Kernighan-Lin like heuristic. Oper. Res. Lett. 34(6): 621-629 (2006) - [c44]Hubert Ritzdorf, Jesper Larsson Träff:
Collective operations in NEC's high-performance MPI libraries. IPDPS 2006 - [c43]Peter Sanders, Jesper Larsson Träff:
Parallel Prefix (Scan) Algorithms for MPI. PVM/MPI 2006: 49-57 - [c42]Jesper Larsson Träff:
Efficient Allgather for Regular SMP-Clusters. PVM/MPI 2006: 58-65 - [c41]Guntram Berti, Jesper Larsson Träff:
What MPI Could (and Cannot) Do for Mesh-Partitioning on Non-homogeneous Networks. PVM/MPI 2006: 293-302 - [e1]Bernd Mohr, Jesper Larsson Träff, Joachim Worringen, Jack J. Dongarra:
Recent Advances in Parallel Virtual Machine and Message Passing Interface, 13th European PVM/MPI User's Group Meeting, Bonn, Germany, September 17-20, 2006, Proceedings. Lecture Notes in Computer Science 4192, Springer 2006, ISBN 3-540-39110-X [contents] - 2005
- [c40]Jesper Larsson Träff, Andreas Ripke:
Optimal Broadcast for Fully Connected Networks. HPCC 2005: 45-56 - [c39]Jesper Larsson Träff, Joachim Worringen:
The MPI/SX Collectives Verification Library. PARCO 2005: 909-916 - [c38]Jesper Larsson Träff, Andreas Ripke:
An Optimal Broadcast Algorithm Adapted to SMP Clusters. PVM/MPI 2005: 48-56 - [c37]Jesper Larsson Träff:
An Improved Algorithm for (Non-commutative) Reduce-Scatter with an Application. PVM/MPI 2005: 129-137 - 2004
- [c36]Michael Gerndt, Bernd Mohr, Jesper Larsson Träff:
Evaluating OpenMP Performance Analysis Tools with the APART Test Suite. Euro-Par 2004: 155-162 - [c35]Jesper Larsson Träff:
Hierarchical Gather/Scatter Algorithms with Graceful Degradation. IPDPS 2004 - [c34]Jesper Larsson Träff, Joachim Worringen:
Verifying Collective MPI Calls. PVM/MPI 2004: 18-27 - [c33]Rolf Rabenseifner, Jesper Larsson Träff:
More Efficient Reduction Algorithms for Non-Power-of-Two Number of Processors in Message-Passing Parallel Systems. PVM/MPI 2004: 36-46 - [c32]Jesper Larsson Träff:
A Simple Work-Optimal Broadcast Algorithm for Message-Passing Parallel Systems. PVM/MPI 2004: 173-180 - 2003
- [c31]Irit Katriel, Peter Sanders, Jesper Larsson Träff:
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. ESA 2003: 679-690 - [c30]Jesper Larsson Träff:
SMP-Aware Message Passing Programming. HIPS 2003: 56-65 - [c29]Bernd Mohr, Jesper Larsson Träff:
Initial Design of a Test Suite for Automatic Performance Analysis Tools. HIPS 2003: 77-86 - [c28]Jesper Larsson Träff:
SMP-Aware Message Passing Programming. IPDPS 2003: 130 - [c27]Bernd Mohr, Jesper Larsson Träff:
Initial Design of a Test Suite for Automatic Performance Analysis Tools. IPDPS 2003: 131 - [c26]Joachim Worringen, Jesper Larsson Träff, Hubert Ritzdorf:
Improving Generic Non-contiguous File Access for MPI-IO. PVM/MPI 2003: 309-318 - [c25]Joachim Worringen, Jesper Larsson Träff, Hubert Ritzdorf:
Fast Parallel Non-Contiguous File Access. SC 2003: 60 - 2002
- [j8]Ralf H. Reussner, Peter Sanders, Jesper Larsson Träff:
SKaMPI: a comprehensive benchmark for public benchmarking of MPI. Sci. Program. 10(1): 55-65 (2002) - [c24]Peter Sanders, Jesper Larsson Träff:
The Hierarchical Factor Algorithm for All-to-All Communication (Research Note). Euro-Par 2002: 799-804 - [c23]Jesper Larsson Träff:
Improved MPI All-to-all Communication on a Giganet SMP Cluster. PVM/MPI 2002: 392-400 - [c22]Jesper Larsson Träff:
Implementing the MPI process topology mechanism. SC 2002: 40:1-40:14 - 2001
- [b2]Jörg Keller, Christoph W. Keßler, Jesper Larsson Träff:
Practical PRAM programming. Wiley series on parallel and distributed computing, Wiley 2001, pp. I-XXIII, 1-572 - [c21]Maciej Golebiewski, Jesper Larsson Träff:
MPI-2 One-Sided Communications on a Giganet SMP Cluster. PVM/MPI 2001: 16-23 - 2000
- [j7]Jesper Larsson Träff, Christos D. Zaroliagis:
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. J. Parallel Distributed Comput. 60(9): 1103-1124 (2000) - [c20]Thomas Fahringer, Michael Gerndt, Graham D. Riley, Jesper Larsson Träff:
Specification of Performance Problems in MPI Programs with ASL. ICPP 2000: 51-60 - [c19]Thomas Fahringer, Michael Gerndt, Graham D. Riley, Jesper Larsson Träff:
On Performance Modeling for HPF Applications with ASL. ISHPC 2000: 191-204 - [c18]Thomas Fahringer, Michael Gerndt, Graham D. Riley, Jesper Larsson Träff:
Formalizing OpenMP Performance Properties with ASL. ISHPC 2000: 428-439 - [c17]Ralf H. Reussner, Jesper Larsson Träff, Gunnar Hunzelmann:
A Benchmark for MPI Derived Datatypes. PVM/MPI 2000: 10-17 - [c16]Jesper Larsson Träff, Hubert Ritzdorf, Rolf Hempel:
The Implementation of MPI-2 One-Sided Communication for the NEC SX-5. SC 2000: 1 - no results
1990 – 1999
- 1999
- [j6]Christoph W. Keßler, Jesper Larsson Träff:
Language and library support for practical PRAM programming. Parallel Comput. 25(2): 105-135 (1999) - [c15]Maciej Golebiewski, Achim Basermann, Markus Baum, Rolf Hempel, Hubert Ritzdorf, Jesper Larsson Träff:
A PC Cluster with Application-Quality MPI. Euro-Par 1999: 613-623 - [c14]Jesper Larsson Träff, Rolf Hempel, Hubert Ritzdorf, Falk Zimmermann:
Flattening on the Fly: Efficient Handling of MPI Derived Datatypes. PVM/MPI 1999: 109-116 - 1998
- [j5]Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis:
A Parallel Priority Queue with Constant Time Operations. J. Parallel Distributed Comput. 49(1): 4-21 (1998) - [c13]Jesper Larsson Träff:
Portable Randomized List Ranking on Multiprocessors Using MPI. PVM/MPI 1998: 395-402 - [c12]Torben Hagerup, Peter Sanders, Jesper Larsson Träff:
An Implementation of the Binary Blocking Flow Algorithm. WAE 1998: 143-154 - 1997
- [c11]Jyrki Katajainen, Jesper Larsson Träff:
A Meticulous Analysis of Mergesort Programs. CIAC 1997: 217-228 - [c10]Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis:
A Parallel Priority Data Structure with Applications. IPPS 1997: 689-693 - [c9]Christoph W. Keßler, Jesper Larsson Träff:
Language and library support for practical PRAM programming. PDP 1997: 216-221 - [c8]Artur Czumaj, Paolo Ferragina, Leszek Gasieniec, S. Muthukrishnan, Jesper Larsson Träff:
The Architecture of a Software Library for String Processing. WAE 1997: 166-176 - 1996
- [c7]Jesper Larsson Träff, Christos D. Zaroliagis:
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. IRREGULAR 1996: 183-194 - [c6]Christoph W. Keßler, Jesper Larsson Träff:
A Library of Basic PRAM Algorithms and its Implementation in FORK. SPAA 1996: 193-195 - 1995
- [b1]Jesper Larsson Träff:
Distributed and parallel graph algorithms - models and experiments. University Kopenhagen, 1995, pp. 1-263 - [j4]Jesper Larsson Träff:
An Experimental Comparison of two Distributed Single-Source Shortest Path Algorithms. Parallel Comput. 21(9): 1505-1532 (1995) - 1994
- [j3]Jens Clausen, Jesper Larsson Träff:
Do Inherently Sequential Branch-and-Bound Algorithms Exist? Parallel Process. Lett. 4: 3-13 (1994) - [c5]Jesper Larsson Träff:
Distributed, Synchronized Implementation of an Algorithm for the Maximum Flow Problem. ICPP (3) 1994: 110-114 - 1993
- [c4]Jesper Larsson Träff:
Parallel and Distributed Algorithms for the Single-Source Shortest Path Problem Based on Moore's Algorithm. PARCO 1993: 555-558 - [c3]Jesper Larsson Träff:
Precis: Distributed Shortest Path Algorithms. PARLE 1993: 720-723 - 1992
- [j2]Torben Amtoft, Jesper Larsson Träff:
Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA. Theor. Comput. Sci. 98(2): 347-356 (1992) - [c2]Jesper Larsson Träff, Steven David Prestwich:
Meta-Programming for Reordering Literals in Deductive Databases. META 1992: 280-293 - 1991
- [j1]Jens Clausen, Jesper Larsson Träff:
Implementation of parallel branch-and-bound algorithms - experiences with the graph partitioning problem. Ann. Oper. Res. 33(5): 329-349 (1991) - no results
1980 – 1989
- 1989
- [c1]Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones:
Experiments with Implementations of Two Theoretical Constructions. Logic at Botik 1989: 119-133 - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-02 01:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
