Computational grids are highly complex distributed systems (involving multiple organizations with different goals and policies) which aim at providing computing services without the users need to know the location and features of the required resources. A key issue in managing and scheduling grid resources is the coordination among multiple administrative domains. In this paper, we present a preliminary study which aims at developing auction mechanisms for decentralized scheduling which exhibit minimal communication overhead and an efficient usage of resources.

Auction Algorithms for Decentralized Parallel Machine Scheduling

ATTANASIO A;GUERRIERO, Francesca
2006

Abstract

Computational grids are highly complex distributed systems (involving multiple organizations with different goals and policies) which aim at providing computing services without the users need to know the location and features of the required resources. A key issue in managing and scheduling grid resources is the coordination among multiple administrative domains. In this paper, we present a preliminary study which aims at developing auction mechanisms for decentralized scheduling which exhibit minimal communication overhead and an efficient usage of resources.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/150535
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 34
  • ???jsp.display-item.citation.isi??? 22
social impact