PERFORMANCE EVALUATION OF PARALLEL APPLICATIONS USING MESSAGE PASSING INTERFACE IN NETWORK OF WORKSTATIONS OF DIFFERENT COMPUTING POWERS
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 2
Abstract
A network created from so called commodity hardware can effectively and affordably be used for high performance computing. Major attraction from such networks is cost-effectiveness due to efficient utilization of existing hardware. By combining processing powers of many scattered workstations, a large computational problem can be solved within desirable time constraint, which is comparable to that of a proprietary or dedicated parallel computer. Popularly such systems are known as Cluster or Network of Workstations (NOWs). Among the fastest computers in the world, many of them have been developed by using the same technology. In this paper, we evaluate performance of parallel applications on cluster of nodes having different computing powers in terms of hardware attributes/parameters. We also investigates impact on execution time after running parallel application on selected favorable nodes, in terms of computing power and compare it with performance of application executed on random nodes.
Authors and Affiliations
RAJKUMAR SHARMA , PRIYESH KANUNGO , MANOHAR CHANDWANI
Keywords
Related Articles
- EP ID EP119127
- DOI -
- Views 134
- Downloads 0
Collision Detection and Avoidance in Railways Using WiMAX
As we have already seen that the railway has done a lot of efforts for collision avoidance and accidents prevention. Several techniques have been developed for avoiding such hazardous loss of life and property. In this p...
A COMPARATIVE STUDY OF PROPOSED TOPOLOGY CONTROL ALGORITHMS FOR ENERGY EFFICIENT WIRELESS SENSOR NETWORK
Recent years showed a wide range of applications in Wireless Sensor Networks (WSN). For a WSN, Topology Control is crucial to obtain an energy efficient network without affecting the connectivity and other properties. In...
DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimension...
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. T...
Comparative study on classification power of the attributes and reducts
In rough set theory, reduct are those attributes which are important and are able to represent the whole range of attributes. They show up the important features of database. In the present study of educational data mini...