A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds

Commercial distributed systems such as Clouds are managed by selfish providers that strategically try to increase their revenues regardless of the utility of other providers and users. These selfish behaviors affect the efficiency of using such environments. In this paper, based on a general game theoretic truthful reverse auction mechanism, we investigate the scheduling problem of dependent tasks on distributed Cloud resources owned by selfish providers. The social cost of the game is to minimize the make span and monetary cost simultaneously. Extensive simulation experiments show that the schedules obtained are approximately Pareto optimal.