research-article

Allocating Modules to Processors in a Distributed System

Author:

D. Fernandez-BacaAuthors Info & Claims

IEEE Transactions on Software Engineering, Volume 15, Issue 11

Pages 1427 - 1436

https://doi.org/10.1109/32.41334

Published: 01 November 1989 Publication History

Abstract

The author studies the complexity of the problem of allocating modules to processes in a distributed system to minimize total communication and execution costs. He shows that unless P=NP, there can be no polynomial-time epsilon -approximate algorithm for the problem, nor can there exist a local search algorithm that requires polynomial time per iteration and yields an optimum assignment. Both results hold even if the communication graph is planar and bipartite. On the positive side, it is shown that if the communication graph is a partial k-tree or an almost-tree with parameter k, the module allocation problem can be solved in polynomial time.

References

[1]

{1} S. Arnborg, "Efficient algorithms for combinatorial problems on graphs with bounded decomposability--A survey," BIT, vol. 25, pp. 305-314, 1985.

Digital Library

[2]

{2} S. Arnborg, D. G. Corneil, and A. Proskurowski, "Complexity of finding embeddings in a k-tree," SIAM J. Alg. Discr. Methods, vol. 8, no. 2, pp. 277-284, 1987.

Digital Library

[3]

{3} A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.

Digital Library

[4]

{4} S. Arnborg and A. Proskurowski, "Characterization and recognition of partial 3-trees," SIAM J. Alg. Discr. Methods, vol. 7, pp. 305- 314, 1986.

Digital Library

[5]

{5} S. Arnborg and A. Proskurowski, "Linear-time algorithms for NP-hard problems restricted to partial k-trees," manuscript.

[6]

{6} H. L. Bodlaender, "Classes of graphs with bounded tree-width," Dep. Comput. Sci., Univ. Utrecht, The Netherlands, Tech. Rep. RUU-CS-86-22, Dec. 1986.

[7]

{7} H. L. Bodlaender, "Some classes of graphs with bounded tree-width," Bull. EATCS, vol. 36, pp. 116-126, 1988.

[8]

{8} S. 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.

Digital Library

[9]

{9} U. Bertelè and F. Brioschi, Nonserial Dynamic Programming. New York: Academic, 1972.

[10]

{10} W. W. Chu, L. J. Holloway, M. Lan, and K. Efe, "Task allocation in distributed data processing," Computer, pp. 57-69, Nov. 1980.

Digital Library

[11]

{11} E. S. Elmallah and C. J. Colbourn, "Reliability of Δ-Y networks," Congressus Numerantium, vol. 48, pp. 49-54, 1985.

[12]

{12} S. Even, A. Itai, and A. Shamir, "On the complexity of multicommodity flow problems," SIAM J. Comput., vol. 5, no. 4, pp. 691- 703, 1976.

Digital Library

[13]

{13} D. Fernández-Baca and G. Slutzki, "Solving parametric problems on trees," Dep. Comput. Sci., Iowa State Univ., Tech. Rep. 87-12, 1987, to appear in J. Algorithms.

[14]

{14} M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.

Digital Library

[15]

{15} Y. Gurevich, L. Stockmeyer, and U. Vishkin, "Solving NP-hard problems on graphs that are almost trees and an application to facility location problems," J. ACM, vol. 31, no. 3, pp. 459-473, 1984.

Digital Library

[16]

{16} D. Gusfield, "Parametric combinatorial computing and a problem in module distribution," J. ACM, 1983.

[17]

{17} D. Lichtenstein, "Planar formulae and their uses," SIAM J. Comput. , vol. 11, no. 2, pp. 329-343, 1982.

Digital Library

[18]

{18} V. M. Lo, "Heuristic algorithms for task assignment in distributed systems," IEEE Trans. Comput., vol. C-37, no. 11, pp. 1384-1397, 1988.

[19]

{19} R. Lipton and R. Tarjan, "Applications of a planar separator theorem," SIAM J. Comput., vol. 9, no. 3, pp. 615-627, 1980.

Digital Library

[20]

{20} C. H. Papadimitriou and K. Steiglitz, "The complexity of local search for the traveling salesman problem," SIAM J. Comput., vol. 6, no. 1, pp. 76-83, 1977.

Digital Library

[21]

{21} C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hail, 1982.

[22]

{22} A. Rosenthal, "Dynamic programming is optimal for nonserial optimization problems," SIAM J. Comput., vol. 11, no. 1, pp. 47-59, 1982.

Digital Library

[23]

{23} N. Robertson and P. D. Seymour, "Graph minors XIII: The disjoint paths problem," Manuscript, Sept. 1986.

[24]

{24} J. B. Sinclair, "Efficient computation of optimal assignments for distributed tasks," J. Parallel Distributed Comput., vol. 4, no. 4, pp. 342-362, 1987.

Digital Library

[25]

