According to our database1, Jens Gustedt authored at least 59 papers between 1991 and 2017.
Collaborative distances :
Collaborative distances :
Legend:Book In proceedings Article PhD thesis Other
Automatic, Abstracted and Portable Topology-Aware Thread Placement.
Proceedings of the 2017 IEEE International Conference on Cluster Computing, 2017
Futex based locks for C11's generic atomics.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016
Automatic Code Generation for Iterative Multi-dimensional Stencil Computations.
Proceedings of the 23rd IEEE International Conference on High Performance Computing, 2016
Resource-Centered Distributed Processing of Large Histopathology Images.
Proceedings of the 2016 IEEE Intl Conference on Computational Science and Engineering, 2016
Optimizing Locality by Topology-Aware Placement for a Task Based Programming Model.
Proceedings of the 2016 IEEE International Conference on Cluster Computing, 2016
Towards Complete Tracking of Provenance in Experimental Distributed Systems Research.
Proceedings of the Euro-Par 2015: Parallel Processing Workshops, 2015
EPISCIENCES - An overlay publication platform.
Inf. Services and Use, 2014
Resource Centered Computing Delivering High Parallel Performance.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014
EPISCIENCES - an overlay publication platform.
Proceedings of the Let's Put Data to Use: Digital Scholarship for the Next Generation, 2014
A Workflow-Inspired, Modular and Robust Approach to Experiments in Distributed Systems.
Proceedings of the 14th IEEE/ACM International Symposium on Cluster, 2014
A Dynamic Distributed Algorithm for Read Write Locks.
Proceedings of the 20th Euromicro International Conference on Parallel, 2012
Methods for Emulation of Multi-core CPU Performance.
Proceedings of the 13th IEEE International Conference on High Performance Computing & Communication, 2011
Modeling and Experimental Validation of the Data Handover API.
Proceedings of the Advances in Grid and Pervasive Computing - 6th International Conference, 2011
Relaxed Synchronization with Ordered Read-Write Locks.
Proceedings of the Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2011
Defining and controlling the heterogeneity of a cluster: The Wrekavoc tool.
Journal of Systems and Software, 2010
Iterative computations with ordered read-write locks.
J. Parallel Distrib. Comput., 2010
Experimenting Iterative Computations with Ordered Read-Write Locks.
Proceedings of the 18th Euromicro Conference on Parallel, 2010
InterCell: A Software Suite for Rapid Prototyping and Parallel Execution of Fine Grained Applications.
Proceedings of the Applied Parallel and Scientific Computing, 2010
Accurate Emulation of CPU Performance.
Proceedings of the Euro-Par 2010 Parallel Processing Workshops, 2010
Experimental Methodologies for Large-Scale Systems: a Survey.
Parallel Processing Letters, 2009
Validating Wrekavoc: A tool for heterogeneity emulation.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient.
Proceedings of the Complex Networks, 2009
Efficient sampling of random permutations.
J. Discrete Algorithms, 2008
Engineering Parallel In-Place Random Generation of Integer Permutations.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008
Out-of-Core Wavefront Computations with Reduced Synchronization.
Proceedings of the 16th Euromicro International Conference on Parallel, 2008
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms.
Nord. J. Comput., 2006
Bounded Arboricity to Determine the Local Structure of Sparse Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
An Experimental Validation of the PRO Model for Parallel and Distributed Computation.
Proceedings of the 14th Euromicro International Conference on Parallel, 2006
The parXXL Environment: Scalable Fine Grained Development for Large Coarse Grained Platforms.
Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing, 2006
Data Handover: Reconciling Message Passing and Shared Memory.
Proceedings of the Foundations of Global Computing, 20.-25. February 2005, 2005
Weak-order extensions of an order.
Theor. Comput. Sci., 2003
Graph coloring on coarse grained multicomputers.
Discrete Applied Mathematics, 2003
Randomized permutations in a coarse grained parallel environment.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003
Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm.
Proceedings of the Computational Science and Its Applications, 2003
Portable List Ranking: An Experimental Study.
ACM Journal of Experimental Algorithmics, 2002
Partially Complemented Representations of Digraphs.
Discrete Mathematics & Theoretical Computer Science, 2002
SSCRAP: An Environment for Coarse Grained Algorithms.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002
PRO: A Model for Parallel Resource-Optimal Computation.
Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002
The Treewidth of Java Programs.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002
Efficient and Practical Algorithms for Sequential Modular Decomposition.
J. Algorithms, 2001
Graph Coloring on a Coarse Grained Multiprocessor.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000
Portable List Ranking: An Experimental Study.
Proceedings of the Algorithm Engineering, 2000
Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2000
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes.
Theor. Comput. Sci., 1998
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel.
Proceedings of the STACS 98, 1998
Linear-Time Register Allocation for a Fixed Number of Registers.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
Weak-Order Extensions of an Order.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997
Memory Management for Union-Find Algorithms.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
Efficient and Practical Modular Decomposition.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Two Linear Time Union-Find Strategies for Image Processing.
Theor. Comput. Sci., 1996
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996
Well Quasi Ordering Finite Posets and Formal Languages.
J. Comb. Theory, Ser. B, 1995
A Compact Data Structure and Parallel Algorithms for Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
Constructing Colorings for Diagrams.
Discrete Applied Mathematics, 1994
Testing Hereditary Properties Efficiently on Average.
Proceedings of the Orders, 1994
On the Pathwidth of Chordal Graphs.
Discrete Applied Mathematics, 1993
Algorithmic Aspects of Ordered Structures.
PhD thesis, 1992
Well-quasi-ordering finite posets.
Proceedings of the Graph Structure Theory, 1991