سال انتشار: ۱۳۸۳

محل انتشار: دهمین کنفرانس سالانه انجمن کامپیوتر ایران

تعداد صفحات: ۱۲

نویسنده(ها):

k zamanifar – engineering department esfahan university
m hosseini –

چکیده:

the objective of a scheduling algorithm for given parallel program which is represented by a task graph is to minimize the execution time of the program by properly assigning the nodes of the graph to available processors of a multiprocessors system which formally refer to as the optimal schedule for this number of processors. however in a multiprocessor system where many users share the physical machine the number of available processors may not be known before the running period in this case there will be no way for scheduling algorithm to discover the number of available processors and this will cause that the scheduling algorithm become unable to dind the optimal schedule.