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

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

تعداد صفحات: ۸

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

hakem beitollahi – dependable systems laboratory iran sharif university of technology
seyed ghassem miremadi –
jafar habibi –

چکیده:

this paper presents the perfomance analysis of several best known partitioning scheduling algorithms in real -time and fault -tolerant multipocessor systems to do this multiple versions of tasks are executed on different processors.both static dynamic scheduling algorithms are analyzed in the case of static scheduling algorithms rate -monotonic RM scheduling policy is considered in the dynamics scheduling algorithms the scheduling policies are rate -monotonic and earliest deadline first EDF.partitioning scheduling algorithms which are studied here are heuristic algorithms that are formed by combining any of the bin packing algorithms with any of the schedulability conditions for the RM and EDF policies