BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY: Concise analysis using implication algebras for task-local memory
  optimisation - Leo White 
DTSTART:20130611T120000Z
DTEND:20130611T130000Z
UID:TALK45547@talks.cam.ac.uk
CONTACT:Raoul-Gabriel Urma
DESCRIPTION:OpenMP is a pragma-based extension to C to support parallelism
 . The\n OpenMP standard recently added support for task-based parallelism 
 but in a richer way than languages such as Cilk. Naive\n implementations g
 ive each task its own stack for task-local memory\,\n which is very ineffi
 cient.\n\nWe detail a program analysis for OpenMP to enable tasks to share
 \n stacks without synchronisation---either unconditionally or dependent\n 
 on some cheap run-time condition which is very likely to hold in busy\n sy
 stems.\n\nThe analysis is based on a novel implication-algebra generalisat
 ion of\n logic programming which allows concise but easily readable encodi
 ngs\n of the various constraints. The formalism enables us to show that th
 e\n analysis has a unique solution and polynomial-time complexity.\n\nWe c
 onclude with performance figures.
LOCATION:FW22\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR