A comparative study of two algorithms of multi - processor scheduling

Abstract

This study tackles the processes scheduling problem of multiprocessor and describing two algorithms from many algorithms for an array of dependent processes, which are represented by, direct a cj'clic Graph on different forms correlation among the processes and tries to determine the duration each process would last on an arbitrary . figured out parameter, and to single out those processes for multiprocessor that purpose from the scheduling algorithm were carried out to get the best scheduling. It appears from the comparison between two algorithms, first that "highest level first with estimated times scheduling algorithm", second that "smallest co-levels first with estimated time scheduling algorithm " has an effect on the schedule length(finish time). It has also been found out that shifting implementation time for each process while holding the correlation constant or, alternatively, shifting the correlation among processes and maintaining the selfsame time of duration has impact on schedule length. Moreover, it appeared that an increase in the number of dedicated processors that execute processes will also affect the lengthening of scheduling. Accordingly, length of scheduling is considered a. significant parameter in the design of algorithms for multiprocessor scheduling.

Keywords

• top level scheduling algorithm
• down level scheduling algorithm