Skip to content
Research Article Open access CC BY 4.0

Empirical Performance Analysis of Parallel Programs on Wired and Wireless Local Area Networks Using Beowulf Clusters

C. I. Saidu, A. A. Obiniyi, S. B. Junaidu, Y. J. Gambo

Journal of Advances in Mathematics and Computer Science · pp. 1–15 · Published 21 Nov 2015

10.9734/BJMCS/2016/21744

Abstract

The basic idea about parallel computing is about putting independent processing units together to collectively solve a task. However, the amount of speedup attained by this collection of processing units is a function of several factors, one of which is the interconnection network. This paper focuses on measuring performance of parallel programs deployed on wired and wireless networks. Our experiments were conducted on Beowulf clusters; a parallel computer built using a collection of everyday personal computers. This paper shows empirically that distributed memory parallel programs (MPI) written for Beowulf clusters on wireless LAN (IEEE 802.11 g) do not gain appreciable speedup as the number of processing nodes increases compared to the same parallel programs written for the same Beowulf clusters but on wired LAN. It further shows the impact the kind of network has in the overall performances of parallel programs when a multiprogramming approach is used to achieve speedup.

MPI Beowulf parallel programming processing units or processing nodes wired network wireless network.

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

11

Page views

0

PDF downloads

1

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.