Static vs. Dynamic List-Scheduling Performance Comparison | Zendy

Tarek Hagras | Zendy; Jan Janeček | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Static vs. Dynamic List-Scheduling Performance Comparison

Author(s) -

Tarek Hagras,

Jan Janeček

Publication year - 2003

Publication title -

acta polytechnica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.207

H-Index - 15

eISSN - 1805-2363

pISSN - 1210-2709

DOI - 10.14311/490

Subject(s) - computer science , dynamic priority scheduling , rate monotonic scheduling , fair share scheduling , two level scheduling , earliest deadline first scheduling , deadline monotonic scheduling , fixed priority pre emptive scheduling , heuristics , round robin scheduling , distributed computing , scheduling (production processes) , schedule , mathematical optimization , mathematics , operating system

The problem of efficient task scheduling is one of the most important and most difficult issues in homogeneous computing environments. Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to have heuristics to find a reasonably good schedule rather than evaluate all possible schedules. List-scheduling is generally accepted as an attractive approach, since it pairs low complexity with good results. List-scheduling algorithms schedule tasks in order of priority. This priority can be computed either statically (before scheduling) or dynamically (during scheduling). This paper presents the characteristics of the two main static and the two main dynamic list-scheduling algorithms. It also compares their performance in dealing with random generated graphs with various characteristics.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research