Generic Cluster-Computing Algorithms and Applications
نویسندگان
چکیده
We define several generic cluster-computing algorithms, each of them encapsulating a general purpose control structure. By extending these generic algorithms with sequential code, we derive specific cluster-computing algorithms for diverse problems. We use a specification and prototyping language to test the validity of the derived parallel algorithms before finally converting them into efficient C code that runs in a cluster-computing environment, such as PVM. Our performance experiments demonstrate that highly generic cluster-computing algorithms can produce efficient cluster-computing applications.
منابع مشابه
Data Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملA generic all-pairs cluster-computing pipeline and its applications
In this paper we propose a generic pipeline for all-pairs computations on a cluster of workstations. We use this generic pipeline to derive specific cluster algorithms for three different all-pairs problems: n-body simulation, bubble sort, and Gaussian elimination. We implement the generic pipeline and its derivatives on a cluster of Intel Pentium II workstations using C and the PVM cluster com...
متن کاملUsing and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators
With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...
متن کاملCloud Computing Technology Algorithms Capabilities in Managing and Processing Big Data in Business Organizations: MapReduce, Hadoop, Parallel Programming
The objective of this study is to verify the importance of the capabilities of cloud computing services in managing and analyzing big data in business organizations because the rapid development in the use of information technology in general and network technology in particular, has led to the trend of many organizations to make their applications available for use via electronic platforms hos...
متن کامل