Hemant Kumar Mehta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hemant Kumar Mehta has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Priyesh Kanungo
School of Computer Science and IT
7 shared publications Manohar Chandwani
Department of Computer Engineering, Institute of Engineering and Technology, Devi Ahilya University, Indore, India
5 shared publicationsEshan Gupta
Department of Computer Science and Engineering, Institute of Professional Studies College of Technology & Management, Gwalior, Madhya Pradesh, India
1 shared publicationFlavien Quesnel
1 shared publicationJean-Marc Menaud
1 shared publicationM. Chandwani
IET, Devi Ahilya University, Indore, India
1 shared publication
Latest Publications
- 3 June 2016
- Published by Springer Nature in Wireless Personal Communications
- Vol. 90 (3) , 1135-1147
A Two Level Broker System for Infrastructure as a Service Cloud
- 3 June 2016
- Published by Springer Nature in Wireless Personal Communications
- Vol. 90 (3) , 1135-1147
A Two Level Broker System for Infrastructure as a Service Cloud
- 1 July 2014
- Published by IGI Global Scientific Publishing in International Journal of Grid and High Performance Computing
- Vol. 6 (3) , 1-16
EcoGrid
This paper presents a toolkit for evaluation of resource management algorithms developed for Grid computing. This simulator named as EcoGrid and it is devised to support large number of resource or computing nodes and processes. Generally, grid simulators represent each resource using a thread that occupies large amount of space on the thread stack in main memory. However, EcoGrid models each node by an object instead of a thread. Memory space used by an object is much smaller than a thread, thus EcoGrid is highly scalable as compared to state-of-the-art simulators. EcoGrid is dynamically configurable and works with real as well as synthetic workloads. The simulator is bundled with a synthetic load generator that generates the workload using appropriate statistical distributions.
- 1 July 2014
- Published by IGI Global Scientific Publishing in International Journal of Grid and High Performance Computing
- Vol. 6 (3) , 1-16
EcoGrid
This paper presents a toolkit for evaluation of resource management algorithms developed for Grid computing. This simulator named as EcoGrid and it is devised to support large number of resource or computing nodes and processes. Generally, grid simulators represent each resource using a thread that occupies large amount of space on the thread stack in main memory. However, EcoGrid models each node by an object instead of a thread. Memory space used by an object is much smaller than a thread, thus EcoGrid is highly scalable as compared to state-of-the-art simulators. EcoGrid is dynamically configurable and works with real as well as synthetic workloads. The simulator is bundled with a synthetic load generator that generates the workload using appropriate statistical distributions.
- 1 April 2014
- Published by IGI Global Scientific Publishing in International Journal of Systems and Service-Oriented Engineering
- Vol. 4 (2) , 1-12
A Holistic Trust Management Leasing Algorithm for IaaS Cloud
Trust is an important factor, in the exchange of services among multiple parties for example in cloud environment a large number of users interact in the form of resource provider and resource consumers. The resource consumer requests for computation service from the resource provider which provide service to the resource consumer. In this paper we proposed a trust management architecture that keeps track of past performance of resource provider and resource consumer so that every time the participating entity in a transaction has idea of behavior of other entities. This architecture not relies only on trust value of a resource provider, however it also considers several other parameters viz. activeness, ratio of positive and negative feedback etc. As the trust value of a resource provider is actually the result of user's feedback which declines over time, hence we have also given chance of regret to the resource providers which were proven to be untrusted to convert their “setback to comeback”.
- 1 April 2014
- Published by IGI Global Scientific Publishing in International Journal of Systems and Service-Oriented Engineering
- Vol. 4 (2) , 1-12
A Holistic Trust Management Leasing Algorithm for IaaS Cloud
Trust is an important factor, in the exchange of services among multiple parties for example in cloud environment a large number of users interact in the form of resource provider and resource consumers. The resource consumer requests for computation service from the resource provider which provide service to the resource consumer. In this paper we proposed a trust management architecture that keeps track of past performance of resource provider and resource consumer so that every time the participating entity in a transaction has idea of behavior of other entities. This architecture not relies only on trust value of a resource provider, however it also considers several other parameters viz. activeness, ratio of positive and negative feedback etc. As the trust value of a resource provider is actually the result of user's feedback which declines over time, hence we have also given chance of regret to the resource providers which were proven to be untrusted to convert their “setback to comeback”.
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 268-275
Estimating the Power Consumption of an Idle Virtual Machine
Power management has become one of the main challenges for data center infrastructures. Currently, the cost of powering a server is approaching the cost of the server hardware itself, and, in a near future, the former will continue to increase, while the latter will go down. In this context, virtualization is used to decrease the number of servers, and increase the efficiency of the remaining ones. If virtualization can be used to positively impact on the data center energy consumption, this new abstraction layer disconnects user services (hosted on a virtual machine) from their operating cost. In this paper, we propose an approach and a model to estimate the total power consumption of a virtual machine, by taking into account its static (e.g. memory) and dynamic (e.g. CPU) consumption of resources. This model permits to reconnect each VM to its corresponding operating cost, and provides more information to virtual infrastructure providers and users to optimize their infrastructure/applications. It can be observed from results of experiments that the proposed method outperforms the methods found in the literature that only consider the dynamic consumption of resources.
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 268-275
Estimating the Power Consumption of an Idle Virtual Machine
Power management has become one of the main challenges for data center infrastructures. Currently, the cost of powering a server is approaching the cost of the server hardware itself, and, in a near future, the former will continue to increase, while the latter will go down. In this context, virtualization is used to decrease the number of servers, and increase the efficiency of the remaining ones. If virtualization can be used to positively impact on the data center energy consumption, this new abstraction layer disconnects user services (hosted on a virtual machine) from their operating cost. In this paper, we propose an approach and a model to estimate the total power consumption of a virtual machine, by taking into account its static (e.g. memory) and dynamic (e.g. CPU) consumption of resources. This model permits to reconnect each VM to its corresponding operating cost, and provides more information to virtual infrastructure providers and users to optimize their infrastructure/applications. It can be observed from results of experiments that the proposed method outperforms the methods found in the literature that only consider the dynamic consumption of resources.
- 1 April 2013
- Published by IGI Global Scientific Publishing in International Journal of Cloud Applications and Computing
- Vol. 3 (2) , 1-11
Economy Based Resource Allocation in IaaS Cloud
Infrastructure as a Service (IaaS) offers hardware resources (computing power, storage and network) as a service to its customers. The customers order these resources in the form of a lease. Aim of any service provider is to make a leasing plan to maximize the number of accepted leases. Opennebula is popular open source toolkit for building IaaS cloud. Opennebula has its own lease manager and it can also be integrated with Haizea which is an open source lease manager. An economy based algorithm should focus on incentives of both the consumers and the providers. In this paper, an economy based leasing algorithm is developed and integrated with Haizea. This economy based algorithm takes care of incentives of both the parties i.e. customer and service provider. It uses the concept of optimization techniques to optimize the costs. The incentive for customers is lower cost of execution of its lease on the capable node as compare to existing non-economy based algorithms. If an appropriate resource is not found, then the algorithm uses negotiation on budget and resource demand; that increases the number of accepted lease. Thus, incentive for providers is an increase in profit as the amount of accepted leases increase. Experimental results show that the proposed economy based leasing algorithm reduces the cost of execution of the consumer’s lease and increases the profit of the provider to a considerable extent.
- 1 April 2013
- Published by IGI Global Scientific Publishing in International Journal of Cloud Applications and Computing
- Vol. 3 (2) , 1-11
Economy Based Resource Allocation in IaaS Cloud
Infrastructure as a Service (IaaS) offers hardware resources (computing power, storage and network) as a service to its customers. The customers order these resources in the form of a lease. Aim of any service provider is to make a leasing plan to maximize the number of accepted leases. Opennebula is popular open source toolkit for building IaaS cloud. Opennebula has its own lease manager and it can also be integrated with Haizea which is an open source lease manager. An economy based algorithm should focus on incentives of both the consumers and the providers. In this paper, an economy based leasing algorithm is developed and integrated with Haizea. This economy based algorithm takes care of incentives of both the parties i.e. customer and service provider. It uses the concept of optimization techniques to optimize the costs. The incentive for customers is lower cost of execution of its lease on the capable node as compare to existing non-economy based algorithms. If an appropriate resource is not found, then the algorithm uses negotiation on budget and resource demand; that increases the number of accepted lease. Thus, incentive for providers is an increase in profit as the amount of accepted leases increase. Experimental results show that the proposed economy based leasing algorithm reduces the cost of execution of the consumer’s lease and increases the profit of the provider to a considerable extent.
- Open Access
- 28 March 2011
- Published by Association for Computing Machinery (ACM)
- p. 385-390
Performance enhancement of scheduling algorithms in clusters and grids using improved dynamic load balancing techniques
- 28 March 2011
- Published by Association for Computing Machinery (ACM)
- p. 385-390
Open AccessPerformance enhancement of scheduling algorithms in clusters and grids using improved dynamic load balancing techniques
- Open Access
- 25 March 2011
- Published by Association for Computing Machinery (ACM)
- p. 1-8
EcoGrid
In this paper, an economy-based Grid simulator named as EcoGrid is presented. EcoGrid is developed as a test-bed for Grid scheduling algorithms that are based on dynamic load balancing. EcoGrid is dynamically configurable. It optimizes the cost of execution of a process and maximizes the profit of a service provider system. As compared to other commonly used Grid simulation tools like GridSim and SimGrid, this simulator provides more enhanced features like configurable, scalable and extensible. This object oriented simulator also supports execution of Java applications. EcoGrid supports simulation of both the economy based and non-economy based scheduling algorithm.
- 25 March 2011
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessEcoGrid
In this paper, an economy-based Grid simulator named as EcoGrid is presented. EcoGrid is developed as a test-bed for Grid scheduling algorithms that are based on dynamic load balancing. EcoGrid is dynamically configurable. It optimizes the cost of execution of a process and maximizes the profit of a service provider system. As compared to other commonly used Grid simulation tools like GridSim and SimGrid, this simulator provides more enhanced features like configurable, scalable and extensible. This object oriented simulator also supports execution of Java applications. EcoGrid supports simulation of both the economy based and non-economy based scheduling algorithm.
- Open Access
- 25 February 2011
- Published by Association for Computing Machinery (ACM)
- p. 370-375
Decentralized content aware load balancing algorithm for distributed computing environments
The content-aware load balancing strategy uses the services or content requested for the scheduling of a request. This paper considers a special scenario where the application server and database server are deployed over a Distributed Computing Environment (DCE). The content aware algorithms developed till now are specially designed for the clusters computing, but this paper considers all possible DCE like cluster, grid and cloud computing. There are two types of users in a DCE, namely the service providers and consumers. Service providers provide the services to its consumers' requests. Generally the services providers offer the computing nodes for processing of the users requests. This paper proposes a new content aware load balancing policy called workload and client aware policy (WCAP). This method is a hybrid approach of client aware policy and workload aware request distribution policy discussed below. A parameter unique and special property (USP) is defined to specify the property of the service provider's computing nodes and the consumer's requests for data. This parameter specifies the unique and special property of the requests as well as computing nodes. Based on this parameter, the scheduler decides the node that is best suitable for the processing of the requests. This load balancing strategy is implemented in a decentralized manner with low overhead. Preliminary investigation proves that the proposed method is a promising content aware load balancing.
- 25 February 2011
- Published by Association for Computing Machinery (ACM)
- p. 370-375
Open AccessDecentralized content aware load balancing algorithm for distributed computing environments
The content-aware load balancing strategy uses the services or content requested for the scheduling of a request. This paper considers a special scenario where the application server and database server are deployed over a Distributed Computing Environment (DCE). The content aware algorithms developed till now are specially designed for the clusters computing, but this paper considers all possible DCE like cluster, grid and cloud computing. There are two types of users in a DCE, namely the service providers and consumers. Service providers provide the services to its consumers' requests. Generally the services providers offer the computing nodes for processing of the users requests. This paper proposes a new content aware load balancing policy called workload and client aware policy (WCAP). This method is a hybrid approach of client aware policy and workload aware request distribution policy discussed below. A parameter unique and special property (USP) is defined to specify the property of the service provider's computing nodes and the consumer's requests for data. This parameter specifies the unique and special property of the requests as well as computing nodes. Based on this parameter, the scheduler decides the node that is best suitable for the processing of the requests. This load balancing strategy is implemented in a decentralized manner with low overhead. Preliminary investigation proves that the proposed method is a promising content aware load balancing.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23776927,p. 46-50
On trust management and reliability of distributed scheduling algorithms
This paper presents a mechanism of integrating the concept of reliability with trust management policy in the distributed scheduling algorithms. This algorithm focuses on the distributed computing systems involving collaborative computing. Trust management is achieved with the concept of bidirectional reputation points that are assigned to resource providers and resource consumers. Moreover, concept of reliability is also used to ensure failsafe execution of the processes. This is a generalized mechanism that can be integrated with existing distributed scheduling algorithms used in collaborative computing environment viz. Grid computing, cloud computing, peer-to-peer computing etc. Extensive simulations were performed to test the applicability of the mechanism. Our results confirm that the proposed method significantly reduces the number of failures as compared to a distributed scheduling algorithm implemented without reliability and trust management policy.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23776927,p. 46-50
On trust management and reliability of distributed scheduling algorithms
This paper presents a mechanism of integrating the concept of reliability with trust management policy in the distributed scheduling algorithms. This algorithm focuses on the distributed computing systems involving collaborative computing. Trust management is achieved with the concept of bidirectional reputation points that are assigned to resource providers and resource consumers. Moreover, concept of reliability is also used to ensure failsafe execution of the processes. This is a generalized mechanism that can be integrated with existing distributed scheduling algorithms used in collaborative computing environment viz. Grid computing, cloud computing, peer-to-peer computing etc. Extensive simulations were performed to test the applicability of the mechanism. Our results confirm that the proposed method significantly reduces the number of failures as compared to a distributed scheduling algorithm implemented without reliability and trust management policy.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 68-71
Towards development of a distributed e-Learning ecosystem
This paper explores the possibility of application of cluster, grid and cloud computing in developing e-Learning systems. We are considering three major problems in implementation of distributed e-Learning systems: (i) a method for selection of appropriate distributed computing system (DCS) e.g. cluster, grid and cloud. (ii) To find suitable resource management policies. (iii) To propose an architecture for distributed e-Learning system.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 68-71
Towards development of a distributed e-Learning ecosystem
This paper explores the possibility of application of cluster, grid and cloud computing in developing e-Learning systems. We are considering three major problems in implementation of distributed e-Learning systems: (i) a method for selection of appropriate distributed computing system (DCS) e.g. cluster, grid and cloud. (ii) To find suitable resource management policies. (iii) To propose an architecture for distributed e-Learning system.