Subtitle:

Książka = Book ; KS/3/1989/R05P01

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Description:

[3], 224-231 pages ; 21 cm ; Bibliography p. 231

Type of object:

Book/Chapter

Abstract:

The compu~ation time of algorithms {deecribed by a network of processes) distributed in multiproceeeor systems depende heavily on performed process allocation in the multiprocessor system. The static type of allocation is coneidered, i.e. the allocation is performed prior to the distributed computation beginning. An optimization model is formulated, which depends on last (computation time) distribution between the processors and on communication overhead caused by message transmission. The defined problem i s NP-hard. Two relaxations of the model are formulated. For the second relaxed problem an algoritlua is proposed, which is characterized by polynomial computation time. In this way a lower. bound can be calculated for the estimation of heuristic solutions.

Relation:

Książka = Book

Detailed Resource Type:

Book

Resource Identifier:

oai:rcin.org.pl:198543

Source:

KS-1989-03-R05P01

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open