Barrier Synchronisation Optimisation

Elena Stöhr, Michael F. P. O'Boyle

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper describes a new compiler algorithm to reduce the number of barrier synchronisations in parallelised programs. A preliminary technique to rapidly determine critical data dependences is developed. This forms the basis of the Fast First Sink (FFS) algorithm which places, provably, the minimal number of barriers in polynomial time for codes with a regular structure. This algorithm is implemented in a prototype compiler and applied to three well known benchmarks. Preliminary results show that it outperforms an existing state-of the-art commercial compiler.
Original languageEnglish
Title of host publicationHigh-Performance Computing and Networking
Subtitle of host publicationInternational Conference and Exhibition Vienna, Austria, April 28–30, 1997 Proceedings
PublisherSpringer Berlin Heidelberg
Pages791-800
Number of pages10
ISBN (Electronic)978-3-540-69041-2
ISBN (Print)978-3-540-62898-9
DOIs
Publication statusPublished - Jun 1997

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume1225
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Barrier Synchronisation Optimisation'. Together they form a unique fingerprint.

Cite this