{25} H. Stone, "Multiprocessor scheduling with the aid of network flow algorithms," IEEE Trans. Software Eng., vol. SE-3, pp. 85-94, 1977.

Digital Library

[26]

{26} H. Stone, "Critical load factors in two-processor distributed systems," IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, 1978.

Digital Library

[27]

{27} S. Sahni and T. Gonzalez, "P-complete approximation problems," J. ACM, vol. 23, pp. 555-565, 1976.

Digital Library

[28]

{28} D. Towsley, "Allocating programs containing branches and loops within a multiple processor system," IEEE Trans. Software Eng., vol. SE-12, no. 10, pp. 1018-1024, 1986.

Digital Library

Cited By

Liu BLi JLin WBai WLi PGao Q(2021)K‐PSOInternational Journal of Network Management10.1002/nem.209231:2Online publication date: 9-Mar-2021
https://dl.acm.org/doi/10.1002/nem.2092
Li JLiu BLin WLi PGao Q(2019)An Improved Container Scheduling Algorithm Based on PSO for Big Data ApplicationsCyberspace Safety and Security10.1007/978-3-030-37337-5_42(516-530)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/978-3-030-37337-5_42
Hussain AAleem MKhan AIqbal MIslam M(2018)RALBACluster Computing10.5555/3287988.328801121:3(1667-1680)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.5555/3287988.3288011
Show More Cited By

Index Terms

Allocating Modules to Processors in a Distributed System
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Communications management
        Process management
        Process synchronization
    2. Software system structures
      1. Distributed systems organizing principles

Recommendations

Bipartite Edge Coloring in $O(\Delta m)$ Time

We show that a minimum edge coloring of a bipartite graph can be found in $O(\Delta m)$ time, where $\Delta$ and m denote the maximum degree and the number of edges of G, respectively. It is equivalent to finding a perfect matching in a k-regular ...
Parametric Module Allocation on Partial k-Trees

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 ...
Star colouring of bounded degree graphs and regular graphs
Abstract
A k-star colouring of a graph G is a function f : V ( G ) → { 0 , 1 , … , k − 1 } such that f ( u ) ≠ f ( v ) for every edge uv of G, and every bicoloured connected subgraph of G is a star. The star chromatic number of G, χ s ( G ), is ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 15, Issue 11

November 1989

178 pages

ISSN:0098-5589

Editor:
Victor R. Basili
Univ. of Maryland, College Park

Issue’s Table of Contents

Copyright © Copyright © 1989 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 November 1989

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

94
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Liu BLi JLin WBai WLi PGao Q(2021)K‐PSOInternational Journal of Network Management10.1002/nem.209231:2Online publication date: 9-Mar-2021
https://dl.acm.org/doi/10.1002/nem.2092
Li JLiu BLin WLi PGao Q(2019)An Improved Container Scheduling Algorithm Based on PSO for Big Data ApplicationsCyberspace Safety and Security10.1007/978-3-030-37337-5_42(516-530)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/978-3-030-37337-5_42
Hussain AAleem MKhan AIqbal MIslam M(2018)RALBACluster Computing10.5555/3287988.328801121:3(1667-1680)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.5555/3287988.3288011
Majhi SDhal SPal SBhuyan S(2018)Queuing Analysis of Cloud Load Balancing AlgorithmsInternational Journal of Knowledge-Based Organizations10.4018/IJKBO.20180101048:1(50-67)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.4018/IJKBO.2018010104
Xingbo JJu WDali WChunsheng FSundhararajan MGao XVahdat Nejad H(2018)The research on meta-job scheduling heuristics in heterogeneous environmentsJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-16940834:2(1141-1151)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/JIFS-169408
Shirobokov MSevryukov S(2018)Load Distribution in the Heterogeneous Computer Network of the Geoinformation SystemProceedings of the 3rd International Conference on Applications in Information Technology10.1145/3274856.3274877(102-105)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3274856.3274877
Loomba RMetsch TFeehan LButler J(2018)A Hybrid Fitness-Utility Algorithm for Improved Service Chain Placement2018 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2018.8648033(1-7)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.1109/GLOCOM.2018.8648033
Buddhika TStern RLindburg KEricson KPallickara S(2017)Online Scheduling and Interference Alleviation for Low-Latency, High-Throughput Processing of Data StreamsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.272340328:12(3553-3569)Online publication date: 9-Nov-2017
https://dl.acm.org/doi/10.1109/TPDS.2017.2723403
Rimal BMaier M(2017)Workflow Scheduling in Multi-Tenant Cloud Computing EnvironmentsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.255666828:1(290-304)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1109/TPDS.2016.2556668
Vyavahare PLimaye NDiwan AManjunath D(2017)On the Maximum Rate of Networked Computation in a Capacitated NetworkIEEE/ACM Transactions on Networking10.1109/TNET.2017.269557825:4(2444-2458)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2695578
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents