arrow
Return

Latency based group discovery algorithm for network aware cloud scheduling

delete2014-02-01
delete16
PRE
AI
S
Sheheryar Malik *
D
Denis Caromel
DOI:10.1016/j.future.2013.09.004delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Cloud computing is a big paradigm shift of computing mechanism. It provides high scalability and elasticity with a range of on-demand services. We can execute a variety of distributed applications on cloud's virtual machines (computing nodes). In a distributed application, virtual machine nodes need to communicate and coordinate with each other. This type of coordination requires that the inter-node latency should be minimal to improve the performance. But in the case of nodes belonging to different clusters of the same cloud or in a multi-cloud environment, there can be a problem of higher network latency. So it becomes more difficult to decide, which node(s) to choose for the distributed application execution, to keep inter-node latency at minimum. In this paper, we propose a solution for this problem. We propose a model for the grouping of nodes with respect to network latency.The application scheduling is done on the basis of network latency. This model is a part of our proposed Cloud Scheduler module, which helps the scheduler in scheduling decisions on the basis of different criteria. Network latency and resultant node grouping on the basis of this latency is one of those criteria. The main essence of the paper is that our proposed latency grouping algorithm not only has no additional network traffic overheads for algorithm computation but also works well with incomplete latency information and performs intelligent grouping on the basis of latency. This paper addresses an important problem in cloud computing, which is locating communicating virtual machines for minimum latency between them and group them with respect to inter-node latency. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Cloud scheduling
Latency grouping
Group partitioning
Network measurement
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
Papers:
6.9K
Citations:
2.3W

Organization

No organization information available
Cited Papers

Cited Papers

Chemical lead optimization of a pan Gq mAChR M1, M3, M5 positive allosteric modulator (PAM) lead. Part I: Development of the first highly selective M5 PAM
err2010-01-01
err0
errOAAI
errThomas M. Bridges; J. Phillip Kennedy; Hyekyung P. Cho; Micah L. Breininger; Patrick R. Gentry; Corey R. Hopkins; P. Jeffrey Conn; Craig W. Lindsley
errShare
errSave
Palladium and Molybdenum Complexes of the Heteroleptic Organostannylene [2,6-(Me2NCH2)2C6H3]SnCl
err2009-07-24
err0
PREAI
errJana Martincová; Roman Jambor; Markus Schürmann; Klaus Jurkschat; Jan Honzíček; Filipe A. Almeida Paz
errShare
errSave
The emergence of Pneumocystis carinii pneumonia in renal transplant patients in a south Indian hospital
err1995-05-01
err0
PREAI
errAnand Date; Hemalatha Krishnaswami; George T. John; Elizabeth Mathai; Chakko K. Jacob; J.C.M. Shastry
errShare
errSave
errShare
errSave
Window Flight Traps for Insects
err2012-05-31
err0
PREAI
errJohn A. Chapman; James M. Kinghorn
errShare
errSave
researcher View more