Beowulf Cluster- PXSMAlg Parallel Exact String-Matching Algorithm

Abstract: The needs and expectations of modern-day applications are changing in the sense that they not only need computing resources (processing power, memory or disk space), but also the ability to remain available to service user requests almost constantly 24 hours a day and 365 days a year. These needs and expectations of today’s applications result in challenging research and development efforts in both the areas of computer hardware and software. Parallel supercomputers have been in the mainstream of high-performance computing for the last ten years. The decline of the dedicated parallel supercomputer has been compounded by the emergence of commodity-off-the-shelf clusters of PCs and workstations. Hence, the idea of the cluster came into front with certain recent technical capabilities, particularly in the area of networking, have brought this class of machine to the vanguard as a platform to run all types of parallel and distributed applications. This literature provides all the technical details required to implement the Beowulf Cluster in order to achieve high performance as well as high availability. The literature gives an overview of the features the system provides with.

Keywords: Beowulf Cluster, Building a Beowulf Cluster, Pattern Matching, Handling Node Border Issues