Search techniques for a nonlinear multiprocessor scheduling problem

Camille C. Price and Udo W. Pooch

Naval Research Logistics Quarterly, 1982, vol. 29, issue 2, 213-233

Abstract: The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero‐one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non‐backtracking branch‐and‐bound algorithm is described that uses a local neighborhood search at each stage of the search graph.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800290204

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:29:y:1982:i:2:p:213-233

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().