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. © Springer-Verlag 2004.
CITATION STYLE
Hou, Y., Zhang, S., & Zhong, Y. (2004). Scheduling model in global real-time high performance computing with network calculus. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 195–198. https://doi.org/10.1007/978-3-540-24680-0_32
Mendeley helps you to discover research relevant for your work.