BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20151117T173000Z
DTEND:20151117T180000Z
LOCATION:19AB
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: This paper proposes and evaluates Sharing/Timing Adaptive Push (STAP), a dynamic scheme for preemptively sending data from producers to consumers to minimize critical-path communication latency. STAP uses small hardware buffers to dynamically detect sharing patterns and timing requirements. The scheme applies to both intra-node and inter-socket directory-based shared memory networks. We integrate STAP into a MOESI cache-coherence (prefetching-enabled) protocol using heuristics to detect different data sharing patterns, including broadcasts, producer/consumer, and migratory-data sharing. Using 15 benchmarks from the PARSEC and SPLASH-2 suites we show that our scheme significantly reduces communication=0Alatency in NUMA systems and achieves an average of 9% performance improvement, with at most 3% on-chip storage overhead.
SUMMARY:Automatic Sharing Classification and Timely Push for Cache-Coherent Systems
PRIORITY:3
END:VEVENT
END:VCALENDAR