Scheduling Model in Global Real-Time High Performance Computing with Network Calculus

We first put forward abstractive model of global scheduling pattern from the global scheduling pattern. Under the framework of the abstractive pattern, we can use a rate-latency server into the QoS parameters, although it can not be the optimal scheduling algorithms in the special schedulers, but for the global scale. It can be easy to get the delay bounds of end-to-end in the uncertain surroundings using some definitions and theories of network calculus.

[1]  Klara Nahrstedt,et al.  A resource broker model with integrated reservation scheme , 2000, 2000 IEEE International Conference on Multimedia and Expo. ICME2000. Proceedings. Latest Advances in the Fast Changing World of Multimedia (Cat. No.00TH8532).

[2]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[3]  J. Le Boudec Some properties of variable length packet shapers , 2001, SIGMETRICS '01.

[4]  Jean-Yves Le Boudec Some properties of variable length packet shapers , 2001, SIGMETRICS/Performance.

[5]  Goutham Garimella Advance CPU Reservations With The Dynamic Soft Real-Time Scheduler , 1999 .

[6]  Warren Smith,et al.  Scheduling with advanced reservations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[7]  Victor Fay Wolfe,et al.  Patterns in Global Dynamic Middleware Scheduling and Binding , 2001 .

[8]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  Klara Nahrstedt,et al.  A Soft Real Time Scheduling Server in UNIX Operating System , 1997, IDMS.