Dependence flow graphs: an algebraic approach to program dependencies

Pingali, Keshav; Beck, Micah; Johnson, Roger D.; Moudgill, Mayan; Stodghill, Paul

doi:10.1145/99583.99595

Cited by 67 publications

(23 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, to make our approach effective, we have also designed the E-PEG representation. There has been a long line of work on developing IRs that make analysis and optimizations easier to perform [19,5,51,31,24,58,16,48,44]. The key distinguishing feature of E-PEGs is that a single E-PEG can represent many optimized versions of the input program, which allows us to use global profitability heuristics and to perform translation validation.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Equality Saturation: A New Approach to Optimization

Tate¹,

Stepp²,

Tatlock³

et al. 2011

Logical Methods in Computer Science

131

View full text Add to dashboard Cite

Abstract. Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for structuring the optimization phase of a compiler. In our approach, optimizations take the form of equality analyses that add equality information to a common intermediate representation. The optimizer works by repeatedly applying these analyses to infer equivalences between program fragments, thus saturating the intermediate representation with equalities. Once saturated, the intermediate representation encodes multiple optimized versions of the input program. At this point, a profitability heuristic picks the final optimized program from the various programs represented in the saturated representation. Our proposed way of structuring optimizers has a variety of benefits over previous approaches: our approach obviates the need to worry about optimization ordering, enables the use of a global optimization heuristic that selects among fully optimized programs, and can be used to perform translation validation, even on compilers other than our own. We present our approach, formalize it, and describe our choice of intermediate representation. We also present experimental results showing that our approach is practical in terms of time and space overhead, is effective at discovering intricate optimization opportunities, and is effective at performing translation validation for a realistic optimizer.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Dependence Flow Graphs [44] (DFGs) are a complete and executable representation of programs based on dependencies. However, DFGs employ a side-effecting storage model with an imperative store operation, whereas our representation is entirely functional, making equational reasoning more natural.…”

Section: Related Workmentioning

confidence: 99%

Equality Saturation: A New Approach to Optimization

Tate¹,

Stepp²,

Tatlock³

et al. 2011

Logical Methods in Computer Science

131

View full text Add to dashboard Cite

show abstract

“…[5,21]). In this work the static parallel structure of a computation is captured using a static task graph, or STG [1] (Fig.…”

Section: Analytical Performance Model Of Mcnpmentioning

confidence: 99%

A performance model of non-deterministic particle transport on large-scale systems

Mathis

Kerbyson

Hoisie

2006

Future Generation Computer Systems

View full text Add to dashboard Cite

“…Elimination of redundant dependences results in lesser synchronization at runtime; this has been addressed in [33], and is orthogonal to the focus of this paper. The concept of using tokens to explicitly represent memory-ordering dependences was first proposed in the context of compilers [34] for static program analysis. To our knowledge, we are the first to synthesize these into runtime constructs.…”

Section: Dependence Representationmentioning

confidence: 99%

Hardware compilation of application-specific memory-access interconnect

Venkataramani

Bjerregaard

Chelcea

et al. 2006

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Abstract-A major obstacle to successful high-level synthesis (HLS) of large-scale application-specified integrated circuit systems is the presence of memory accesses to a shared-memory subsystem. The latency to access memory is often not statically predictable, which creates problems for scheduling operations dependent on memory reads. More fundamental is that dependences between accesses may not be statically provable (e.g., if the specification language permits pointers), which introduces memory-consistency problems. Addressing these issues with static scheduling results in overly conservative circuits, and thus, most state-of-the-art HLS tools limit memory systems to those that have predictable latencies and limit programmers to specifications that forbid arbitrary memory-reference patterns. A new HLS framework for the synthesis and optimization of memory accesses (SOMA) is presented. SOMA enables specifications to include arbitrary memory references (e.g., pointers) and allows the memory system to incorporate features that might cause the latency of a memory access to vary dynamically. This results in raising the level of abstraction in the input specification, enabling faster design times. SOMA synthesizes a memory access network (MAN) architecture that facilitates dynamic scheduling and ordering of memory accesses. The paper describes a basic MAN construction technique that illustrates how dynamic ordering helps in efficiently maintaining memory consistency and how dynamic scheduling helps alleviate the variable-latency problem. Then, it is shown how static analysis of the access patterns can be used to optimize the MAN. One optimization changes the MAN interconnect topology to increase concurrence. A second optimization reduces the synchronization overhead necessary to maintain memory consistency. Postlayout experiments demonstrate that SOMA's application-specific MAN construction significantly improves power and performance for a range of benchmarks.Index Terms-Communication synthesis, dataflow synthesis, high-level synthesis (HLS), interface design.

show abstract

Dependence flow graphs: an algebraic approach to program dependencies

Abstract: The topic of intermediate languages and parallelizing compilers has received for optimizing much attention lately.

Cited by 67 publications

References 17 publications

Equality Saturation: A New Approach to Optimization

Equality Saturation: A New Approach to Optimization

A performance model of non-deterministic particle transport on large-scale systems

Hardware compilation of application-specific memory-access interconnect

Contact Info

Product

Resources

About