|
Avtomatika i Telemekhanika, 1981, Issue 9, Pages 173–177
(Mi at5918)
|
|
|
|
Computers in Control
On upper bound of schedules for solution of independent problems in batch operation of uniform computing systems
V. Yu. Bakenrot, A. G. Chefranov Taganrog
Abstract:
The upper bounds are found of time in which a package of independent simple problems (each requiring one processor) is solved in a specified number of processors and the number of processors needed for execution of a package of independent complex problems (each requiring more than one processor) within a fixed number of cycles. The proposed bounds are shown to be below those reported earlier.
Received: 12.08.1980
Citation:
V. Yu. Bakenrot, A. G. Chefranov, “On upper bound of schedules for solution of independent problems in batch operation of uniform computing systems”, Avtomat. i Telemekh., 1981, no. 9, 173–177; Autom. Remote Control, 42:9 (1981), 1271–1274
Linking options:
https://www.mathnet.ru/eng/at5918 https://www.mathnet.ru/eng/at/y1981/i9/p173
|
Statistics & downloads: |
Abstract page: | 98 | Full-text PDF : | 38 | First page: | 2 |
|