Task Debugging with TEMANEJO

  • Steffen Brinkmann
  • José Gracia
  • Christoph Niethammer
Conference paper


In recent years memory layouts have become more and more complex and bandwidth turned out to be the crucial performance parameter. This reflects in new programming paradigms which focus on data flow rather than instruction sequence. A very successful approach is StarSs, where the parallel programme consists of small computing units called tasks and dependencies between these tasks which are defined by the programmer. At runtime a dependency graph is created which determines the parallel or sequential execution of the tasks. When it comes to debugging StarSs applications, traditional debuggers such as gdb don’t provide enough information and control to uncover shortcomings of the program. We present a new type of debugger which acts on the task level giving the user access to the dependency graph. Information is extracted from the running application with the lightweight library Ayudame and the information is passed to the remote client Temanejo which visualises the dependency graph and passes user requests, such as blocking or prioritising a task, to the application.


Dependency Graph Task Graph Memory Address Runtime Environment Node Colour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This work was supported by the European Community’s Seventh Framework Programme [FP7-INFRASTRUCTURES-2010-2] project TEXT under grant agreement number 261580. The authors also acknowledge support by the H4H project funded by the German Federal Ministry for Education and Research (grant number 01IS10036B) within the ITEA2 framework (grant number 09011).


  1. 1.
  2. 2.
  3. 3.
    Augonnet, C., Thibault, S., Namyst, R., Wacrenier, P.-A.: StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures. Concurrency and Computation: Practice and Experience, Special Issue: Euro-Par 2009Google Scholar
  4. 4.
    Gautier, Th., Besseron, X., Pigeon, L.: KAAPI: A Thread Scheduling Runtime System for Data Flow Computations on Cluster of Multi-Processors. Parallel Symbolic Computation’07 (PASCO’07), (15–23), London, Ontario, Canada, 2007.Google Scholar
  5. 5.
    Brinkmann, S., Gracia, J., Niethammer, Chr., Keller, R.: Temanejo – a debugger for task based parallel programming models. ParCo (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Steffen Brinkmann
    • 1
  • José Gracia
    • 1
  • Christoph Niethammer
    • 1
  1. 1.High Performance Computing Center Stuttgart (HLRS)University of StuttgartStuttgartGermany

Personalised recommendations