Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Energy efficient transmission scheduling for infrastructure sensor nodes in location systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we discuss a method to perform compile-time buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs -- known as regular stream flow graphs -- commonly used in Digital Signal Processing applications. We relate the buffer sharing problem to that of finding independent sets in weighted circular arc graph. An important difference between the traditional graph coloring/register allocation problem and our buffer sharing problem is that in our problem the aim is to minimize the sum of the weights of the independent sets, rather than the number of independent sets. We present a heuristic algorithm and experiment it on a large number of randomly generated regular dataflow graphs as well as a few DSP applications. It is observed that the heuristic algorithm performs well, reducing the buffer requirement by 14.3% on the average. Also, we observe that buffer requirement achieved by the heuristic algorithm is within 2.1% from the lower bound.