Parallel schedule synthesis for attribute grammars

Authors:
Leo A. Meyerovich;Matthew E. Torok;Eric Atkinson;Rastislav Bodik
Affiliations:
UC Berkeley, Berkeley, CA, USA;UC Berkeley, Berkeley, CA, USA;UC Berkeley, Berkeley, CA, USA;UC Berkeley, Berkeley, CA, USA
Venue:
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2013

Citing 16
Cited 2

Supernode partitioning

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cilk: an efficient multithreaded runtime system

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Revisiting the Decomposition of Karp, Miller and Winograd

ASAP '95 Proceedings of the IEEE International Conference on Application Specific Array Processors
Generating spreadsheet-like tools from strong attribute grammars

Proceedings of the 2nd international conference on Generative programming and component engineering
Cascading Style Sheets

Cascading Style Sheets
Automatic pool allocation: improving performance by controlling data structure layout in the heap

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Combinatorial sketching for finite programs

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures

Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Intel threading building blocks

Intel threading building blocks
PetaBricks: a language and compiler for algorithmic choice

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Fast and parallel webpage layout

Proceedings of the 19th international conference on World wide web
Data representation synthesis

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Two for the price of one: a model for parallel and incremental computation

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Scalable GPU graph traversal

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
A case for parallelizing web pages

HotPar'12 Proceedings of the 4th USENIX conference on Hot Topics in Parallelism
Elixir: a system for synthesizing concurrent graph programs

Proceedings of the ACM international conference on Object oriented programming systems languages and applications

A hardware evaluation of cache partitioning to improve utilization and energy-efficiency while preserving responsiveness

Proceedings of the 40th Annual International Symposium on Computer Architecture
HPar: A practical parallel parser for HTML--taming HTML complexities for parallel parsing

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine how to synthesize a parallel schedule of structured traversals over trees. In our system, programs are declaratively specified as attribute grammars. Our synthesizer automatically, correctly, and quickly schedules the attribute grammar as a composition of parallel tree traversals. Our downstream compiler optimizes for GPUs and multicore CPUs. We provide support for designing efficient schedules. First, we introduce a declarative language of schedules where programmers may constrain any part of the schedule and the synthesizer will complete and autotune the rest. Furthermore, the synthesizer answers debugging queries about how schedules may be completed. We evaluate our approach with two case studies. First, we created the first parallel schedule for a large fragment of CSS and report a 3X multicore speedup. Second, we created an interactive GPU-accelerated animation of over 100,000 nodes.