The scheduling of arbitrarily divisible hundreds on a distributed system is studied by Divisible Load Theory (DLT). DLT has theunderlying assumption that the processors will not cheat. In the $64000 world, this assumption is unrealistic as the processors are ownedand operated by autonomous rational organizations that don't have any a priori motivation for cooperation. Consequently, they will manipulatethe algorithms if it edges them to try to to so. In this work, we have a tendency to propose strategyproof mechanisms for scheduling divisible loads on threetypes of bus-connected distributed systems. These mechanisms offer incentives to the processors to obey the prescribedalgorithms and to honestly report their parameters, leading to an economical load allocation and execution.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here