An Approach for Parallel Job Scheduling Using Supple Algorithm

Supple Scheduling is a Scheduling methodology for medium grain applications. The medium grain applications consist of many processes running on different Processors. A way of characterizing a parallel system is to consider the synchronization granularity or frequency of synchronization between processes in a application. A Single application can be effectively implemented as a collection of threads. In this case, the potential parallelism of an application must be explicitly specified by the Programmer. Typically, there will need to be rather a high degree of coordination and interaction among the threads of an application, leading to a medium grain-level of synchronization. The various threads of an application interact so frequently, scheduling decisions concerning one thread may affect the performance of the entire application. The Supple algorithm is fully implemented and compared the results with various other scheduling algorithms like First Come First Served, Gang Scheduling, Flexible Co scheduling. This study describes in detail the implementation of Supple and its performance evaluation with a original workload log LLNL-Thunder-2007-0.