TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Jesper Larsson Träff

Univ.Prof. Dr. / MSc PhD

Research Focus

  • Computer Engineering: 70%
  • Logic and Computation: 20%

Research Areas

  • parallel algorithms, Scheduling, parallel computing, parallel programming, parallel programming models, Message Passing Interface (MPI)
Jesper Larsson Träff

About

Basic Research in Parallel Computing with focus on - Models and Algorithms for fundamental problems - Algorithms and Data Structures for Shared-Memory Systems - Complexity theory for Parallel Computing - Scheduling and Routing - Software Interfaces for Parallel Computing, for example Message-Passing Interface (MPI) - High-Performance Computing - experimental parallel Algorithmics - Performance Analysis and Benchmarking

Roles

  • Head of Research Unit
    Parallel Computing, E191-04
  • Full Professor
    Parallel Computing, E191-04
  • Faculty Council
    Substitute Member
  • Curriculum Commission for Informatics
    Substitute Member

Contact

2023W

 

2023

2022

2021

2020

  • A more Pragmatic Implementation of the Lock-free, Ordered, Linked List / Träff, J. L., & Pöter, M. (2020). A more Pragmatic Implementation of the Lock-free, Ordered, Linked List (2010.15755). arXiv. https://doi.org/10.48550/arXiv.2010.15755
  • k-ported vs. k-lane Broadcast, Scatter, and Alltoall Algorithms / Träff, J. L. (2020). k-ported vs. k-lane Broadcast, Scatter, and Alltoall Algorithms (2008.12144). arXiv. https://doi.org/10.48550/arXiv.2008.12144
  • Efficient Process-to-Node Mapping Algorithms for Stencil Computations / Hunold, S., von Kirchbach, K., Lehr, M., Schulz, C., & Träff, J. L. (2020). Efficient Process-to-Node Mapping Algorithms for Stencil Computations (2005.09521). arXiv. https://doi.org/10.48550/arXiv.2005.09521
    Project: Process Mapping (2019–2024)
  • High-Quality Hierarchical Process Mapping / Faraj, M. F., van der Grinten, A., Meyerhenke, H., Träff, J. L., & Schulz, C. (2020). High-Quality Hierarchical Process Mapping (2001.07134). arXiv. https://doi.org/10.48550/arXiv.2001.07134
  • Special issue: Selected papers from EuroMPI 2019 / Träff, J. L., & Hoefler, T. (2020). Special issue: Selected papers from EuroMPI 2019. Parallel Computing, 99, Article 102695. https://doi.org/10.1016/j.parco.2020.102695
  • Better Process Mapping and Sparse Quadratic Assignment / Kirchbach, K. V., Schulz, C., & Träff, J. L. (2020). Better Process Mapping and Sparse Quadratic Assignment. ACM Journal on Experimental Algorithmics, 25, 1–19. https://doi.org/10.1145/3409667
    Project: Process Mapping (2019–2024)
  • Decomposing MPI Collectives for Exploiting Multi-lane Communication / Träff, J. L. (2020). Decomposing MPI Collectives for Exploiting Multi-lane Communication. SPCL_Bcast, ETH Zürich - Online, Zurich, Switzerland, Non-EU. http://hdl.handle.net/20.500.12708/87082
  • Decomposing MPI Collectives for Exploiting Multi-lane Communication / Träff, J. L., & Hunold, S. (2020). Decomposing MPI Collectives for Exploiting Multi-lane Communication. In 2020 IEEE International Conference on Cluster Computing (CLUSTER). IEEE International Conference on Cluster Computing (IEEE Cluster 2020) - Online Conference, Kobe, Japan, Non-EU. IEEE. https://doi.org/10.1109/cluster49012.2020.00037
  • Signature Datatypes for Type Correct Collective Operations, Revisited / Träff, J. L. (2020). Signature Datatypes for Type Correct Collective Operations, Revisited. In 27th European MPI Users’ Group Meeting. 27th European MPI Users’ Group Meeting (EuroMPI/USA 2020) - Online Conference, Austin, Texas, USA, Non-EU. IEEE. https://doi.org/10.1145/3416315.3416324
  • Collectives and Communicators: A Case for Orthogonality / Träff, J. L., Hunold, S., Mercier, G., & Holmes, D. J. (2020). Collectives and Communicators: A Case for Orthogonality. In 27th European MPI Users’ Group Meeting. 27th European MPI Users’ Group Meeting (EuroMPI/USA 2020) - Online Conference, Austin, Texas, USA, Non-EU. IEEE. https://doi.org/10.1145/3416315.3416319
  • High-Quality Hierarchical Process Mapping / Faraj, M. F., van der Grinten, A., Meyerhenke, H., Träff, J. L., & Schulz, C. (2020). High-Quality Hierarchical Process Mapping. In S. Faro & D. Cantone (Eds.), 18th International Symposium on Experimental Algorithms, SEA 2020 (pp. 4:1-4:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SEA.2020.4
    Project: Process Mapping (2019–2024)
  • Classical and pipelined preconditioned conjugate gradient methods with node-failure resilience / Pachajoa, C., Levonyak, M., Pacher, C., Träff, J. L., & Gansterer, W. (2020). Classical and pipelined preconditioned conjugate gradient methods with node-failure resilience. In A. Schlögl, J. Kiss, & S. Elefante (Eds.), Austrian High-Performance-Computing Meeting (AHPC 2020) (p. 13). IST Austria. https://doi.org/10.15479/AT:ISTA:7474
  • Exploiting Multi-lane Communication in MPI Collectives / Träff, J. L. (2020). Exploiting Multi-lane Communication in MPI Collectives. In A. Schlögl, J. Kiss, & S. Elefante (Eds.), Austrian High-Performance-Computing Meeting (AHPC 2020) (p. 30). IST Austria. https://doi.org/10.15479/AT:ISTA:7474
  • Efficient Process-to-Node Mapping Algorithms for Stencil Computations / von Kirchbach, K., Lehr, M., Hunold, S., Schulz, C., & Träff, J. L. (2020). Efficient Process-to-Node Mapping Algorithms for Stencil Computations. In 2020 IEEE International Conference on Cluster Computing (CLUSTER). IEEE International Conference on Cluster Computing (IEEE Cluster 2020) - Online Conference, Kobe, Japan, Non-EU. IEEE. https://doi.org/10.1109/cluster49012.2020.00011
    Project: Process Mapping (2019–2024)
  • Optimizing Memory Access in TCF Processors with Compute-Update Operations / Forsell, M., Roivainen, J., & Träff, J. L. (2020). Optimizing Memory Access in TCF Processors with Compute-Update Operations. In 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 22nd Workshop on Advances in Parallel and Distributed Computational Models (APDCM 2020) in conjunction with IPDPS 2020 - Online Conference, New Orleans, Louisiana, USA, Non-EU. IEEE. https://doi.org/10.1109/ipdpsw50202.2020.00100

2019

2018

2017

  • Better Process Mapping and Sparse Quadratic Assignment / Schulz, C., & Träff, J. L. (2017). Better Process Mapping and Sparse Quadratic Assignment. In C. S. Iliopoulos, S. P. Pissis, S. J. Puglisi, & R. Raman (Eds.), 16th International Symposium on Experimental Algorithms, SEA 2017 (pp. 4:1-4:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SEA.2017.4
  • A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it) / Pöter, M., & Träff, J. L. (2017). A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it) (1712.06134). arXiv. https://doi.org/10.48550/arXiv.1712.06134
  • On Optimal Trees for Irregular Gather and Scatter Collectives / Träff, J. L. (2017). On Optimal Trees for Irregular Gather and Scatter Collectives (1711.08731). arXiv. https://doi.org/10.48550/arXiv.1711.08731
  • Better Process Mapping and Sparse Quadratic Assignment / Schulz, C., & Träff, J. L. (2017). Better Process Mapping and Sparse Quadratic Assignment (1702.04164). arXiv. https://doi.org/10.48550/arXiv.1702.04164
  • Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter / Träff, J. L. (2017). Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter (1702.05967). arXiv. https://doi.org/10.48550/arXiv.1702.05967
    Project: MPI (2013–2018)
  • VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide / Schulz, C., & Träff, J. L. (2017). VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide (1703.05509). arXiv. https://doi.org/10.48550/arXiv.1703.05509
  • On expected and observed communication performance with MPI derived datatypes / Carpen-Amarie, A., Hunold, S., & Träff, J. L. (2017). On expected and observed communication performance with MPI derived datatypes. Parallel Computing: Systems & Applications, 69, 98–117. https://doi.org/10.1016/j.parco.2017.08.006
    Projects: EPiGRAM (2013–2016) / MPI (2013–2018)
  • MPI Is 25 Years Old! / Lusk, E., & Träff, J. L. (2017). MPI Is 25 Years Old! HPCwire, MAY 1. http://hdl.handle.net/20.500.12708/146783
  • The past 25 years of MPI / Träff, J. L. (2017). The past 25 years of MPI. Panel at ISC High Performance Conference 2017 - The HPC Event, Intel booth, Frankfurt, Germany, EU. http://hdl.handle.net/20.500.12708/86517
  • Fast Processing of MPI Derived Datatypes? / Träff, J. L. (2017). Fast Processing of MPI Derived Datatypes? Mini Workshop Algorithms Engineering, Uni Wien, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/86518
  • High Performance Expectations for MPI / Träff, J. L. (2017). High Performance Expectations for MPI. Friedrich-Alexander-Universität Erlangen-Nürnberg, Prof. Dr. Gerhard Wellein, Erlangen, Germany, EU. http://hdl.handle.net/20.500.12708/86505
  • Exploiting Common Neighborhoods to Optimize MPI Neighborhood Collectives / Mirsadeghi, S. H., Träff, J. L., Balaji, P., & Afsahi, A. (2017). Exploiting Common Neighborhoods to Optimize MPI Neighborhood Collectives. In 2017 IEEE 24th International Conference on High Performance Computing (HiPC). 24th IEEE International Conference on High Performance Computing (HiPC 2017), Jaipur, India, Non-EU. IEEE. https://doi.org/10.1109/hipc.2017.00047
  • Supporting concurrent memory access in TCF-aware processor architectures / Forsell, M., Roivainen, J., Leppänen, V., & Träff, J. L. (2017). Supporting concurrent memory access in TCF-aware processor architectures. In J. Nurmi, M. Vesterbacka, J. J. Wikner, A. Alvandpour, M. Nielsen-Lönn, & I. R. Nielsen (Eds.), 2017 IEEE Nordic Circuits and Systems Conference (NORCAS): NORCHIP and International Symposium of System-on-Chip (SoC). IEEE. https://doi.org/10.1109/norchip.2017.8124962
  • Practical, linear-time, fully distributed algorithms for irregular gather and scatter / Träff, J. L. (2017). Practical, linear-time, fully distributed algorithms for irregular gather and scatter. In Proceedings of the 24th European MPI Users’ Group Meeting on - EuroMPI ’17. 24th European MPI Users’ Group Meeting (EuroMPI/USA 2017), Chicago, IL, USA, Non-EU. ACM. https://doi.org/10.1145/3127024.3127025
    Project: MPI (2013–2018)
  • High Performance Expectations for MPI / Träff, J. L. (2017). High Performance Expectations for MPI. In G. Baumgartner & J. Courian (Eds.), AHPC 2017, Austrian HPC Meeting 2017 (p. 33). FSP Scientific Computing, University of Innsbruck. http://hdl.handle.net/20.500.12708/56920

