Corpus ID: 12772044

A Proof of Concept for Optimizing Task Parallelism by Locality Queues

@article{Wittmann2009APO,
  title={A Proof of Concept for Optimizing Task Parallelism by Locality Queues},
  author={Markus Wittmann and Georg Hager},
  journal={ArXiv},
  year={2009},
  volume={abs/0902.1884}
}
  • Markus Wittmann, Georg Hager
  • Published 2009
  • Computer Science
  • ArXiv
  • Task parallelism as employed by the OpenMP task construct, although ideal for tackling irregular problems or typical producer/consumer schemes, bears some potential for performance bottlenecks if locality of data access is important, which is typically the case for memory-bound code on ccNUMA systems. We present a programming technique which ameliorates adverse effects of dynamic task distribution by sorting tasks into locality queues, each of which is preferably processed by threads that… CONTINUE READING