Scheduling model in global real-time high performance computing with network calculus

Yafei Hou; Shiyong Zhang; Yiping Zhong

Scheduling model in global real-time high performance computing with network calculus

Yafei Hou, Shiyong Zhang, Yiping Zhong

Research output: Contribution to journal › Article

Abstract

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.

Original language	English
Pages (from-to)	195-198
Number of pages	4
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3033
Publication status	Published - Dec 1 2004
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

Fingerprint Dive into the research topics of 'Scheduling model in global real-time high performance computing with network calculus'. Together they form a unique fingerprint.

Cite this

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.

@article{fe5b9273b23d4746b75c8ffae3e76d91,

title = "Scheduling model in global real-time high performance computing with network calculus",

abstract = "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.",

author = "Yafei Hou and Shiyong Zhang and Yiping Zhong",

year = "2004",

month = dec,

day = "1",

language = "English",

volume = "3033",

pages = "195--198",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Scheduling model in global real-time high performance computing with network calculus

AU - Hou, Yafei

AU - Zhang, Shiyong

AU - Zhong, Yiping

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35048838043&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048838043&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048838043

VL - 3033

SP - 195

EP - 198

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -