Bevin Thomas’s research while affiliated with University of Bridgeport and other places

In this paper we investigate on a special type of job scheduler for distributed heterogeneous systems called the switch and feedback job scheduler. The main objective of the centralized job scheduler is to achieve maximum performance with reduced waiting time and faster response time for independent tasks by reordering the processor queue list based on the feedback received from each individual local processing system.

In this paper we investigate Chandy-Misra-Bryant Null message algorithm and propose a grouping technique to improve the performance. This technique along with status retrieval which will be explained in detail can improve the performance when compared to the traditional conservative algorithm by Chandy-Misra-Bryant. Null message algorithm is an efficient conservative algorithm that uses null messages to provide synchronization between logical processes in a parallel discrete event simulation (PDES) system. The performance can be decreased if a large number of null messages are generated by LPs to avoid deadlock. The main objective of this research work is to propose a new grouping technique that can be used to reduce the Null messages between the logical processes. Since the performance of Null Message algorithm mainly depends on the Lookahead (L) values, our proposed technique can be used to determine an optimum value of the Lookahead.