A scalable time-sharing scheduling for partitionable distributed memory parallel machines

We propose a new process scheduling queue system called the distributed queue tree (DQT) for a distributed memory, dynamically partitionable parallel machines. We assume that partitions can be nested dynamically and that a process in a partition can be preempted. The combination of dynamically nested partitioning and time-sharing scheduling may provide an interactive environment and higher processor utilization. The key idea of DQT is to distribute process scheduling queues to each partition. We propose a round-robin scheduling algorithm and several task allocation policies on DQT. The simulation results show that time-sharing with DQT results in better processor utilization than that available from batch scheduling in high-load situations