Models of the Task Assignment Problem in Distributed Systems

  • Mario Lucertini
Part of the International Centre for Mechanical Sciences book series (CISM, volume 284)


The paper presents a model for optimum partitioning of tasks over a multiple-processor system. The minimization of the interprocessor communications overhead and/or the message average delay are considered as a design criterion. The algorithmic approaches to the problem are briefly described and improuvements to the case of multiple copies of tasks are considered. A large set of references covering the area are included.


Optimum Partitioning Tree Partitioning Local Search Technique Computational Object Task Assignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    BARNES: An algorithm for partitioning the nodes of a graph. IBM Waston Res. Center, RC8690, 1981.Google Scholar
  2. [2]
    BECKER, PERL, SCHACH: A shifting algorithm for min-max tree partitioning. J. ACM, 1982.Google Scholar
  3. [3]
    BERTOLAZZI, LUCERTINI, MARCHETTI: Analysis of a class of graph partitioning problems. RAIRO Theoretical Comp. Science, 1982.Google Scholar
  4. [4]
    BERTOLAZZI, LUCERTINI: Tasks assignment in a multicomputer system: a mathematical model. IFAC, Kyoto, 1981.Google Scholar
  5. [5]
    BERTZTISS: A note on segmentation of computer programs. Inf. and Contr., 1968.Google Scholar
  6. [6]
    CARLSON, NEMHAUSER: Scheduling to minimize interaction costs. Op. Res., 1966.Google Scholar
  7. [7]
    CHANDLER, DE LUTIS: A methodology of multi-criteria information system design. Int. Comp. Conf., 1977.Google Scholar
  8. [8]
    CHANDRA, WONG: Worst-case analysis of a placement algorithm related to storage allocation. SIAM Comp., 1975.Google Scholar
  9. [9]
    CHANDY: Models of distributed systems. Proc. rd Int. Conf. on VLDB, Kyoto, 1977.Google Scholar
  10. [10]
    CHANDY, SAUER: The impact of distribution and disciplines on multiple processor system. Comm. ACM, 1979.Google Scholar
  11. [11]
    CHANDY, YEH: On the design of elementary distributed systems. Comp. Networks, 1979.Google Scholar
  12. [12]
    CHARNEY, PLATO: Efficient partitioning of components. ACM/IEEE Des. Ant. Workshop, Washington P.C., 1968.Google Scholar
  13. [13]
    CHEN, AKOKA: Optimal design of distributed information systems. IEEE-TC, C-29, 1980.Google Scholar
  14. [14]
    CHRISTOFIDES, BROOKER: The optimal partitioning of Graphs. SIAM J. Appl. Math., 1976.Google Scholar
  15. [15]
    CHU: Optimal file allocation in a computer network. In: Computer communication systems (ABRAMSON, KUO Eds.), Prentice Hall, 1973.Google Scholar
  16. [16]
    CHU, HOLLOWAY, LAN, EFE: Task allocation in distributed data processing Computer, 1980.Google Scholar
  17. [17]
    CIOFFI, COSTANTINI, DE JULIO: A new approach to the decomposition of sequential systems. Digital Processes, 1977.Google Scholar
  18. [18]
    CIOFFI, DE JULIO, LUCERTINI: Optimal decomposition of sequential machines via integer non-linear programming: a computational algo-rithm. Digital Processes, 1979.Google Scholar
  19. [19]
    COMEAU: A study of user program optimization in a paging system. ACM Symp. on Operating System Principles, Gatlinbury, 1967.Google Scholar
  20. [20]
    CORNUEJOLS, FISHER, NEMHAUSER: Location of Bank Accounts to optimize float: an analytic study of exact and approximate algorthms. Man. Sci., 1977.Google Scholar
  21. [21]
    DE JULIO, LUCERTINI, SACCA’: Un algoritmo efficiente per la decompo sizione ottima di macchine sequenziali. Conf. AIBO, 1978.Google Scholar
  22. [22]
    DENNING: Vurtual memory. Comp. Survey, 1970.Google Scholar
  23. [23]
    DENNING, BUSEN: The operational analysis of queueing network models. Comp. Surveys, 1978.Google Scholar
  24. [24]
    DONATH, HOFFMAN: Lower bounds for the partitioning of Graphs. IBM J. of Res. and Der., 1973.Google Scholar
  25. [25]
    DOWDY, FOSTER: Comparative models of the file assignment problem. ACM Comp. Surveys, 1982.Google Scholar
  26. [26]
    DUTTA, KOEHLER, WHINSTON: On optimal allocation in a distributed processing environment. Man. Sci., 1982.Google Scholar
  27. [27]
    ECKHOUSE, STANKOVIC, VAN DAM: Issues in distributed processing. IEEE Tr. Comp., 1978.Google Scholar
  28. [28]
    ENSLOW: Research issues in fully distributed systems. AICA, Bari, 1979.Google Scholar
  29. [29]
    FOSTER, DOWDY, AMES: File assignment in a computer network. Comp. Networks, 1981.Google Scholar
  30. [30]
    GOMORY, HU: Multi-terminal network flows. SIAM, 1961.Google Scholar
  31. [31]
    GORINSMTEYN: The partitioning of graphs. Eng. Cybern., 1969.Google Scholar
  32. [32]
    GRAVES, WHINSTON: An algorithm for the quadratic assignment problem. Man. Sci., 1970.Google Scholar
  33. [33]
    GROSS, SOLAND: A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables. Nair. Res. Log., 1969.Google Scholar
  34. [34]
    HADLOCK: Minimum spanning forest of bounded trees. 5th South Conf. on Comb., Graph Theory and Comp. Winnipeg, 1974.Google Scholar
  35. [35]
    HADLOCK: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comp., 1975.Google Scholar
  36. [36]
    HAESSIG, JENNY: An algorithm for allocating computational objects in distributed computing systems. IBM Zurich Res. Lab. RZ 1016, 1980.Google Scholar
  37. [37]
    HILLIER, CONNORS: Quadratic assignment problem algorithm, and Location of Indivisible facilities. Man. Sci., 1966.Google Scholar
  38. [38]
    HOFRI, JENNY: On the allocation of processes in distributed computing systems. IBM Zurich Res. Lab. RZ 905, 1978.Google Scholar
  39. [39]
    HOSKEN: Optimum partitioning of the addressing structures. SIAM J. Comp., 1975.Google Scholar
  40. [40]
    HU: Integer programming and network flows. Addison-Wesley, 1970.Google Scholar
  41. [41]
    HU, RUSKEY: Circular cuts in a network. Math. of Op. Res., 1980.Google Scholar
  42. [42]
    HYAFIL, RIVEST: Graph partitioning and constructing optimal decision trees are polynomial complete problems. IRIA Rep. 33, 1973.Google Scholar
  43. [43]
    IBARRA, KIM: Fast approximation algorithms for the Knapsach and sum of subset problems. J. ACM, 1975Google Scholar
  44. [44]
    IBARRA, KIM: Approximation algorithms for certain scheduling pro-blems. Math. Op. Res., 1978.Google Scholar
  45. [45]
    JENNY, KUHMERLE: Distributed processing within an integrated circuit/Packet-switching node. IEEE Tr. Commun., 1976.Google Scholar
  46. [46]
    JENSEN: Optimal network partitioning. Op. Rls., 1970.Google Scholar
  47. [47]
    JOHNSON: Approximation algorithms for combinatorial problems. J. Comp. and Syst. Sci., 1974.Google Scholar
  48. [48]
    KERNIGHAN: Some graph partitioning, problems related to program segmentation. Ph. D. Th., Princeton, 1969.Google Scholar
  49. [49]
    KERNIGHAN, LIN: An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Tech. J., 1970.Google Scholar
  50. [50]
    KERNIGHAN: Optimal sequential partitions of graphs. J. ACM, 1971.Google Scholar
  51. [51]
    KOONTZ, NORENDRA, FUKUNAGA: A branch and bound clustering algorithm. IEEE Tr. Comp., 1975.Google Scholar
  52. [52]
    KUNDU, MISRA: A linear tree partitioning algorithm. SIAM J. Comp., 1977.Google Scholar
  53. [53]
    LAWLER: Electrical assemblies with a minimum number of intercon-nections. IKE Tr. Elec. Comp., 1962.Google Scholar
  54. [54]
    LAWLER, LEVITT, TURNER: Module clustering to minimize delay in digital networks. IEEE Tr. Comp., 1969.Google Scholar
  55. [55]
    LAWLER: Cutsets and partitions of Hypergraphs Networks, 1973.Google Scholar
  56. [56]
    LAWLER: Fast approximation algorithms for Knapsack problems. Math. Op. Res., 1979.Google Scholar
  57. [57]
    LIPTON, TARJAN: A separator theorem for planar graphs. Conf. on Theor. Comp. Sci., Waterloo, 1977.Google Scholar
  58. [58]
    LIPTON, TARJAN: Applications of a planar separator theorem. 18th FOCS. Long Beach, 1977.Google Scholar
  59. [59]
    LUCCIO, SAMI: On the decomposition of networks in minimally interconnected subnetworks. IEEE Tr. Circ. theory, 1969.Google Scholar
  60. [60]
    LUKES: Efficient algorithm for the partitioning of trees. IBM J. Res. Der., 1974.Google Scholar
  61. [61]
    MAHLOUD, RIORDAN: Optimal allocation of resources in Distributed Information Networks. ACM Tr. Databases Syst., 1976.Google Scholar
  62. [62]
    MARSTEN: An algorithm for large set partitioning problems. Man. Sci., 1974.Google Scholar
  63. [63]
    MENDELSON, PLISKIN, YECHIALI: Optimal storage allocation for serial files. Comm. ACM, 1979.Google Scholar
  64. [64]
    MISRA, TARJAN: Optimal chain partitions of trees. Inf. Proc: Letters, 1975.Google Scholar
  65. [65]
    MOKGAN, LEVIN: Optimal program and data locations in computer networks. Comm. ACM, 1977.Google Scholar
  66. [66]
    PERL, SCHACH: Maxmin tree partitioning. J. ACM, 1981.Google Scholar
  67. [67]
    PERL, SMILOACH: Efficient optimization of monotonic function on trees. CAAP 81, Lect. Notes in Cong. Sci., 1981.Google Scholar
  68. [68]
    RAO, STONE, HU: Assignment of tasks in a distributed processor system with limited memory. IEEE Tr. Comp., 1979.Google Scholar
  69. [69]
    RUSSO, ODEN, WOLFF: A Heuristic procedure for the partitioning and mapping of computer logic blocks to modules. IEEE Tr. Comp., 1971.Google Scholar
  70. [70]
    SACCA, WIEDERHOLD: Database Partitioning in a cluster of processors. VLDB Conf., 1983.Google Scholar
  71. [71]
    SAHNI: Approximative algorithms for the 0/1 Knapsack problem. J. ACM, 1975.Google Scholar
  72. [72]
    SAHNI: General techniques for combinatorial approximation. Op. Res., 1977.Google Scholar
  73. [73]
    SCHRADER: Approximations to clustering and subgraph problems on trees. Okonometric and Op. Res. Inst. Rep. 81202–0R, Bonn, 1981.Google Scholar
  74. [74]
    SIMEONE: An asymptotically exact polynomial algorithm for equi-partition problems. IAC n. 153, Roma, 1978.Google Scholar
  75. [75]
    STONE: Multiprocessor scheduling with the aid of network flow algorithms. IEEE Tr. Soft. Eng., 1977.Google Scholar
  76. [76]
    TARJAN: A hierarchical clustering algorithm using strong components. Int. Proc. Letters, 1982.Google Scholar
  77. [77]
    TARJAN: An improved algorithm for hierarchical clustering using strong components. Int. Proc. Letters, 1983.Google Scholar
  78. [78]
    WONG, COPPERSMITH: A combinatorial problem related to multimodule memory organization. J. ACM, 1974.Google Scholar

Copyright information

© Springer-Verlag Wien 1984

Authors and Affiliations

  • Mario Lucertini
    • 1
  1. 1.Dipartimento di Informatica e Sistemisticadell’Università di Roma e Istituto di Analisi dei Sistemi ed Informatica del C.N.R.RomaItaly

Personalised recommendations