An efficient zero-laxity based real-time multiprocessor scheduling algorithm
In this paper, we present an efficient global real- time multiprocessor scheduling algorithm based on the beneficial Zero-Laxity policy. The algorithm selects tasks for execution based on their execution requirements. Tasks with largest execution requirements are always scheduled first; however when...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2015
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961730771&doi=10.1109%2fICITCS.2015.7292943&partnerID=40&md5=227aeba6ce7cf029acb1258acc2f4904 http://eprints.utp.edu.my/31636/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Petronas |
| Summary: | In this paper, we present an efficient global real- time multiprocessor scheduling algorithm based on the beneficial Zero-Laxity policy. The algorithm selects tasks for execution based on their execution requirements. Tasks with largest execution requirements are always scheduled first; however when a task reaches zero laxity it is given the highest priority and executed until completion. The simulation showed that the proposed algorithm misses few deadlines and achieves high schedulability levels compared to currently existing zero laxity based algorithms. © 2015 IEEE. |
|---|