This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parametric Module Allocation on Partial k-Trees
June 1993 (vol. 42 no. 6)
pp. 738-742

The problem of allocating modules to processors in a distributed system to minimize total costs when the underlying communication graph is a partial k-tree and all costs are linear functions of a real parameter t is considered. It is shown that if the number of processors is fixed, the sequence of optimum assignments that are obtained as t varies from zero to infinity can be constructed in polynomial time. As an auxiliary result, a linear time separator algorithm for k-trees is developed. The implications of the results for parametric versions of the weighted vertex cover, independent set, and 0-1 quadratic programming problems on partial k-trees are discussed.

[1] S. Arnborg and A. Proskurowski, "Linear time algorithms for NP-hard problems restricted to partialk-trees,"Discr. Appl. Math., vol. 23, pp. 11-24, 1989.
[2] F. Barahona, "A solvable case for quadratic 0-1 programming,"Discr. Appl. Math., vol. 13, pp. 23-26, 1986.
[3] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,"IEEE Trans. Software Eng., vol. SE-7, no. 6, pp. 583-589, 1981.
[4] D. Fernández-Baca, "Allocating modules to processors in a distributed system,"IEEE Trans. Software Eng., vol. 15, no. 11, pp. 1427-1436, 1989.
[5] D. Fernández-Baca and G. Slutzki, "Solving parametric problems on trees,"J. Algorithms, vol. 10, pp. 381-402, 1989.
[6] V. P. Gulati, S. K. Gupta, and A. K. Mittal, "The unconstrained quadratic bivalent programming problem,"Euro. J. Oper. Res., vol. 15, pp. 121-125, 1981.
[7] D. Gusfield, "Parametric combinatorial computing and a problem of module distribution,"J. ACM, no. 3, pp. 551-563, 1983.
[8] O. Kariv and S. L. Hakimi, "An algorithmic approach to network location problems I: Thep-centers,"SIAM J. Appl. Math., vol. 37, pp. 513-538, 1979.
[9] R. Lipton and R. Tarjan, "Applications of a planar separator theorem,"SIAM J. Comput., vol. 9, no. 3, pp. 615-627, 1980.
[10] J. Matousek and R. Thomas, "Algorithms finding tree-decompositions of graphs,"J. Algorithms, vol. 12, pp. 1-22, 1991.
[11] B. A. Reed, "Finding approximate separators and computing tree width quickly," inProc. 24th Annu. Symp. Theory Comput., 1992, pp. 221-228.
[12] N. Robertson and P. D. Seymour, "Graph minors II: Algorithmic aspects of treewidth,"J. Algorithms, vol. 7, pp. 309-322, 1986.
[13] J. B. Sinclair, "Optimal assignments in broadcast networks,"IEEE Trans. Comput., vol. 37, no. 5, pp. 521-531, 1988.
[14] H. Stone, "Critical load factors in two-processor distributed systems,"IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, 1978.
[15] D. Towsley, "Allocating programs containing branches and loops within a multiple processor system,"IEEE Trans. Software Eng., vol. SE-12, pp. 1018-1024, Oct. 1986.
[16] J. van Leeuwen, "Graph algorithms,"Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Cambridge, MA: M.I.T. Press, 1990.

Index Terms:
module allocation; partial k-trees; communication graph; polynomial time; computational complexity; distributed processing; dynamic programming; graph theory; resource allocation.
Citation:
D. Fernandez-Baca, A. Medepalli, "Parametric Module Allocation on Partial k-Trees," IEEE Transactions on Computers, vol. 42, no. 6, pp. 738-742, June 1993, doi:10.1109/12.277293
Usage of this product signifies your acceptance of the Terms of Use.