ACURDION: An adaptive clustering-based algorithm for tracing large-scale MPI applications

Managing the Execution of Large Scale MPI Applications on Computational Grids

17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05) ◽

10.1109/cahpc.2005.30 ◽

2006 ◽

Cited By ~ 4

Author(s):

A. de P. Nascimento ◽

A. da C. Sena ◽

J.A. Da Silva ◽

D.Q.C. Vianna ◽

C. Boeres ◽

...

Keyword(s):

Large Scale ◽

Computational Grids ◽

Mpi Applications

Download Full-text

Distributed energy efficient adaptive clustering protocol with data gathering for large scale wireless sensor networks

2015 12th International Symposium on Programming and Systems (ISPS) ◽

10.1109/isps.2015.7244966 ◽

2015 ◽

Cited By ~ 6

Author(s):

Chirihane Gherbi ◽

Zibouda Aliouat ◽

Mohammed Benmohammed

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Energy Efficient ◽

Large Scale ◽

Data Gathering ◽

Wireless Sensor ◽

Distributed Energy ◽

Adaptive Clustering ◽

Clustering Protocol

Download Full-text

PMaC's green queue: a framework for selecting energy optimal DVFS configurations in large scale MPI applications

Concurrency and Computation Practice and Experience ◽

10.1002/cpe.3184 ◽

2013 ◽

Vol 28 (2) ◽

pp. 211-231 ◽

Cited By ~ 10

Author(s):

Joshua Peraza ◽

Ananta Tiwari ◽

Michael Laurenzano ◽

Laura Carrington ◽

Allan Snavely

Keyword(s):

Large Scale ◽

Mpi Applications

Download Full-text

Contention-free Routing for Shift-based Communication in MPI Applications on Large-scale Infiniband Clusters

10.2172/967277 ◽

2009 ◽

Cited By ~ 2

Author(s):

A. Moody

Keyword(s):

Large Scale ◽

Infiniband Clusters ◽

Mpi Applications

Download Full-text

WACHM: Weight based adaptive clustering for large scale heterogeneous MANET

2007 International Symposium on Communications and Information Technologies ◽

10.1109/iscit.2007.4392150 ◽

2007 ◽

Cited By ~ 5

Author(s):

Yi Wang ◽

Hairong Chen ◽

Xinyu Yang ◽

Deyun Zhang

Keyword(s):

Large Scale ◽

Adaptive Clustering

Download Full-text

Solving Large-Scale TSP Using Adaptive Clustering Method

2009 Second International Symposium on Computational Intelligence and Design ◽

10.1109/iscid.2009.19 ◽

2009 ◽

Cited By ~ 4

Author(s):

Jin-Qiu Yang ◽

Jian-Gang Yang ◽

Gen-Lang Chen

Keyword(s):

Large Scale ◽

Clustering Method ◽

Adaptive Clustering

Download Full-text

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

International Journal of Business Data Communications and Networking ◽

10.4018/ijbdcn.2015070101 ◽

2015 ◽

Vol 11 (2) ◽

pp. 1-21 ◽

Cited By ~ 3

Author(s):

Wassim Jerbi ◽

Abderrahmen Guermazi ◽

Hafedh Trabelsi

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Protocol ◽

Large Scale ◽

Cluster Head ◽

Low Energy ◽

Sensor Nodes ◽

Wireless Sensor ◽

Basic Algorithm ◽

Adaptive Clustering

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.

Download Full-text