BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Using Processor Hardware Counters in Picking the Optimal Work-Stea
 ling Policy - Milos Puzovic\, University of Cambridge
DTSTART:20110624T150000Z
DTEND:20110624T160000Z
UID:TALK31954@talks.cam.ac.uk
CONTACT:Prof Simon Moore
DESCRIPTION:Randomised work-stealing is a distributed dynamic load balanci
 ng scheme\nthat has been proven to be optimal with tight space bounds for 
 a large\nnumber of recursive task-parallel programs. Under work-stealing w
 hen a\nparent thread spawns a child\, worker will make parent thread avail
 able\nto idle workers to steal it. However\, if parallelism manifested in\
 nprogram is iterative then the steals from idle workers will be serialised
 \nand therefore had a negative impact on scalability of the\nscheduler. In
  this case we would have been much better off if we chose\nto continue exe
 cuting the parent thread and make a child thread available\nfor stealing.\
 n\nIn this talk I will introduce tools I have developed to characterise di
 fferent\ntypes of task-parallel benchmarks and present the insights how to
 \nexploit now ubiquitous hardware counters to dynamically pick and switch\
 nbetween the optimal policies during the program's lifetime.\n
LOCATION:FW26\, Computer Laboratory
END:VEVENT
END:VCALENDAR