Optimizing the Energy Efficiency of Message Exchanging for Service Distribution in Interoperable Infrastructures

Optimizing the competence of message exchanging algorithm in large-scale grids and inter-clouds could be proven to be a crucial factor in achieving an efficient resource management. Traditional solutions usually incorporate either probabilistic or flooding message exchanging techniques mainly due to the dynamic and unpredictable formation of the infrastructure. Our vision encompasses a total decentralized nodes topology in which message exchanging algorithm allows dissemination of communication messages within a decoupled node formation setting. We consider various e-infrastructure nodes that exchange simple messages with linking nodes regarding resource competence for executing certain service(s) requirements. The optimization criterion is to improve the energy efficiency of the network performance for message exchanging in two cases as follows. Firstly, a requester sends messages to all interconnected nodes and gets messages only from resources available to execute it. Secondly, the requester sends one message for all of the jobs of its local pool and gets a respond from available nodes, and then obtainable resources are ranked and hierarchically categorized based on the performance criterion e.g. latency competency. The algorithm is simulated and results obtained are very supportive.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Fatos Xhafa,et al.  From Meta-computing to Interoperable Infrastructures: A Review of Meta-schedulers for HPC, Grid and Cloud , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[3]  Nik Bessis,et al.  Decentralized meta-brokers for inter-cloud: Modeling brokering coordinators for interoperable resource management , 2012, 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery.

[4]  Robert A. van de Geijn,et al.  Collective communication on architectures that support simultaneous communication over multiple links , 2006, PPoPP '06.

[5]  Karl N. Levitt,et al.  DEMEM: Distributed Evidence-Driven Message Exchange Intrusion Detection Model for MANET , 2006, RAID.

[6]  Nik Bessis,et al.  Advancing Inter-cloud Resource Discovery Based on Past Service Experiences of Transient Resource Clustering , 2012, 2012 Third International Conference on Emerging Intelligent Data and Web Technologies.

[7]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[8]  Emmanuel Jeannot,et al.  Total Exchange Performance Prediction on Grid Environments , 2007, CoreGRID.

[9]  Valentin Cristea,et al.  Modelling Requirements for Enabling Meta-scheduling in Inter-Clouds and Inter-Enterprises , 2011, 2011 Third International Conference on Intelligent Networking and Collaborative Systems.

[10]  Kees Verstoep,et al.  Network performance-aware collective communication for clustered wide-area systems , 2001, Parallel Comput..

[11]  Fatos Xhafa,et al.  Meta-scheduling issues in interoperable HPCs, grids and clouds , 2012, Int. J. Web Grid Serv..

[12]  Sathish S. Vadhiyar,et al.  An efficient MPI_allgather for grids , 2007, HPDC '07.