BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:I solemnly swear that I am up to... automatic parallelisation - An
 ton Lokhmotov (University of Cambridge)
DTSTART:20070518T144500Z
DTEND:20070518T154500Z
UID:TALK7403@talks.cam.ac.uk
CONTACT:Anton Lokhmotov
DESCRIPTION:Computer systems are increasingly parallel and heterogeneous\,
  while programs are still largely written in sequential languages like C/C
 ++ assuming a single processor connected to uniform memory. The obvious su
 ggestion that the compiler should automatically distribute a sequential pr
 ogram across the system usually fails in practice because the dependence a
 nalysis in the presence of aliasing can be over-pessimistic.\n\nThis talk 
 will explore how the compiler can rely on the programmer's knowledge about
  dependences in the code to enable automatic parallelisation. Practically 
 speaking\, by enclosing a code fragment inside a special block the program
 mer (solemnly) swears to the compiler that the code fragment is free of de
 pendences on all or some memory locations. This essentially creates a trea
 ty-point between what is easy for the programmer to guarantee and what the
  compiler is capable of refactoring.
LOCATION:GS15\, Computer Laboratory
END:VEVENT
END:VCALENDAR