PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language

Bhaskaracharya, Somashekaracharya G and Bondhugula, Uday (2013) PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language. In: 22nd International Conference on Compiler Construction (CC), MAR 16-24, 2013, Rome, ITALY, pp. 123-143.

PDF com_con_cc_7791_123_2013.pdf - Published Version Restricted to Registered users only Download (406kB) | Request a copy

Abstract

Polyhedral techniques for program transformation are now used in several proprietary and open source compilers. However, most of the research on polyhedral compilation has focused on imperative languages such as C, where the computation is specified in terms of statements with zero or more nested loops and other control structures around them. Graphical dataflow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and referential transparency of dataflow languages impose a different set of challenges. In this paper, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from dataflow programs and to synthesize them from their equivalent polyhedral representation. We then describe PolyGLoT, a framework for automatic transformation of dataflow programs which we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used dataflow programming languages. Results show that dataflow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30x while running on an 8-core Intel system.

Item Type:	Conference Proceedings
Series.:	Lecture Notes in Computer Science
Publisher:	SPRINGER-VERLAG BERLIN
Additional Information:	Copy right for this article belongs to the SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	19 Nov 2014 04:34
Last Modified:	19 Nov 2014 04:34
URI:	http://eprints.iisc.ac.in/id/eprint/50319

Actions (login required)

View Item