Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Książka = Book ; KS/3/1989/R05P01
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[3], 224-231 stron ; 21 cm ; Bibliografia s. 231
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.
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
Oct 15, 2021
Jul 19, 2021
34
https://rcin.org.pl./publication/234873
Kadłuczka, Piotr Wala, Konr