The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jesper Larsson Träff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jyrki Katajainen, Jesper Larsson Träff
    A Meticulous Analysis of Mergesort Programs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:217-228 [Conf]
  2. Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones
    Experiments with Implementations of Two Theoretical Constructions. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:119-133 [Conf]
  3. Irit Katriel, Peter Sanders, Jesper Larsson Träff
    A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:679-690 [Conf]
  4. Michael Gerndt, Bernd Mohr, Jesper Larsson Träff
    Evaluating OpenMP Performance Analysis Tools with the APART Test Suite. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:155-162 [Conf]
  5. Maciej Golebiewski, Achim Basermann, Markus Baum, Rolf Hempel, Hubert Ritzdorf, Jesper Larsson Träff
    A PC Cluster with Application-Quality MPI. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:613-623 [Conf]
  6. Peter Sanders, Jesper Larsson Träff
    The Hierarchical Factor Algorithm for All-to-All Communication (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:799-804 [Conf]
  7. Bernd Mohr, Jesper Larsson Träff
    Initial Design of a Test Suite for Automatic Performance Analysis Tools. [Citation Graph (0, 0)][DBLP]
    HIPS, 2003, pp:77-86 [Conf]
  8. Jesper Larsson Träff
    SMP-Aware Message Passing Programming. [Citation Graph (0, 0)][DBLP]
    HIPS, 2003, pp:56-65 [Conf]
  9. Jesper Larsson Träff, Andreas Ripke
    Optimal Broadcast for Fully Connected Networks. [Citation Graph (0, 0)][DBLP]
    HPCC, 2005, pp:45-56 [Conf]
  10. Thomas Fahringer, Michael Gerndt, Graham D. Riley, Jesper Larsson Träff
    Specification of Performance Problems in MPI Programs with ASL. [Citation Graph (0, 0)][DBLP]
    ICPP, 2000, pp:51-0 [Conf]
  11. Jesper Larsson Träff
    Distributed, Synchronized Implementation of an Algorithm for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:110-114 [Conf]
  12. Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
    A Parallel Priority Data Structure with Applications. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:689-693 [Conf]
  13. Bernd Mohr, Jesper Larsson Träff
    Initial Design of a Test Suite for Automatic Performance Analysis Tools. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:131- [Conf]
  14. Jesper Larsson Träff
    SMP-Aware Message Passing Programming. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:130- [Conf]
  15. Jesper Larsson Träff
    Hierarchical Gather/Scatter Algorithms with Graceful Degradation. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  16. Hubert Ritzdorf, Jesper Larsson Träff
    Collective operations in NEC's high-performance MPI libraries. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  17. Jesper Larsson Träff, Christos D. Zaroliagis
    A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:183-194 [Conf]
  18. Thomas Fahringer, Michael Gerndt, Graham D. Riley, Jesper Larsson Träff
    On Performance Modeling for HPF Applications with ASL. [Citation Graph (0, 0)][DBLP]
    ISHPC, 2000, pp:191-204 [Conf]
  19. Thomas Fahringer, Michael Gerndt, Graham D. Riley, Jesper Larsson Träff
    Formalizing OpenMP Performance Properties with ASL. [Citation Graph (0, 0)][DBLP]
    ISHPC, 2000, pp:428-439 [Conf]
  20. Jesper Larsson Träff, Steven David Prestwich
    Meta-Programming for Reordering Literals in Deductive Databases. [Citation Graph (0, 0)][DBLP]
    META, 1992, pp:280-293 [Conf]
  21. Jesper Larsson Träff
    Parallel and Distributed Algorithms for the Single-Source Shortest Path Problem Based on Moore's Algorithm. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:555-558 [Conf]
  22. Jesper Larsson Träff, Joachim Worringen
    The MPI/SX Collectives Verification Library. [Citation Graph (0, 0)][DBLP]
    PARCO, 2005, pp:909-916 [Conf]
  23. Jesper Larsson Träff
    Precis: Distributed Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:720-723 [Conf]
  24. Guntram Berti, Jesper Larsson Träff
    What MPI Could (and Cannot) Do for Mesh-Partitioning on Non-homogeneous Networks. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2006, pp:293-302 [Conf]
  25. Maciej Golebiewski, Jesper Larsson Träff
    MPI-2 One-Sided Communications on a Giganet SMP Cluster. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2001, pp:16-23 [Conf]
  26. Rolf Rabenseifner, Jesper Larsson Träff
    More Efficient Reduction Algorithms for Non-Power-of-Two Number of Processors in Message-Passing Parallel Systems. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2004, pp:36-46 [Conf]
  27. Ralf Reussner, Jesper Larsson Träff, Gunnar Hunzelmann
    A Benchmark for MPI Derived Datatypes. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2000, pp:10-17 [Conf]
  28. Peter Sanders, Jesper Larsson Träff
    Parallel Prefix (Scan) Algorithms for MPI. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2006, pp:49-57 [Conf]
  29. Jesper Larsson Träff
    Improved MPI All-to-all Communication on a Giganet SMP Cluster. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2002, pp:392-400 [Conf]
  30. Jesper Larsson Träff
    A Simple Work-Optimal Broadcast Algorithm for Message-Passing Parallel Systems. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2004, pp:173-180 [Conf]
  31. Jesper Larsson Träff
    An Improved Algorithm for (Non-commutative) Reduce-Scatter with an Application. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2005, pp:129-137 [Conf]
  32. Jesper Larsson Träff
    Efficient Allgather for Regular SMP-Clusters. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2006, pp:58-65 [Conf]
  33. Jesper Larsson Träff
    Portable Randomized List Ranking on Multiprocessors Using MPI. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 1998, pp:395-402 [Conf]
  34. Jesper Larsson Träff, Rolf Hempel, Hubert Ritzdorf, Falk Zimmermann
    Flattening on the Fly: Efficient Handling of MPI Derived Datatypes. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 1999, pp:109-116 [Conf]
  35. Jesper Larsson Träff, Andreas Ripke
    An Optimal Broadcast Algorithm Adapted to SMP Clusters. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2005, pp:48-56 [Conf]
  36. Jesper Larsson Träff, Joachim Worringen
    Verifying Collective MPI Calls. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2004, pp:18-27 [Conf]
  37. Joachim Worringen, Jesper Larsson Träff, Hubert Ritzdorf
    Improving Generic Non-contiguous File Access for MPI-IO. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2003, pp:309-318 [Conf]
  38. Jesper Larsson Träff
    Implementing the MPI process topology mechanism. [Citation Graph (0, 0)][DBLP]
    SC, 2002, pp:1-14 [Conf]
  39. Jesper Larsson Träff, Hubert Ritzdorf, Rolf Hempel
    The Implementation of MPI-2 One-Sided Communication for the NEC SX-5. [Citation Graph (0, 0)][DBLP]
    SC, 2000, pp:- [Conf]
  40. Joachim Worringen, Jesper Larsson Träff, Hubert Ritzdorf
    Fast Parallel Non-Contiguous File Access. [Citation Graph (0, 0)][DBLP]
    SC, 2003, pp:60- [Conf]
  41. Christoph W. Keßler, Jesper Larsson Träff
    A Library of Basic PRAM Algorithms and its Implementation in FORK. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:193-195 [Conf]
  42. Torben Hagerup, Peter Sanders, Jesper Larsson Träff
    An Implementation of the Binary Blocking Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:143-154 [Conf]
  43. Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
    A Parallel Priority Queue with Constant Time Operations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:4-21 [Journal]
  44. Jesper Larsson Träff, Christos D. Zaroliagis
    A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:9, pp:1103-1124 [Journal]
  45. Jesper Larsson Träff
    Direct graph k-partitioning with a Kernighan-Lin like heuristic. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:6, pp:621-629 [Journal]
  46. Christoph W. Keßler, Jesper Larsson Träff
    Language and library support for practical PRAM programming. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1999, v:25, n:2, pp:105-135 [Journal]
  47. Jesper Larsson Träff
    An Experimental Comparison of two Distributed Single-Source Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1995, v:21, n:9, pp:1505-1532 [Journal]
  48. Jens Clausen, Jesper Larsson Träff
    Do Inherently Sequential Branch-and-Bound Algorithms Exist? [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:3-13 [Journal]
  49. Ralf Reussner, Peter Sanders, Jesper Larsson Träff
    SKaMPI: a comprehensive benchmark for public benchmarking of MPI. [Citation Graph (0, 0)][DBLP]
    Scientific Programming, 2002, v:10, n:1, pp:55-65 [Journal]
  50. Torben Amtoft, Jesper Larsson Träff
    Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:98, n:2, pp:347-356 [Journal]
  51. Christoph W. Keßler, Jesper Larsson Träff
    Language and library support for practical PRAM programming. [Citation Graph (0, 0)][DBLP]
    PDP, 1997, pp:216-221 [Conf]
  52. Peter Sanders, Jochen Speck, Jesper Larsson Träff
    Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2007, pp:17-26 [Conf]
  53. Jesper Larsson Träff, William Gropp, Rajeev Thakur
    Self-consistent MPI Performance Requirements. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2007, pp:36-45 [Conf]

  54. HPPC 2007: Workshop on Highly Parallel Processing on a Chip. [Citation Graph (, )][DBLP]


  55. Second Workshop on Highly Parallel Processing on a Chip (HPPC 2008). [Citation Graph (, )][DBLP]


  56. HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? [Citation Graph (, )][DBLP]


  57. HPPC 2009: 3rd Workshop on Highly Parallel Processing on a Chip. [Citation Graph (, )][DBLP]


  58. Multicore and Manycore Programming. [Citation Graph (, )][DBLP]


  59. Investigating High Performance RMA Interfaces for the MPI-3 Standard. [Citation Graph (, )][DBLP]


  60. How to avoid making the same Mistakes all over again: What the parallel-processing community has (failed) to offer the multi/many-core generation. [Citation Graph (, )][DBLP]


  61. Sparse collective operations for MPI. [Citation Graph (, )][DBLP]


  62. A Simple, Pipelined Algorithm for Large, Irregular All-gather Problems. [Citation Graph (, )][DBLP]


  63. Self-consistent MPI-IO Performance Requirements and Expectations. [Citation Graph (, )][DBLP]


  64. Constructing MPI Input-output Datatypes for Efficient Transpacking. [Citation Graph (, )][DBLP]


  65. MPI on a Million Processors. [Citation Graph (, )][DBLP]


  66. Exploiting Efficient Transpacking for One-Sided Communication and MPI-IO. [Citation Graph (, )][DBLP]


  67. User-Land Work Stealing Schedulers: Towards a Standard. [Citation Graph (, )][DBLP]


  68. A test suite for parallel performance analysis tools. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002