Algorithms Scheduling with Migration Strategies for Reducing Fragmentation in Distributed Systems

Task scheduling is a problem which seeks to allocate, over time, various tasks in different resources. In this paper we consider group task scheduling on a heterogeneous multicluster system. Two types of jobs are considered, parallel and sequential (or nonparallel). To reduce fragmentation caused by the scheduler group, migration mechanisms were implemented. Moreover, the dispatchers (global and local) use distributions of jobs in order to minimize delays in the queues of tasks, as well as response time. To analyze the different situations, performance metrics were applied aiming to compare schedulers in different situations.