IEICE TRANSACTIONS on Information
Processor-Minimum Scheduling of Real-Time Parallel Tasks
Summary :
We propose a polynomial-time algorithm for the scheduling of real-time parallel tasks on multicore processors. The proposed algorithm always finds a feasible schedule using the minimum number of processing cores, where tasks have properties of linear speedup, flexible preemption, arbitrary deadlines and arrivals, and parallelism bound. The time complexity of the proposed algorithm is O(M3
- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.4 pp.723-726
- Publication Date
- 2009/04/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E92.D.723
- Type of Manuscript
- LETTER
- Category
- Algorithm Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wan Yeon LEE, Kyungwoo LEE, Kyong Hoon KIM, Young Woong KO, "Processor-Minimum Scheduling of Real-Time Parallel Tasks" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 4, pp. 723-726, April 2009, doi: 10.1587/transinf.E92.D.723.
Abstract: We propose a polynomial-time algorithm for the scheduling of real-time parallel tasks on multicore processors. The proposed algorithm always finds a feasible schedule using the minimum number of processing cores, where tasks have properties of linear speedup, flexible preemption, arbitrary deadlines and arrivals, and parallelism bound. The time complexity of the proposed algorithm is O(M3
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.723/_p
Copy
@ARTICLE{e92-d_4_723,
author={Wan Yeon LEE, Kyungwoo LEE, Kyong Hoon KIM, Young Woong KO, },
journal={IEICE TRANSACTIONS on Information},
title={Processor-Minimum Scheduling of Real-Time Parallel Tasks},
year={2009},
volume={E92-D},
number={4},
pages={723-726},
abstract={We propose a polynomial-time algorithm for the scheduling of real-time parallel tasks on multicore processors. The proposed algorithm always finds a feasible schedule using the minimum number of processing cores, where tasks have properties of linear speedup, flexible preemption, arbitrary deadlines and arrivals, and parallelism bound. The time complexity of the proposed algorithm is O(M3
keywords={},
doi={10.1587/transinf.E92.D.723},
ISSN={1745-1361},
month={April},}
Copy
TY - JOUR
TI - Processor-Minimum Scheduling of Real-Time Parallel Tasks
T2 - IEICE TRANSACTIONS on Information
SP - 723
EP - 726
AU - Wan Yeon LEE
AU - Kyungwoo LEE
AU - Kyong Hoon KIM
AU - Young Woong KO
PY - 2009
DO - 10.1587/transinf.E92.D.723
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2009
AB - We propose a polynomial-time algorithm for the scheduling of real-time parallel tasks on multicore processors. The proposed algorithm always finds a feasible schedule using the minimum number of processing cores, where tasks have properties of linear speedup, flexible preemption, arbitrary deadlines and arrivals, and parallelism bound. The time complexity of the proposed algorithm is O(M3
ER -
English