2016

2015

  • Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions / Ganian, R., Kalany, M., Szeider, S., & Träff, J. L. (2015). Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions (1506.09100). arXiv. https://doi.org/10.48550/arXiv.1506.09100
  • The Shortest Path Problem with Edge Information Reuse is NP-Complete / Träff, J. L. (2015). The Shortest Path Problem with Edge Information Reuse is NP-Complete (1509.05637). arXiv. https://doi.org/10.48550/arXiv.1509.05637
  • The Lock-free k-LSM Relaxed Priority Queue / Wimmer, M., Gruber, J., Träff, J. L., & Tsigas, P. (2015). The Lock-free k-LSM Relaxed Priority Queue (1503.05698). arXiv. https://doi.org/10.48550/arXiv.1503.05698
  • The Power of Structured Data in MPI / Träff, J. L. (2015). The Power of Structured Data in MPI. The University of Texas at Austin, Prof. Robert A. van de Geijn, Austin, Texas, Non-EU. http://hdl.handle.net/20.500.12708/86053
  • MPI Datatype reconstruction (for vector and index types) / Träff, J. L. (2015). MPI Datatype reconstruction (for vector and index types). Compilers and Languages Group, Institute of Computer Languages, TU Wien, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/86126
  • The Relative Power of Synchronization Primitives / Träff, J. L. (2015). The Relative Power of Synchronization Primitives. Computational Mathematics in Engineering Group - Prof. Dr. Joachim Schöberl, Institute for Analysis and Scientific Computing, TU Wien, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/86043
  • Specification Guideline Violations by MPI_Dims_create / Träff, J. L., & Lübbe, F. D. (2015). Specification Guideline Violations by MPI_Dims_create. In J. Dongarra, A. Denis, B. Goglin, E. Jeannot, & G. Mercier (Eds.), Proceedings of the 22nd European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2802658.2802677
    Project: MPI (2013–2018)
  • Isomorphic, Sparse MPI-like Collective Communication Operations for Parallel Stencil Computations / Träff, J. L., Lübbe, F. D., Rougier, A., & Hunold, S. (2015). Isomorphic, Sparse MPI-like Collective Communication Operations for Parallel Stencil Computations. In J. Dongarra, A. Denis, B. Goglin, E. Jeannot, & G. Mercier (Eds.), Proceedings of the 22nd European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2802658.2802663
    Projects: EPiGRAM (2013–2016) / MPI (2013–2018)
  • Efficient, Optimal MPI Datatype Reconstruction for Vector and Index Types / Kalany, M., & Träff, J. L. (2015). Efficient, Optimal MPI Datatype Reconstruction for Vector and Index Types. In J. Dongarra, A. Denis, B. Goglin, E. Jeannot, & G. Mercier (Eds.), Proceedings of the 22nd European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2802658.2802671
    Project: EPiGRAM (2013–2016)
  • The lock-free k-LSM relaxed priority queue / Wimmer, M., Gruber, J., Träff, J. L., & Tsigas, P. (2015). The lock-free k-LSM relaxed priority queue. In A. Cohen & D. Grove (Eds.), Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM. https://doi.org/10.1145/2688500.2688547
  • Euro-Par 2015: Parallel Processing / Euro-Par 2015: Parallel Processing. (2015). In J. L. Träff, S. Hunold, & F. Versaci (Eds.), Lecture Notes in Computer Science. Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-662-48096-0

