Performance comparison of parallel programming environments for implementing AIAC algorithms

Summary form only given. AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous work...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing: Proceedings, 18th International Symposium, Santa Fe, NM, 2004 s. 247
Hlavní autoři: Bahi, J.M., Contassot-Vivier, S., Couturier, R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2004
Témata:
Asynchronous communication
Context
Distributed processing
Equations
Grid computing
Iterative algorithms
Parallel processing
Parallel programming
Programming environments
Testing
ISBN:9780769521329, 0769521320
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Summary form only given. AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal is to compare several parallel programming environments in order to see if there is one of them which is best suited to efficiently implement AIAC algorithms. The main criterion for this comparison consists in the performances achieved in a global context of grid computing for two classical scientific problems. Nevertheless, we also take into account two secondary criteria, which are the ease of programming and the ease of deployment. The second goal is to extract from this comparison the important features that a parallel programming environment must have in order to be suited for the implementation of AIAC algorithms.
ISBN:9780769521329
0769521320
DOI:10.1109/IPDPS.2004.1303305