A Dynamic Scheduling Algorithm to Maximize the Total Value of Real-time Tasks running on a Single Processor
The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 6, pp. 1678-1685, Jun. 1999
10.3745/KIPSTE.1999.6.6.1678, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
K. I. Soo, L. Y. Yeol, L. C. Hee, J. G. Hyun, C. K. Hee, "A Dynamic Scheduling Algorithm to Maximize the Total Value of Real-time Tasks running on a Single Processor," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 6, pp. 1678-1685, 1999. DOI: 10.3745/KIPSTE.1999.6.6.1678.
[ACM Style]
Kim In Soo, Lee Yun Yeol, Lee Chun Hee, Jung Gi Hyun, and Choi Kyung Hee. 1999. A Dynamic Scheduling Algorithm to Maximize the Total Value of Real-time Tasks running on a Single Processor. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 6, (1999), 1678-1685. DOI: 10.3745/KIPSTE.1999.6.6.1678.