2014

  • An improved, easily computable combinatorial lower bound for weighted graph bipartitioning / Träff, J. L., & Wimmer, M. (2014). An improved, easily computable combinatorial lower bound for weighted graph bipartitioning (1410.0462). arXiv. https://doi.org/10.48550/arXiv.1410.0462
  • Preface: Selected Papers from EuroMPI 2012 / Träff, J. L., & Benkner, S. (2014). Preface: Selected Papers from EuroMPI 2012. Computing, 96(4), 259–261. https://doi.org/10.1007/s00607-013-0335-z
  • Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge / Siebert, C., & Träff, J. L. (2014). Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge. Parallel Processing Letters, 24(01), 1450005. https://doi.org/10.1142/s0129626414500054
  • Reproducible MPI Micro-Benchmarking Isn't As Easy As You Think / Hunold, S., Carpen-Amarie, A., & Träff, J. L. (2014). Reproducible MPI Micro-Benchmarking Isn’t As Easy As You Think. Research Group Theory and Applications of Algorithms, University of Vienna, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/85872
    Projects: MPI (2013–2018) / ReproPC (2013–2016)
  • The Power of Structured Data in MPI / Träff, J. L. (2014). The Power of Structured Data in MPI. Compiler Technology and Computer Architecure Group at the University of Hertfordshire, Hertfordshire, United Kingdom, EU. http://hdl.handle.net/20.500.12708/85832
  • The Power of Structured Data in MPI / Träff, J. L. (2014). The Power of Structured Data in MPI. Research Group Theory and Applications of Algorithms and Research Group Scientific Computing, University of Vienna, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/85825
  • The Power of Structured Data in MPI / Träff, J. L. (2014). The Power of Structured Data in MPI. I3MS Seminar Series, Aachen GRS, RWTH Aachen, Aachen, Germany, EU. http://hdl.handle.net/20.500.12708/85805
    Projects: EPiGRAM (2013–2016) / MPI (2013–2018)
  • Implementing a classic: zero-copy all-to-all communication with MPI datatypes / Träff, J. L. (2014). Implementing a classic: zero-copy all-to-all communication with MPI datatypes. Department of Computer Science, University of Copenhagen, Copenhagen, Denmark, EU. http://hdl.handle.net/20.500.12708/85783
  • Reproducible MPI Micro-Benchmarking Isn't As Easy As You Think / Hunold, S., Carpen-Amarie, A., & Träff, J. L. (2014). Reproducible MPI Micro-Benchmarking Isn’t As Easy As You Think. In J. Dongarra, Y. Ishikawa, & A. Hori (Eds.), Proceedings of the 21st European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2642769.2642785
    Projects: MPI (2013–2018) / ReproPC (2013–2016)
  • Optimal MPI Datatype Normalization for Vector and Index-block Types / Träff, J. L. (2014). Optimal MPI Datatype Normalization for Vector and Index-block Types. In J. Dongarra, Y. Ishikawa, & A. Hori (Eds.), Proceedings of the 21st European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2642769.2642771
    Project: EPiGRAM (2013–2016)
  • Zero-copy, Hierarchical Gather is not possible with MPI Datatypes and Collectives / Träff, J. L., & Rougier, A. (2014). Zero-copy, Hierarchical Gather is not possible with MPI Datatypes and Collectives. In J. Dongarra, Y. Ishikawa, & A. Hori (Eds.), Proceedings of the 21st European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2642769.2642772
  • MPI Collectives and Datatypes for Hierarchical All-to-all Communication / Träff, J. L., & Rougier, A. (2014). MPI Collectives and Datatypes for Hierarchical All-to-all Communication. In J. Dongarra, Y. Ishikawa, & A. Hori (Eds.), Proceedings of the 21st European MPI Users’ Group Meeting. ACM. https://doi.org/10.1145/2642769.2642770
  • Implementing a classic / Träff, J. L., Rougier, A., & Hunold, S. (2014). Implementing a classic. In M. Gerndt, P. Stenström, L. Rauchwerger, B. Miller, & M. Schulz (Eds.), Proceedings of the 28th ACM international conference on Supercomputing - ICS ’14. ACM. https://doi.org/10.1145/2597652.2597662
  • Data structures for task-based priority scheduling / Wimmer, M., Versaci, F., Träff, J. L., Cederman, D., & Tsigas, P. (2014). Data structures for task-based priority scheduling. In Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP ’14. 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014, Orlando, Florida, USA, Non-EU. ACM. https://doi.org/10.1145/2555243.2555278

2013

2012

2011

 

  • Innovation Radar: Innovation Title: PGAS-based MPI with interoperability; Innovation Category: Exploration; FP 7 project EPiGRAM
    2018 / Project
  • Best Paper Award: "Reproducible MPI Micro-Benchmarking Isn't As Easy As You Think", S. Hunold, A. Carpen-Amarie, J. Träff, 21st European MPI Users' Group Meeting, EuroMPI/ASIA 2014, Kyoto, Japan, September 9-12, 2014
    2014 / Program Chairs of EuroMPI/ASIA 2014 / Japan

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Jesper Larsson Träff’s research profile in TISS .