Abstract
This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters-and task cluster scheduling on distributed processors. The performance of various scheduling schemes is studied and compared for a variety of workloads. Simulation results indicate that the scheduling policy that gives priority to the cluster with the smallest cumulative service demand of all its tasks performs better than the other policies examined.