AN UNFAIR SEMI-GREEDY REAL-TIME MULTIPROCESSOR SCHEDULING ALGORITHM.
Optimal real-time multiprocessor scheduling algorithms always achieve higher processor utilization that is equal to the number of processors in the system. However, optimality always comes at the expense of scheduling overheads in terms of task preemptions and migrations which highly affect the p...
Saved in:
| Main Author: | ALHUSSIAN, HITHAM SEDDIG ALHASSAN |
|---|---|
| Format: | Thesis |
| Language: | English |
| Institution: | Universiti Teknologi Petronas |
| Record Id / ISBN-0: | utp-utpedia.21303 / |
| Published: |
2014
|
| Subjects: | |
| Online Access: |
http://utpedia.utp.edu.my/21303/1/2014%20-COMPUTER%20%26%20INFORMATION%20SCIENCES%20-%20AN%20UNFAIR%20SEMI-GREEDY%20REAL-TIME%20MULTIPROCESSOR%20SCHEDULING%20ALGORITHM%20-%20HITHAM%20SEDDIG%20ALHASSAN%20ALHUSSIN.pdf http://utpedia.utp.edu.my/21303/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An unfair semi-greedy real-time multiprocessor scheduling algorithm
by: Alhussian, H., et al.
Published: (2016) -
A semi greedy soft real-time multiprocessor scheduling algorithm
by: Alhussian, H., et al.
Published: (2014) -
Performance evaluation of real-time multiprocessor scheduling algorithms
by: Alhussian, H., et al.
Published: (2016) -
A modified LRE-TL real-time multiprocessor scheduling algorithm
by: Alhussian, H., et al.
Published: (2014) -
An efficient zero-laxity based real-time multiprocessor scheduling algorithm
by: Alhussian, H., et al.
Published: (2015)