BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131120T001500Z
DTEND:20131120T020000Z
LOCATION:Mile High Pre-Function
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Nowadays all supercomputers are multicore clusters with one-sided communication support. It is important to explore new programming models for them. Partitioned global address space (PGAS) languages have drawn much attention in recent years. However, there are few application mapping studies.  In this paper, through the Barnes-Hut algorithm, we demonstrate a PGAS + X programing paradigm specifically targeting multicore clusters.  =0A=0AThe novelty is that we integrate intranode multithreading with internode one-sided communication. we decompose computation into tasks and hide network latency by descheduling tasks that are blocked on a remote access and reusing the core to run another, ready to execute task. We spawn multiple threads per process, which do either communication or computation. We show how to manage tasks and do thread synchronization. We are in progress of designing runtime abstractions.=0A =0AWe show details of the design, particularly the task management. We use experiment results to show benefits gained.
SUMMARY:Optimizing the Barnes-Hut Algorithm for Multicore Clusters
PRIORITY:3
END:VEVENT
END:VCALENDAR