Analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory
Збережено в:
| Опубліковано в:: | arXiv.org (Sep 10, 2017), p. n/a |
|---|---|
| Автор: | |
| Опубліковано: |
Cornell University Library, arXiv.org
|
| Предмети: | |
| Онлайн доступ: | Citation/Abstract Full text outside of ProQuest |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2076525638 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 024 | 7 | |a 10.14529/cmse180203 |2 doi | |
| 035 | |a 2076525638 | ||
| 045 | 0 | |b d20170910 | |
| 100 | 1 | |a Sokolinsky, L B | |
| 245 | 1 | |a Analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory | |
| 260 | |b Cornell University Library, arXiv.org |c Sep 10, 2017 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a The paper is devoted to an analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory. A new model of parallel computations called BSF is proposed. The BSF model is based on BSP and SPMD models. The scope of BSF model is the compute-intensive applications. The architecture of BSF-computer is defined. The structure of BSF-program is described. The Using this metric, the upper scalability bounds of BSF programs on distributed memory multiprocessors are evaluated. The formulas for estimating the parallel efficiency of BSF programs also proposed. | |
| 653 | |a Distributed shared memory | ||
| 653 | |a Distributed memory | ||
| 773 | 0 | |t arXiv.org |g (Sep 10, 2017), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2076525638/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1704.05816 |