Skip to main content
SpringerLink
Log in

The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

The Process Allocation Problem, which consists of allocating a number of processes to a network of processors with the objective of minimizing the sum of communication (between processes residing on different processors) and execution costs, is presented and the relevant literature reviewed. Solution procedures employing graph-theoretic and mathematical programming methods are critically examined. Some heuristic algorithms are also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. The Economic University of Athens, Greece

    S. Sofianopoulou

Authors
  1. S. Sofianopoulou
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sofianopoulou, S. The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches. J Oper Res Soc 43, 407–413 (1992). https://doi.org/10.1057/jors.1992.67

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1992.67

Keywords

Search

Navigation