On the public citation graph
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
0 signed · 526 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00925828openalex-snapshot
The ALPHA language and its use for the design of systolic arrays
inferredcites →https://doi.org/10.1007/bf01407931openalex-snapshot
Dataflow analysis of array and scalar references
inferredcites →https://doi.org/10.1007/bf02477176openalex-snapshot
The mapping of linear recurrence equations on regular arrays
inferredcites →https://doi.org/10.1016/0167-8191(90)90055-eopenalex-snapshot
Optimal code parallelization using unimodular transformations
inferredcites →https://doi.org/10.1016/0167-8191(90)90105-iopenalex-snapshot
Synthesizing systolic arrays from recurrence equations
inferredcites →https://doi.org/10.1016/0167-8191(94)90001-9openalex-snapshot
Mapping uniform loop nests onto distributed memory architectures
inferredcites →https://doi.org/10.1016/0304-3975(93)90326-oopenalex-snapshot
Computability of recurrence equations
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/12.88484openalex-snapshot
Run-time parallelization and scheduling of loops
inferredcites →https://doi.org/10.1109/12.90251openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1142/s0129626491000021openalex-snapshot
LINEAR SCHEDULING IS NEARLY OPTIMAL
inferredcites →https://doi.org/10.1145/109025.109108openalex-snapshot
Uniform techniques for loop optimization
inferredcites →https://doi.org/10.1145/109625.109630openalex-snapshot
A unified framework for systematic loop transformations
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/1468075.1468134openalex-snapshot
A language design for concurrent processes
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
inferredcites →https://doi.org/10.1145/512644.512656openalex-snapshot
A parallel language and its compilation to multiprocessor machines or VLSI
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6602openalex-snapshot
Performance modeling of graphics processing unit application using static and dynamic analysis
inferred← citeshttps://doi.org/10.1002/cpe.772openalex-snapshot
Space–time mapping and tiling: a helpful combination
inferred← citeshttps://doi.org/10.1002/cpe.780openalex-snapshot
On the optimality of Feautrier's scheduling algorithm
inferred← citeshttps://doi.org/10.1007/0-306-48706-3_13openalex-snapshot
Application-Domain-Driven System Design for Pervasive Video Processing
inferred← citeshttps://doi.org/10.1007/0-387-28487-7_5openalex-snapshot
Back-Propagation Algorithm Achieving 5 Gops on the Virtex-E
inferred← citeshttps://doi.org/10.1007/11556930_10openalex-snapshot
Systematic Preprocessing of Data Dependent Constructs for Embedded Systems
inferred← citeshttps://doi.org/10.1007/11596110_2openalex-snapshot
Forward Communication Only Placements and Their Use for Parallel Program Construction
inferred← citeshttps://doi.org/10.1007/11688839_16openalex-snapshot
Polyhedral Code Generation in the Real World
inferred← citeshttps://doi.org/10.1007/3-540-31662-0_42openalex-snapshot
Multiobjective 0/1 Knapsack Problem using Adaptive ε-Dominance
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_23openalex-snapshot
Improving Data Locality by Chunking
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_52openalex-snapshot
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
inferred← citeshttps://doi.org/10.1007/3-540-44842-x_93openalex-snapshot
Finding Coarse Grained Parallelism in Computational Geometry Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_100openalex-snapshot
Finding Synchronization-Free Parallelism for Non-uniform Loops
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_14openalex-snapshot
Application of the Polytope Model to Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_10openalex-snapshot
Communication-Free Partitioning of Nested Loops
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_5openalex-snapshot
Loop Parallelization Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45492-6_33openalex-snapshot
High Level Software Synthesis of Affine Iterative Algorithms onto Parallel Architectures
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_57openalex-snapshot
A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_39openalex-snapshot
On the Optimality of Feautrier’s Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_14openalex-snapshot
Complexity of Multi-dimensional Loop Alignment
inferred← citeshttps://doi.org/10.1007/3-540-45874-3_7openalex-snapshot
Structured Scheduling of Recurrence Equations: Theory and Practice
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_39openalex-snapshot
A Technique for Parallel Loop Execution
inferred← citeshttps://doi.org/10.1007/3-540-48228-8_28openalex-snapshot
Source Code and Task Graphs in Program Optimization
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_49openalex-snapshot
Storage Mapping Optimization for Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_53openalex-snapshot
Scheduling Structured Systems
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_10openalex-snapshot
Two-Dimensional Scheduling of Algorithms with Uniform Dependencies
inferred← citeshttps://doi.org/10.1007/3-540-57981-8_159openalex-snapshot
Parallelizing compilers: what can be achieved?
inferred← citeshttps://doi.org/10.1007/3-540-58430-7_60openalex-snapshot
Optimizing communications by using compile time analysis
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_95openalex-snapshot
Some applications of combinatorial optimization in parallel computing
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_50openalex-snapshot
On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_56openalex-snapshot
Applications of Fuzzy Array Dataflow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_64openalex-snapshot
Classifying loops for space-time mapping
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_44openalex-snapshot
Automatic parallelization in the polytope model
inferred← citeshttps://doi.org/10.1007/3-540-62598-4_136openalex-snapshot
The V-Ray technology of optimizing programs to parallel computers
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_206openalex-snapshot
Locality of Reference and Parallel Processing
inferred← citeshttps://doi.org/10.1007/978-1-4020-8588-8_12openalex-snapshot
High-Level Synthesis of Loops Using the Polyhedral Model
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_8openalex-snapshot
Mathematical Tools for Loop Transformations: From Systems of Uniform Recurrence Equations to the Polytope Model
inferred← citeshttps://doi.org/10.1007/978-3-030-03314-9_11openalex-snapshot
Transitive Closure Based Schedule of Loop Nest Statement Instances
inferred← citeshttps://doi.org/10.1007/978-3-030-17872-7_5openalex-snapshot
Polyhedral Optimization of TensorFlow Computation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_22openalex-snapshot
Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_27openalex-snapshot
Synthesizing Nested Ranking Functions for Loop Programs via SVM
inferred← citeshttps://doi.org/10.1007/978-3-030-38991-8_8openalex-snapshot
Accelerating Lattice Boltzmann Method by Fully Exposing Vectorizable Loops
inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_32openalex-snapshot
Fkcc: The Farkas Calculator
inferred← citeshttps://doi.org/10.1007/978-3-030-72789-5_8openalex-snapshot
Abstractions for Polyhedral Topology-Aware Tasking [Position Paper]
inferred← citeshttps://doi.org/10.1007/978-3-030-86359-3_20openalex-snapshot
Automatic Parallel Tiled Code Generation Based on Dependence Approximation
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_8openalex-snapshot
Maximum Flows in Parametric Graph Templates
inferred← citeshttps://doi.org/10.1007/978-3-031-31445-2_4openalex-snapshot
Employing Polyhedral Methods to Reduce Data Movement in FPGA Stencil Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-38864-4_15openalex-snapshot
Implementation of an Asymptotically Compact Algorithm for GPU Simulation of an Acoustic Equation
inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_17openalex-snapshot
Verified Validation for Affine Scheduling in Polyhedral Compilation
inferred← citeshttps://doi.org/10.1007/978-3-031-75380-0_16openalex-snapshot
SyDPaCC: A Framework for the Development of Verified Scalable Parallel Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-22051-6_25openalex-snapshot
A New Lattice-Based Scheme for the Numerical Simulation of Electromagnetic Phenomena
inferred← citeshttps://doi.org/10.1007/978-3-032-23604-3_3openalex-snapshot
EvoTADASHI: Genetic Programming for High-Performance Code Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-07173-2_12openalex-snapshot
Usage of the TRACO Compiler for Neural Network Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_8openalex-snapshot
Parametric GPU Code Generation for Affine Loop Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-17473-0_11openalex-snapshot
Jagged Tiling for Intra-tile Parallelism and Fine-Grain Multithreading
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_18openalex-snapshot
Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-23389-5_2openalex-snapshot
Many-Core Architecture for NTC: Energy Efficiency from the Ground Up
inferred← citeshttps://doi.org/10.1007/978-3-319-26408-0_8openalex-snapshot
Source-to-Source Optimization for HLS
inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_17openalex-snapshot
Code Bones: Fast and Flexible Code Generation for Dynamic and Speculative Polyhedral Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-48429-7_28openalex-snapshot
Loop Nest Tiling for Image Processing and Communication Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-48429-7_29openalex-snapshot
Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_32openalex-snapshot
On Multiphase-Linear Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-67295-3_2openalex-snapshot
Can Parallel Programming Revolutionize EDA Tools?
inferred← citeshttps://doi.org/10.1007/978-3-540-25935-0_5openalex-snapshot
Program Optimization in the Domain of High-Performance Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-27776-7_45openalex-snapshot
Scalable and Modular Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_36openalex-snapshot
More Legal Transformations for Locality
inferred← citeshttps://doi.org/10.1007/978-3-540-45145-7_1openalex-snapshot
Mapping Affine Loop Nests: Solving of the Alignment and Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_44openalex-snapshot
Finding Free Schedules for Non-uniform Loops
inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_20openalex-snapshot
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_69openalex-snapshot
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops
inferred← citeshttps://doi.org/10.1007/978-3-540-72521-3_11openalex-snapshot
On Control Signals for Multi-Dimensional Time
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_9openalex-snapshot
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
inferred← citeshttps://doi.org/10.1007/978-3-540-92990-1_8openalex-snapshot
Software Pipelining in Nested Loops with Prolog-Epilog Merging
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_14openalex-snapshot
Automatic C-to-CUDA Code Generation for Affine Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_16openalex-snapshot
The Polyhedral Model Is More Widely Applicable Than You Think
inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_16openalex-snapshot
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_8openalex-snapshot
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-21487-5_4openalex-snapshot
ompVerify: Polyhedral Analysis for the OpenMP Programmer
inferred← citeshttps://doi.org/10.1007/978-3-642-29350-4_48openalex-snapshot
Automatic Privatization for Parallel Execution of Loops
inferred← citeshttps://doi.org/10.1007/978-3-642-30397-5_7openalex-snapshot
Using Free Scheduling for Programming Graphic Cards
inferred← citeshttps://doi.org/10.1007/978-3-642-35887-6_12openalex-snapshot
The ParaPhrase Project: Parallel Patterns for Adaptive Heterogeneous Multicore Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-35893-7_7openalex-snapshot
Impact of Variable Privatization on Extracting Synchronization-Free Slices for Multi-core Computers
inferred← citeshttps://doi.org/10.1007/978-3-642-37051-9_7openalex-snapshot
PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language
inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_5openalex-snapshot
Set and Relation Manipulation for the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_15openalex-snapshot
On the Linear Ranking Problem for Simple Floating-Point Loops
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_19openalex-snapshot
Loopy: Programmable and Formally Verified Loop Transformations
inferred← citeshttps://doi.org/10.1007/978-94-011-5514-4_15openalex-snapshot
Automatic Coarse-Grained Parallelization Techniques
inferred← citeshttps://doi.org/10.1007/978-981-16-1483-5_9openalex-snapshot
Automatic Parallelization of Affine Programs for Distributed Memory Systems
inferred← citeshttps://doi.org/10.1007/bf00924526openalex-snapshot
Linear mappings ofn-dimensional uniform recurrences ontok-dimensional systolic arrays
inferred← citeshttps://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferred← citeshttps://doi.org/10.1007/bf02577769openalex-snapshot
Using affine closure to find legal reordering transformations
inferred← citeshttps://doi.org/10.1007/bf02577771openalex-snapshot
Minimal data dependence abstractions for loop transformations: Extended version
inferred← citeshttps://doi.org/10.1007/bf02577789openalex-snapshot
Automatic parallelization ofwhile-loops using speculative execution
inferred← citeshttps://doi.org/10.1007/bfb0002713openalex-snapshot
Basis of parallel speculative execution
inferred← citeshttps://doi.org/10.1007/bfb0017283openalex-snapshot
The loop parallelizer LooPo—announcement
inferred← citeshttps://doi.org/10.1007/bfb0020477openalex-snapshot
An array partitioning analysis for parallel loop distribution
inferred← citeshttps://doi.org/10.1007/bfb0024742openalex-snapshot
An asymptotically optimal affine schedule on bounded convex polyhedric domains
inferred← citeshttps://doi.org/10.1007/bfb0025867openalex-snapshot
Fine-grain scheduling under resource constraints
inferred← citeshttps://doi.org/10.1007/bfb0025873openalex-snapshot
Communication-free parallelization via affine transformations
inferred← citeshttps://doi.org/10.1007/bfb0025874openalex-snapshot
Finding legal reordering transformations using mappings
inferred← citeshttps://doi.org/10.1007/bfb0025880openalex-snapshot
Minimal data dependence abstractions for loop transformations
inferred← citeshttps://doi.org/10.1007/bfb0027118openalex-snapshot
Automatic synthesis of parallel algorithms
inferred← citeshttps://doi.org/10.1007/bfb0032680openalex-snapshot
Quantifying the multi-level nature of tiling interactions
inferred← citeshttps://doi.org/10.1007/bfb0057883openalex-snapshot
Workshop 04 automatic parallelization and high-performance compilers
inferred← citeshttps://doi.org/10.1007/bfb0094913openalex-snapshot
Parallelization via constrained storage mapping optimization
inferred← citeshttps://doi.org/10.1007/bfb0100626openalex-snapshot
The Nestor library: A tool for implementing fortran source to source transfromations
inferred← citeshttps://doi.org/10.1007/s00607-017-0576-3openalex-snapshot
Generation of parallel synchronization-free tiled code
inferred← citeshttps://doi.org/10.1007/s10009-019-00549-9openalex-snapshot
On ranking functions for single-path linear-constraint loops
inferred← citeshttps://doi.org/10.1007/s10559-012-9382-2openalex-snapshot
Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
inferred← citeshttps://doi.org/10.1007/s10766-004-1460-2openalex-snapshot
Automatic Array Partitioning Based on the Smith Normal Form
inferred← citeshttps://doi.org/10.1007/s10766-006-0011-4openalex-snapshot
Scalable and Structured Scheduling
inferred← citeshttps://doi.org/10.1007/s10766-006-0012-3openalex-snapshot
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
inferred← citeshttps://doi.org/10.1007/s10766-013-0241-1openalex-snapshot
Predictive Modeling in a Polyhedral Optimization Space
inferred← citeshttps://doi.org/10.1007/s10766-016-0477-7openalex-snapshot
Maximizing Communication–Computation Overlap Through Automatic Parallelization and Run-time Tuning of Non-blocking Collective Operations
inferred← citeshttps://doi.org/10.1007/s10766-020-00660-4openalex-snapshot
Pure Functions in C: A Small Keyword for Automatic Parallelization
inferred← citeshttps://doi.org/10.1007/s10766-021-00694-2openalex-snapshot
Monoparametric Tiling of Polyhedral Programs
inferred← citeshttps://doi.org/10.1007/s11227-017-2187-3openalex-snapshot
K-DT: a formal system for the evaluation of linear data dependence testing techniques
inferred← citeshttps://doi.org/10.1007/s11227-018-2461-zopenalex-snapshot
The DiamondCandy LRnLA algorithm: raising efficiency of the 3D cross-stencil schemes
inferred← citeshttps://doi.org/10.1007/s11227-018-2678-xopenalex-snapshot
Insight into tiles generated by means of a correction technique
inferred← citeshttps://doi.org/10.1007/s11265-008-0262-yopenalex-snapshot
Hardware Acceleration of HMMER on FPGAs
inferred← citeshttps://doi.org/10.1016/0165-6074(95)00025-jopenalex-snapshot
Compiling for massively parallel architectures: a perspective
inferred← citeshttps://doi.org/10.1016/0167-9260(95)00018-6openalex-snapshot
Communication code generation in systems of affine recurrence equations
inferred← citeshttps://doi.org/10.1016/b978-0-444-81784-6.50066-xopenalex-snapshot
Using Compile-Time Conditional Analysis to Improve the Performance of Compiler Parallelized Programs
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50023-5openalex-snapshot
Compiling for Massively Parallel Architectures
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50029-6openalex-snapshot
On Factors Limiting the Generation of Efficient Compiler-Parallelized Programs
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50030-2openalex-snapshot
From Dependence Analysis to Communication Code Generation
inferred← citeshttps://doi.org/10.1016/j.cl.2018.05.003openalex-snapshot
Coding Ants: Optimization of GPU code using ant colony optimization
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.09.012openalex-snapshot
Quantifier elimination in automatic loop parallelization
inferred← citeshttps://doi.org/10.1016/j.parco.2010.12.005openalex-snapshot
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations
inferred← citeshttps://doi.org/10.1016/j.parco.2012.06.001openalex-snapshot
Free scheduling for statement instances of parameterized arbitrarily nested affine loops
inferred← citeshttps://doi.org/10.1016/j.parco.2016.02.004openalex-snapshot
An approach for code generation in the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1016/j.procs.2010.04.232openalex-snapshot
FADAlib: an open source C++ library for fuzzy array dataflow analysis
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.115openalex-snapshot
Optimizing Dynamic Resource Allocation
inferred← citeshttps://doi.org/10.1016/j.scico.2005.10.013openalex-snapshot
In search of a program generator to implement generic transformations for high-performance computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.001openalex-snapshot
Incremental Closure for Systems of Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.002openalex-snapshot
Synthesizing ranking functions for loop programs via SVM
inferred← citeshttps://doi.org/10.1016/s0010-4655(01)00232-6openalex-snapshot
On loop transformations of nested loops with affine dependencies
inferred← citeshttps://doi.org/10.1016/s0129-6264(00)00018-4openalex-snapshot
Memory Cost Due to Anticipated Broadcast
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00063-4openalex-snapshot
Unimodular transformations of non-perfectly nested loops
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00020-9openalex-snapshot
Loop parallelization algorithms: From parallelism extraction to code generation
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00021-0openalex-snapshot
Maximizing parallelism and minimizing synchronization with affine partitions
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00063-0openalex-snapshot
Termination detection in parallel loop nests with while loops
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00209-0openalex-snapshot
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
inferred← citeshttps://doi.org/10.1023/a:1007554627716openalex-snapshot
Generation of Efficient Nested Loops from Polyhedra
inferred← citeshttps://doi.org/10.1023/a:1007559710855openalex-snapshot
Communication Optimization for Affine Recurrence Equations Using Broadcast and Locality
inferred← citeshttps://doi.org/10.1023/a:1007944932429openalex-snapshot
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP
inferred← citeshttps://doi.org/10.1023/a:1007963228049openalex-snapshot
Finding Space-Time Transformations for Uniform Recurrences via Branching Parametric Linear Programming
inferred← citeshttps://doi.org/10.1023/a:1008008231304openalex-snapshot
On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming
inferred← citeshttps://doi.org/10.1023/a:1008074021139openalex-snapshot
Automatic Generation of Modular Time-Space Mappings and Data Alignments
inferred← citeshttps://doi.org/10.1023/a:1008139706909openalex-snapshot
Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1023/a:1010966620131openalex-snapshot
A Method for Parallelizing Algorithms by Vector Scheduling Functions
inferred← citeshttps://doi.org/10.1023/a:1011136427062openalex-snapshot
Design of Processor Arrays for Reconfigurable Architectures
inferred← citeshttps://doi.org/10.1023/a:1012293814832openalex-snapshot
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests
inferred← citeshttps://doi.org/10.1023/a:1018782528453openalex-snapshot
Quantifying the Multi-Level Nature of Tiling Interactions
inferred← citeshttps://doi.org/10.1023/a:1025117523902openalex-snapshot
Parameterized Polyhedra and Their Vertices
inferred← citeshttps://doi.org/10.1023/a:1025168022993openalex-snapshot
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
inferred← citeshttps://doi.org/10.1080/01495739708941417openalex-snapshot
ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
inferred← citeshttps://doi.org/10.1080/07408179808966433openalex-snapshot
A formalism to structure and parallelize the integration of cooperative engineering design tasks
inferred← citeshttps://doi.org/10.1080/1063719042000208854openalex-snapshot
Tools for Regularizing Array Designs
inferred← citeshttps://doi.org/10.1080/17445760.2017.1296147openalex-snapshot
Supernode transformation on GPGPUs
inferred← citeshttps://doi.org/10.1093/nsr/nwv085openalex-snapshot
Extreme-scale computer architecture
inferred← citeshttps://doi.org/10.1109/12.508321openalex-snapshot
On uniformization of affine dependence algorithms
inferred← citeshttps://doi.org/10.1109/32.842951openalex-snapshot
Automatic mapping of system of N-dimensional affine recurrence equations (SARE) onto distributed memory parallel systems
inferred← citeshttps://doi.org/10.1109/43.748156openalex-snapshot
Processor array design with FPGA area constraint
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370936openalex-snapshot
An Exact Resource Constrained-Scheduler using Graph Coloring technique
inferred← citeshttps://doi.org/10.1109/asap.1995.522903openalex-snapshot
Data alignments for modular time-space mappings of BLAS-like algorithms
inferred← citeshttps://doi.org/10.1109/asap.1997.606840openalex-snapshot
Automatic data mapping of signal processing applications
inferred← citeshttps://doi.org/10.1109/asap.2003.1212826openalex-snapshot
Multi-dimensional incremental loop fusion for data locality
inferred← citeshttps://doi.org/10.1109/asap.2003.1212828openalex-snapshot
Hardware synthesis for multi-dimensional time
inferred← citeshttps://doi.org/10.1109/asap.2007.4429951openalex-snapshot
Parallelizing HMMER for Hardware Acceleration on FPGAs
inferred← citeshttps://doi.org/10.1109/asap.2010.5540753openalex-snapshot
Design of throughput-optimized arrays from recurrence abstractions
inferred← citeshttps://doi.org/10.1109/cgo.2006.13openalex-snapshot
Data and Computation Transformations for Brook Streaming Applications on Multiprocessors
inferred← citeshttps://doi.org/10.1109/cgo.2007.21openalex-snapshot
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
inferred← citeshttps://doi.org/10.1109/cgo.2015.7054196openalex-snapshot
Locality aware concurrent start for stencil applications
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741260openalex-snapshot
Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444791openalex-snapshot
PolyTOPS: Reconfigurable and Flexible Polyhedral Scheduler
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395211openalex-snapshot
PolyUFC: Polyhedral Compilation Meets Roofline Analysis for Uncore Frequency Capping
inferred← citeshttps://doi.org/10.1109/cluster.2017.32openalex-snapshot
Pure Functions in C: A Small Keyword for Automatic Parallelization
inferred← citeshttps://doi.org/10.1109/date.2006.243957openalex-snapshot
Scheduling under Resource Constraints using Dis-Equations
inferred← citeshttps://doi.org/10.1109/etfa.1995.496776openalex-snapshot
A classification of nested loops parallelization algorithms
inferred← citeshttps://doi.org/10.1109/fccm51124.2021.00030openalex-snapshot
Clockwork: Resource-Efficient Static Scheduling for Multi-Rate Image Processing Applications on FPGAs
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380437openalex-snapshot
Code generation for multiple mappings
inferred← citeshttps://doi.org/10.1109/fpt.2010.5681493openalex-snapshot
Automatic synthesis of processor arrays with local memories on FPGAs
inferred← citeshttps://doi.org/10.1109/fpt.2011.6132715openalex-snapshot
Efficient nested loop pipelining in high level synthesis using polyhedral bubble insertion
inferred← citeshttps://doi.org/10.1109/hicss.1995.375471openalex-snapshot
Automatic task graph generation techniques
inferred← citeshttps://doi.org/10.1109/hipc.2016.047openalex-snapshot
Compiler Support for Software Cache Coherence
inferred← citeshttps://doi.org/10.1109/hipc.2017.00028openalex-snapshot
Adaptive Code Refinement: A Compiler Technique and Extensions to Generate Self-Tuning Applications
inferred← citeshttps://doi.org/10.1109/hipc.2017.00046openalex-snapshot
Lifting Barriers Using Parallel Polyhedral Regions
inferred← citeshttps://doi.org/10.1109/hips.1998.665147openalex-snapshot
Further results for improving loop interchange in non-adjacent and imperfectly nested loops
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188233openalex-snapshot
Polyhedral Tensor Schedulers
inferred← citeshttps://doi.org/10.1109/hpec.2012.6408676openalex-snapshot
Efficient and scalable computations with sparse tensors
inferred← citeshttps://doi.org/10.1109/hpec.2015.7322481openalex-snapshot
Automatic cluster parallelization and minimizing communication via selective data replication
inferred← citeshttps://doi.org/10.1109/iadcc.2015.7154862openalex-snapshot
Extended species for code parallelization through algorithmic classification
inferred← citeshttps://doi.org/10.1109/icaict.2017.8686931openalex-snapshot
Construction of optimal space-time mappings for automatic parallelization of loop nests with static control flow
inferred← citeshttps://doi.org/10.1109/icapp.1997.651504openalex-snapshot
Eigenvectors-based parallelisation of nested loops with affine dependences
inferred← citeshttps://doi.org/10.1109/iceee.2009.5393415openalex-snapshot
Control generation for QR decomposition based on the polytope model
showing the first 200 of 498 · page through all 498
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.