Normal view MARC view ISBD view

Parallel processing puzzle N2-1 on cluster architectures performance analysis

By:

Sanz, Victoria María

Contributor(s):

Material type: Article

ArticlePublication details: ref_localidad@NULL : IEEE, 2008Description: 1 archivo (159,7 kB)Subject(s):

Online resources:

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Capítulo de libro	Biblioteca Fac.Informática	A0258 (Browse shelf(Opens below))	Available		DIF-A0258

Browsing Biblioteca Fac.Informática shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	A0255 Performance comparison of VxWorks, Linux, RTAI, and Xenomai in a hard real time application	A0256 Improving the quality of Web-GIS modularity with aspects	A0257 Introducing a distance learning version of a postgraduate program on networking in Argentina	A0258 Parallel processing puzzle N2-1 on cluster architectures performance analysis	A0259 Refactoring for usability in web applications	A0260 Separation of structural concerns in physical hypermedia mode	A0261 Towards a scalable and collaborative information integration platform and methodology	Next

Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.)

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.

International Conference on Information Technology Interfaces (30th : 2008 : Cavtat, Croacia) IEEE; pp. 879-884.

There are no comments on this title.

to post a comment.