Measuring concurrency of parallel algorithms

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 suit...

Full description

Saved in:
Bibliographic Details
Main Authors: skrinarova, J., Melichercik, M.
Format: Conference Proceeding
Language:English
Subjects:
Approximation algorithms
Cities and towns
Clustering algorithms
Concurrent computing
Parallel algorithms
Pediatrics
Traveling salesman problems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/INFTECH.2008.4621643