DocumentCode :
2413032
Title :
Parallel processing puzzle N2-1 on cluster architectures performance analysis
Author :
Sanz, Victoria ; Giusti, Armando De ; Chichizola, Franco ; Naiouf, Marcelo ; Giusti, Laura De
Author_Institution :
Sch. of Comput. Sci., UNLP, La Plata
fYear :
2008
fDate :
23-26 June 2008
Firstpage :
879
Lastpage :
884
Abstract :
An analysis of a parallel solution of N2-1 puzzle using clusters, is presented. This problem is interesting due to its complexity and related applications, particularly in the field of robotics. A variation of classic heuristics for forecasting the work to be done in order to reach a solution is analyzed, and it is shown that its use significantly improves the time of sequential algorithm A . Then, a parallel solution on a distributed architecture is presented and speedup is analyzed based on the number of processors, efficiency, and the possible superlinearity when scaling the problem.
Keywords :
optimisation; parallel processing; software performance evaluation; workstation clusters; N2 middot1 puzzle; classic heuristics; cluster architectures performance analysis; distributed architecture; parallel processing; robotics; sequential algorithm; Algorithm design and analysis; Application software; Clustering algorithms; Computer architecture; Concurrent computing; Parallel algorithms; Parallel processing; Performance analysis; Robots; Scalability; Distributed Processing; Efficiency Scalability; Parallel Algorithms; Speedup; Superlinearity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology Interfaces, 2008. ITI 2008. 30th International Conference on
Conference_Location :
Dubrovnik
ISSN :
1330-1012
Print_ISBN :
978-953-7138-12-7
Electronic_ISBN :
1330-1012
Type :
conf
DOI :
10.1109/ITI.2008.4588527
Filename :
4588527
Link To Document :
بازگشت