DocumentCode :
3628822
Title :
Measuring concurrency of parallel algorithms
Author :
Jarmila skrinarova;Miroslav Melichercik
Author_Institution :
Matej Bel University, Slovakia
fYear :
2008
Firstpage :
1
Lastpage :
4
Abstract :
In this paper, high performance computing is presented. We show some procedures of making algorithmic problems in parallel way. The procedures are explained on some easily understandable programs. We use various measures to evaluate how much concurrency an algorithm provides. The methodology of suitable application selection is drawn up. For implementation and testing we use OpenMosix, which is a Linux based operating system with single-system-image clustering technology.
Keywords :
"Clustering algorithms","Concurrent computing","Pediatrics","Cities and towns","Traveling salesman problems","Approximation algorithms","Parallel algorithms"
Publisher :
ieee
Conference_Titel :
Information Technology, 2008. IT 2008. 1st International Conference on
Print_ISBN :
978-1-4244-2244-9
Type :
conf
DOI :
10.1109/INFTECH.2008.4621643
Filename :
4621643
Link To Document :
بازگشت