| 2009 |
| 66 | EE | 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
Springer 2009 |
| 2008 |
| 65 | | 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
Springer 2008 |
| 64 | EE | Jörg Wagner,
Armin Jahanpanah,
Jesper Larsson Träff:
User-Land Work Stealing Schedulers: Towards a Standard.
CISIS 2008: 811-816 |
| 63 | EE | Martti Forsell,
Jesper Larsson Träff:
Second Workshop on Highly Parallel Processing on a Chip (HPPC 2008).
Euro-Par Workshops 2008: 123-125 |
| 62 | EE | 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 |
| 61 | EE | Faisal Ghias Mir,
Jesper Larsson Träff:
Constructing MPI Input-output Datatypes for Efficient Transpacking.
PVM/MPI 2008: 141-150 |
| 60 | EE | 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 |
| 59 | EE | 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 |
| 58 | EE | Jesper Larsson Träff,
Andreas Ripke:
Optimal broadcast for fully connected processor-node networks.
J. Parallel Distrib. Comput. 68(7): 887-901 (2008) |
| 2007 |
| 57 | EE | Martti Forsell,
Jesper Larsson Träff:
HPPC 2007: Workshop on Highly Parallel Processing on a Chip.
Euro-Par Workshops 2007: 3-4 |
| 56 | EE | Peter Sanders,
Jochen Speck,
Jesper Larsson Träff:
Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees.
PVM/MPI 2007: 17-26 |
| 55 | EE | Jesper Larsson Träff,
William Gropp,
Rajeev Thakur:
Self-consistent MPI Performance Requirements.
PVM/MPI 2007: 36-45 |
| 54 | EE | Michael Gerndt,
Bernd Mohr,
Jesper Larsson Träff:
A test suite for parallel performance analysis tools.
Concurrency and Computation: Practice and Experience 19(11): 1465-1480 (2007) |
| 53 | EE | Bernd Mohr,
Jesper Larsson Träff,
Joachim Worringen:
Selected papers from EuroPVM/MPI 2006.
Parallel Computing 33(9): 593-594 (2007) |
| 2006 |
| 52 | | Bernd Mohr,
Jesper Larsson Träff,
Joachim Worringen,
Jack 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
Springer 2006 |
| 51 | EE | Hubert Ritzdorf,
Jesper Larsson Träff:
Collective operations in NEC's high-performance MPI libraries.
IPDPS 2006 |
| 50 | EE | Guntram Berti,
Jesper Larsson Träff:
What MPI Could (and Cannot) Do for Mesh-Partitioning on Non-homogeneous Networks.
PVM/MPI 2006: 293-302 |
| 49 | EE | Peter Sanders,
Jesper Larsson Träff:
Parallel Prefix (Scan) Algorithms for MPI.
PVM/MPI 2006: 49-57 |
| 48 | EE | Jesper Larsson Träff:
Efficient Allgather for Regular SMP-Clusters.
PVM/MPI 2006: 58-65 |
| 47 | EE | Jesper Larsson Träff:
Direct graph k-partitioning with a Kernighan-Lin like heuristic.
Oper. Res. Lett. 34(6): 621-629 (2006) |
| 2005 |
| 46 | EE | Jesper Larsson Träff,
Andreas Ripke:
Optimal Broadcast for Fully Connected Networks.
HPCC 2005: 45-56 |
| 45 | | Jesper Larsson Träff,
Joachim Worringen:
The MPI/SX Collectives Verification Library.
PARCO 2005: 909-916 |
| 44 | EE | Jesper Larsson Träff:
An Improved Algorithm for (Non-commutative) Reduce-Scatter with an Application.
PVM/MPI 2005: 129-137 |
| 43 | EE | Jesper Larsson Träff,
Andreas Ripke:
An Optimal Broadcast Algorithm Adapted to SMP Clusters.
PVM/MPI 2005: 48-56 |
| 2004 |
| 42 | EE | Michael Gerndt,
Bernd Mohr,
Jesper Larsson Träff:
Evaluating OpenMP Performance Analysis Tools with the APART Test Suite.
Euro-Par 2004: 155-162 |
| 41 | EE | Jesper Larsson Träff:
Hierarchical Gather/Scatter Algorithms with Graceful Degradation.
IPDPS 2004 |
| 40 | EE | Jesper Larsson Träff:
A Simple Work-Optimal Broadcast Algorithm for Message-Passing Parallel Systems.
PVM/MPI 2004: 173-180 |
| 39 | EE | Jesper Larsson Träff,
Joachim Worringen:
Verifying Collective MPI Calls.
PVM/MPI 2004: 18-27 |
| 38 | EE | 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 |
| 2003 |
| 37 | EE | Irit Katriel,
Peter Sanders,
Jesper Larsson Träff:
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
ESA 2003: 679-690 |
| 36 | EE | Jesper Larsson Träff:
SMP-Aware Message Passing Programming.
HIPS 2003: 56-65 |
| 35 | EE | Bernd Mohr,
Jesper Larsson Träff:
Initial Design of a Test Suite for Automatic Performance Analysis Tools.
HIPS 2003: 77-86 |
| 34 | EE | Jesper Larsson Träff:
SMP-Aware Message Passing Programming.
IPDPS 2003: 130 |
| 33 | EE | Bernd Mohr,
Jesper Larsson Träff:
Initial Design of a Test Suite for Automatic Performance Analysis Tools.
IPDPS 2003: 131 |
| 32 | EE | Joachim Worringen,
Jesper Larsson Träff,
Hubert Ritzdorf:
Improving Generic Non-contiguous File Access for MPI-IO.
PVM/MPI 2003: 309-318 |
| 31 | EE | Joachim Worringen,
Jesper Larsson Träff,
Hubert Ritzdorf:
Fast Parallel Non-Contiguous File Access.
SC 2003: 60 |
| 2002 |
| 30 | EE | Peter Sanders,
Jesper Larsson Träff:
The Hierarchical Factor Algorithm for All-to-All Communication (Research Note).
Euro-Par 2002: 799-804 |
| 29 | EE | Jesper Larsson Träff:
Improved MPI All-to-all Communication on a Giganet SMP Cluster.
PVM/MPI 2002: 392-400 |
| 28 | EE | Jesper Larsson Träff:
Implementing the MPI process topology mechanism.
SC 2002: 1-14 |
| 27 | | Ralf Reussner,
Peter Sanders,
Jesper Larsson Träff:
SKaMPI: a comprehensive benchmark for public benchmarking of MPI.
Scientific Programming 10(1): 55-65 (2002) |
| 2001 |
| 26 | EE | Maciej Golebiewski,
Jesper Larsson Träff:
MPI-2 One-Sided Communications on a Giganet SMP Cluster.
PVM/MPI 2001: 16-23 |
| 2000 |
| 25 | EE | Thomas Fahringer,
Michael Gerndt,
Graham D. Riley,
Jesper Larsson Träff:
Specification of Performance Problems in MPI Programs with ASL.
ICPP 2000: 51- |
| 24 | EE | Thomas Fahringer,
Michael Gerndt,
Graham D. Riley,
Jesper Larsson Träff:
On Performance Modeling for HPF Applications with ASL.
ISHPC 2000: 191-204 |
| 23 | EE | Thomas Fahringer,
Michael Gerndt,
Graham D. Riley,
Jesper Larsson Träff:
Formalizing OpenMP Performance Properties with ASL.
ISHPC 2000: 428-439 |
| 22 | EE | Ralf Reussner,
Jesper Larsson Träff,
Gunnar Hunzelmann:
A Benchmark for MPI Derived Datatypes.
PVM/MPI 2000: 10-17 |
| 21 | EE | Jesper Larsson Träff,
Hubert Ritzdorf,
Rolf Hempel:
The Implementation of MPI-2 One-Sided Communication for the NEC SX-5.
SC 2000 |
| 20 | EE | Jesper Larsson Träff,
Christos D. Zaroliagis:
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs.
J. Parallel Distrib. Comput. 60(9): 1103-1124 (2000) |
| 1999 |
| 19 | EE | 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 |
| 18 | EE | 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 |
| 17 | | Christoph W. Keßler,
Jesper Larsson Träff:
Language and library support for practical PRAM programming.
Parallel Computing 25(2): 105-135 (1999) |
| 1998 |
| 16 | | Torben Hagerup,
Peter Sanders,
Jesper Larsson Träff:
An Implementation of the Binary Blocking Flow Algorithm.
Algorithm Engineering 1998: 143-154 |
| 15 | EE | Jesper Larsson Träff:
Portable Randomized List Ranking on Multiprocessors Using MPI.
PVM/MPI 1998: 395-402 |
| 14 | | Gerth Stølting Brodal,
Jesper Larsson Träff,
Christos D. Zaroliagis:
A Parallel Priority Queue with Constant Time Operations.
J. Parallel Distrib. Comput. 49(1): 4-21 (1998) |
| 1997 |
| 13 | | Jyrki Katajainen,
Jesper Larsson Träff:
A Meticulous Analysis of Mergesort Programs.
CIAC 1997: 217-228 |
| 12 | EE | Gerth Stølting Brodal,
Jesper Larsson Träff,
Christos D. Zaroliagis:
A Parallel Priority Data Structure with Applications.
IPPS 1997: 689-693 |
| 11 | | Christoph W. Keßler,
Jesper Larsson Träff:
Language and library support for practical PRAM programming.
PDP 1997: 216-221 |
| 1996 |
| 10 | | 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 |
| 9 | | Christoph W. Keßler,
Jesper Larsson Träff:
A Library of Basic PRAM Algorithms and its Implementation in FORK.
SPAA 1996: 193-195 |
| 1995 |
| 8 | | Jesper Larsson Träff:
An Experimental Comparison of two Distributed Single-Source Shortest Path Algorithms.
Parallel Computing 21(9): 1505-1532 (1995) |
| 1994 |
| 7 | | Jesper Larsson Träff:
Distributed, Synchronized Implementation of an Algorithm for the Maximum Flow Problem.
ICPP (3) 1994: 110-114 |
| 6 | | Jens Clausen,
Jesper Larsson Träff:
Do Inherently Sequential Branch-and-Bound Algorithms Exist?
Parallel Processing Letters 4: 3-13 (1994) |
| 1993 |
| 5 | | Jesper Larsson Träff:
Parallel and Distributed Algorithms for the Single-Source Shortest Path Problem Based on Moore's Algorithm.
PARCO 1993: 555-558 |
| 4 | | Jesper Larsson Träff:
Precis: Distributed Shortest Path Algorithms.
PARLE 1993: 720-723 |
| 1992 |
| 3 | | Jesper Larsson Träff,
Steven David Prestwich:
Meta-Programming for Reordering Literals in Deductive Databases.
META 1992: 280-293 |
| 2 | | Torben Amtoft,
Jesper Larsson Träff:
Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA.
Theor. Comput. Sci. 98(2): 347-356 (1992) |
| 1989 |
| 1 | | 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 |