Paper Presentation & Seminar Topics: Strategy proof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems

Strategy proof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems

Abstract:-
The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world, this assumption is unrealistic as the processors are owned and operated by autonomous rational organizations that have no a priori motivation for cooperation. Consequently, they will manipulate the algorithms if it benefits them to do so. In this work, we propose strategy proof mechanisms for scheduling divisible loads on three types of bus-connected distributed systems. These mechanisms provide incentives to the processors to obey the prescribed algorithms and to truthfully report their parameters, leading to an efficient load allocation and execution.

Existing System:-

• Several algorithms are used in Distributed Load Theory (DLT) for scheduling but this leads to poor performance and inefficiency.

• There are no mechanisms that provide incentives to the processors to participate and to report their true processing capacities to the scheduler.








Proposed System:-

• The control processor’s role is to strictly distribute load to the load-executing processors as it does not have any load executing capabilities.

• A protocol is designed by using digital signatures that helps to identify cheating

Hardware Specification:

• Processor : Pentium Iv 2.6 Ghz
• Ram : 512 Mb Dd Ram
• Monitor : 15” Color
• Hard Disk : 20 Gb

Software Specification:

• Front End : Java, Swing
• Tools Used : JBuilder
• Operating System : WindowsXP