Data structures and network algorithms
Data structures and network algorithms
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Integer and combinatorial optimization
Integer and combinatorial optimization
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A Decomposition Approach for Balancing Large-Scale Acyclic Data Flow Graphs
IEEE Transactions on Computers
Optimization
Balancing problems in acyclic networks
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
On the complexity of integer programming
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Buffer assignment for data driven architectures
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Buffer Assignment Algorithms on Data Driven ASICs
IEEE Transactions on Computers
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
A unified theory of timing budget management
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
| Hi-index | 14.98 |
Data flow machines whose task graphs are acyclic can be transformed into synchronous machines, thereby increasing pipelining and throughput. This is achieved by introducing delays or buffers on certain lines, so that the resulting graph is balanced, i.e., travel times along any two paths with common endpoints are the same. The buffer assignment problem is how to balance a rooted acyclic data flow graph with a minimum number of buffer units. Recently, an integer programming decomposition procedure was proposed for this problem. The decomposition was introduced in an attempt to circumvent the exponential blowup typical of integer programming algorithms. It is shown that the buffer assignment problem can in fact be solved to optimality in low-degree polynomial time. The result is obtained by a sequence of reformulations of the problem, leading to models to which simple and efficient network flow procedures can be successfully applied.