A Dynamic Workload Balancing Technique of a Text Matching Algorithm on a Cluster
نویسندگان
چکیده
A dynamic workload allocation model which utilizes a data pool manager is investigated herein. It aims at heterogeneous multicomputer environments and the implementation is written in C using the MPICH NT 1.2.5 message passing interface for Microsoft Windows based clusters. The algorithm utilized is the data parallel adaptation of the Brute Force exact pattern matching algorithm. Performance evaluation for both homogeneous and heterogeneous system configurations is experimentally investigated. Key–Words: Parallel pattern matching, Heterogeneous clusters, Workload Allocation, Data pool model
منابع مشابه
ارائه الگوریتم پویا برای تنظیم همروندی فرایندهای کسبوکار
Business process management systems (BPMS) are vital complex information systems to compete in the global market and to increase economic productivity. Workload balancing of resources in BPMS is one of the challenges have been long studied by researchers. Workload balancing of resources increases the system stability, improves the efficiency of the resources and enhances the quality of their pr...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملExperimental Evaluation of the Performance of Processing Stealing Technique: A Scalable Load Balancing Technique for a Dynamic Multiprocessor System
This paper reports preliminary experimental evaluation of a Processing Elements Stealing (PE-S) technique which was targeted as efficient and scalable load balancing technique for dynamically structured multiprocessor systems. The multiprocessor system is imagined as a dynamic cluster based multiprocessor. Each cluster of the multiprocessor system is a node in symmetric multiprocessor architect...
متن کاملGeneralized Performance Model for Flexible Approximate String Matching on a Distributed System
This paper proposes a generalized and practical parallel algorithm for flexible approximate string matching which is executed for several kinds of clusters such as homogeneous cluster and heterogeneous cluster. This parallel algorithm is based on the master worker paradigm and it implements different partitioning schemes such as static and dynamic load balancing cooperating with different data ...
متن کاملPerformance evaluation of load balancing strategies for approximate string matching application on an MPI cluster of heterogeneous workstations
In this paper, we present three parallel approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at low cost. The first method is the static master–worker with uniform distribution strategy, the second one is the dynamic master–worker with allocation of subtexts and the third one is the dynamic master–worker with allocation of t...
متن کامل