Auction algorithms for decentralized parallel machine scheduling

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.