A dynamic workload balancing technique of a text matching algorithm on a cluster

Authors:
Odysseas Efremides;George Ivanov
Affiliations:
University of Hertfordshire, Hatfield, UK and IST Studies and Dept. of Computer Science, Moschato, Athens, Greece;University of Hertfordshire, Hatfield, UK and IST Studies and Dept. of Computer Science, Moschato, Athens, Greece
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 6
Cited 0

Program speedup in a heterogeneous computing network

Journal of Parallel and Distributed Computing - Special issue on heterogeneous processing
In search of clusters (2nd ed.)

In search of clusters (2nd ed.)
High Performance Cluster Computing: Architectures and Systems

High Performance Cluster Computing: Architectures and Systems
Computer Networks

Computer Networks
Computer Architecture: A Quantitative Approach

Computer Architecture: A Quantitative Approach
Handbook of Exact String Matching Algorithms

Handbook of Exact String Matching Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.