Double auction-inspired meta-scheduling of parallel applications on global grids

Garg, Saurabh; Venugopal, Srikumar; Broberg, James; Buyya, Rajkumar

doi:10.1016/j.jpdc.2012.09.012

Cited by 25 publications

(10 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Neste trabalhoé proposto um modelo de simulador multicore multicluster baseado em filas. Uma metodologia de simulaçãó e aplicada a fim de O modelo do GSMSimé baseado em teoria de filas (Figura 1), que sãoúteis para a análise de sistemas, nos quais ocorrem conflitos quando diversas entidades tentam acessar simultaneamente o mesmo recurso [39] [40]. O GSMSiḿ e composto por gerenciadores, despacho da grade (GD), e despacho local (LD), administradores dos clusters.…”

Section: Proposta Simulador -Grid Schedule Management Simulatorunclassified

Algoritmos de Escalonamento Gangue com Estratégias de Migracão em um Ambiente MCMCA

Pinto

Holanda

Barroso

et al. 2018

RITA

View full text Add to dashboard Cite

Over the past decade, the fast advance of network technologies, hardware and middleware, as well as software resource sophistication has contributed to the emergence of new computational models. Consequently, there was a capacity increasing for efficient and effective use of resources distributed aiming to integrate them, in order to provide a widely distributed environment, which computational capacity could be used to solve complex computer problems. The two most challenging aspects of distributed systems are resource management and task scheduling. This work contributes to minimize such problems by (i) the use of migration techniques; (ii) implementing a multicore multicluster simulation environment with mechanisms for load balancing with the purpose of analyzing the system in different contexts; (iii) plus, the gang scheduling implementation algorithms will be analyzed through the use of metrics, in order to measure the schedulers performance in different situations. Thus, the results showed a better use of resources, implying operating costs reduction.

show abstract

Section: Proposta Simulador -Grid Schedule Management Simulatorunclassified

Algoritmos de Escalonamento Gangue com Estratégias de Migracão em um Ambiente MCMCA

Pinto

Holanda

Barroso

et al. 2018

RITA

View full text Add to dashboard Cite

show abstract

“…Choi et al [46] presented the consensusbased auction algorithm to perform decentralized task allocation, which utilizes a market-based decision strategy as the mechanism. Garg et al [47] proposed a novel metascheduler based on the double auction mechanism.…”

Section: Centralized Controlmentioning

confidence: 99%

A Survey of Task Allocation and Load Balancing in Distributed Systems

Jiang

2016

IEEE Trans. Parallel Distrib. Syst.

162

View full text Add to dashboard Cite

In past decades, significant attention has been devoted to the task allocation and load balancing in distributed systems. Although there have been some related surveys about this subject, each of which only made a very preliminary review on the state of art of one single type of distributed systems. To correlate the studies in varying types of distributed systems and make a comprehensive taxonomy on them, this survey mainly categorizes and reviews the representative studies on task allocation and load balancing according to the general characteristics of varying distributed systems. First, this survey summarizes the general characteristics of distributed systems. Based on these general characteristics, this survey reviews the studies on task allocation and load balancing with respect to the following aspects: 1) typical control models; 2) typical resource optimization methods; 3) typical methods for achieving reliability; 4) typical coordination mechanisms among heterogeneous nodes; and 5) typical models considering network structures. For each aspect, we summarize the existing studies and discuss the future research directions. Through the survey, the related studies in this area can be well understood based on how they can satisfy the general characteristics of distributed systems.

show abstract

“…Garg et al [9] proposed a double auction mechanism that involves both buyer and seller to submit their bids to the auctioneer. The auctioneer takes the help of meta scheduler to sort the bids in ascending and descending order and look for a match.…”

Section: Related Workmentioning

confidence: 99%

“…8 Alice adds 1 to Z i values for all i >I k where I k is the secret value of Alice 3. 9 Alice sends P, Z values to CSP 3. 10 CSP sends P, Z values to Bob 3.11…”

Section: The Proposed Privacy Preserving Auction Schemementioning

confidence: 99%

Privacy Preserving Auction Based Virtual Machine Instances Allocation Scheme for Cloud Computing Environment

Mohanty

Pattnaik

Mund

2017

IJECE

View full text Add to dashboard Cite

<p>Cloud Computing Environment provides computing resources in the form of Virtual Machines (VMs), to the cloud users through Internet. Auction-based VM instances allocation allows different cloud users to participate in an auction for a bundle of Virtual Machine instances where the user with the highest bid value will be selected as the winner by the auctioneer (Cloud Service Provider) to gain more. In this auction mechanism, individual bid values are revealed to the auctioneer in order to select the winner as a result of which privacy of bid values are lost. In this paper, we proposed an auction scheme to select the winner without revealing the individual bid values to the auctioneer to maintain privacy of bid values. The winner will get the access to the bundle of VM instances. This scheme relies on a set of cryptographic protocols including Oblivious Transfer (OT) protocol and Yao’s protocol to maintain privacy of bid values.</p>

show abstract

Double auction-inspired meta-scheduling of parallel applications on global grids

Cited by 25 publications

References 40 publications

Algoritmos de Escalonamento Gangue com Estratégias de Migracão em um Ambiente MCMCA

Algoritmos de Escalonamento Gangue com Estratégias de Migracão em um Ambiente MCMCA

A Survey of Task Allocation and Load Balancing in Distributed Systems

Privacy Preserving Auction Based Virtual Machine Instances Allocation Scheme for Cloud Computing Environment

Contact Info

Product

Resources

About