| Abstrakt: |
Multiprocessor scheduling is another name of task scheduling in form of algorithms that are mostly utilized in systematic as well as engineering appliance that is also known as the issue of NP-complete. The main aim of scheduling is the reduction of execution time. The illustration of task scheduling for multiprocessor scheduling is shown by DAG (Directed Acyclic graph). The categorization for this is into Static as well as dynamic scheduling. The list task scheduling is the example of static task scheduling algorithm. Varied task scheduling algorithms, like ISH, HLFET, MCP, ETF, CNPT and DLS are reviewed in this paper. The comparison of list task scheduling isdependent on metrics, termed as SLR, load balancing, efficiency and speed up. [ABSTRACT FROM AUTHOR] |
