• DocumentCode
    3246625
  • Title

    Optimal task assignment using a neural network

  • Author

    Tanaka, T. ; Canfield ; Oyanagi, Shigeru

  • Author_Institution
    Toshiba Res. & Dev. Centre, Kanagawa, Japan
  • fYear
    1989
  • fDate
    0-0 1989
  • Abstract
    Summary form only given. A neural network is described that solves the problem of optimally assigning tasks to processors in a message-passing parallel machine. This task assignment problem (TAP) is defined by creating a task assignment cost function that expresses the cost of communication overhead and load imbalance. TAP is a kind of combinatorial optimization problem which can be solved efficiently by using a neural network, but the Hopfield and Tank approach has certain limitations. The authors have solved these two problems by use of an improved Hopfield model network. By representing TAP in a more direct manner in the neural network, the need for constraints is eliminated, a valid solution is guaranteed, and the number of neurons and connections needed is reduced substantially.<>
  • Keywords
    combinatorial mathematics; multiprocessing programs; neural nets; optimisation; parallel machines; combinatorial optimization; communication overhead; improved Hopfield model network; load imbalance; message-passing parallel machine; multiprocessing programs; neural network; optimal task assignment; Combinatorial mathematics; Neural networks; Optimization methods; Parallel machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1989. IJCNN., International Joint Conference on
  • Conference_Location
    Washington, DC, USA
  • Type

    conf

  • DOI
    10.1109/IJCNN.1989.118372
  • Filename
    118372