Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model

U Bondhugula, M Baskaran, S Krishnamoorthy… - … CC 2008, Held as Part of …, 2008 - Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular
accesses. Affine transformations in this model capture a complex sequence of execution …

Tenet: A framework for modeling tensor dataflow based on relation-centric notation

L Lu, N Guan, Y Wang, L Jia, Z Luo… - 2021 ACM/IEEE 48th …, 2021 - ieeexplore.ieee.org
Accelerating tensor applications on spatial architectures provides high performance and
energy-efficiency, but requires accurate performance models for evaluating various dataflow …

Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs

C Alias, A Darte, P Feautrier, L Gonnord - Static Analysis: 17th International …, 2010 - Springer
Proving the termination of a flowchart program can be done by exhibiting a ranking function,
ie, a function from the program states to a well-founded set, which strictly decreases at each …

[图书][B] Integer points in polyhedra

A Barvinok - 2008 - books.google.com
This is a self-contained exposition of several core aspects of the theory of rational polyhedra
with a view towards algorithmic applications to efficient counting of integer points, a problem …

Hybrid hexagonal/classical tiling for GPUs

T Grosser, A Cohen, J Holewinski… - Proceedings of Annual …, 2014 - dl.acm.org
Time-tiling is necessary for the efficient execution of iterative stencil computations. Classical
hyper-rectangular tiles cannot be used due to the combination of backward and forward …

[图书][B] Algebraic and geometric ideas in the theory of discrete optimization

It is undeniable that geometric ideas have been very important to the foundations of modern
discrete optimization. The influence that geometric algorithms have in optimization was …

Dynamic dataflow graphs

SS Bhattacharyya, EF Deprettere… - Handbook of Signal …, 2013 - Springer
Much of the work to date on dataflow models for signal processing system design has
focused on decidable dataflow models that are best suited for one-dimensional signal …

Advances in symbolic execution

G Yang, A Filieri, M Borges, D Clun, J Wen - Advances in Computers, 2019 - Elsevier
Symbolic execution is a systematic technique for checking programs, which forms a basis for
various software testing and verification techniques. It provides a powerful analysis in …

Automatic memory partitioning and scheduling for throughput and power optimization

J Cong, W Jiang, B Liu, Y Zou - ACM Transactions on Design Automation …, 2011 - dl.acm.org
Memory bottleneck has become a limiting factor in satisfying the explosive demands on
performance and cost in modern embedded system design. Selected computation kernels …

Theory and algorithm for generalized memory partitioning in high-level synthesis

Y Wang, P Li, J Cong - Proceedings of the 2014 ACM/SIGDA …, 2014 - dl.acm.org
The significant development of high-level synthesis tools has greatly facilitated FPGAs as
general computing platforms. During the parallelism optimization for the data path, memory …