DocumentCode :
3256986
Title :
On deciding granularity for optimal speedup for solving data parallel problems with clustered distributed computing
Author :
Jwo, Jung-Sing ; Cheng, Yu Chin ; Hsieh, Chin-Yen
Author_Institution :
Dept. of Comput. & Inf. Sci., Tunghai Univ., Taichung, Taiwan
fYear :
1997
fDate :
18-20 Dec 1997
Firstpage :
144
Lastpage :
149
Abstract :
In this paper we show how to obtain optimal speedup in a master-slave model for solving data-parallel problems. Given the number of homogeneous workstations, their computation time for solving a basic sub-task of the problem, network transmission bandwidth and data volume per basic sub-task, the per-distribution number of basic sub-tasks sent to a slave for attaining the optimal speedup can be decided. The effectiveness of the proposed theory has been tested using a parallel computing experiment involving the Hough transformation
Keywords :
parallel architectures; performance evaluation; clustered distributed computing; computation time; data parallel problems; granularity; master-slave model; network transmission bandwidth; optimal speedup; parallel computing; Bandwidth; Computer networks; Concurrent computing; Distributed computing; Grain size; High performance computing; Local area networks; Master-slave; Parallel processing; Workstations;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on
Conference_Location :
Taipei
ISSN :
1087-4089
Print_ISBN :
0-8186-8259-6
Type :
conf
DOI :
10.1109/ISPAN.1997.645085
Filename :
645085
Link To Document :
بازگشت