A fast, effective scheduling framework for parallel computing systems

TL;DRAbstract

We would like fast, effective schedulers to be available for all classes of concurrent applications and parallel computer architectures. Task assignment and scheduling for arbitrarily large multicomputers cannot be performed efficiently with a single, sequential scheduler. Also, dynamic applications for parallel systems cannot be scheduled optimally under reasonable assumptions. Therefore, efficient schedulers for such applications must be distributed and use heuristics. Building schedulers for parallel systems involves addressing two problems simultaneously--(1) developing efficient and effective heuristics while (2) allowing for various scheduler to machine mappings. We present a framework for the construction of highly flexible parallel, real-time schedulers. The framework's flexibility is demonstrated by mapping it to both a multiprocessor and a multi-computer architecture. Flexibility is further displayed by using different message passing and process migration facilities with eac

Chat with Paper

AI Agents for this Paper