7653

7125

كارشناسي ارشد

معماري كامپيوتر

اصفهان: دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر

1391

ده،88ص.: مصور،جدول،نمودار

ص.ع.به فارسي و انگليسي

محمدعلي منتظري

علي فانيان

26/1/92

مهندسي برق و كامپيوتر

ID7125

به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي

Scheduling Real Time Tasks in Heterogeneous Multicore Embedded Systems Aref Karimiafshar A karimiafshar@ec iut ac ir Department of Electrical and Computer Engineering Isfahan University of Thechnology Isfahan 84156 83111 Iran Degree M Sc Language Farsi Supervisor Dr Mohammad Ali Montazeri Montazeri@cc iut ac irAbstract The wide usage of embedded systems has affected their hardware and software significantly Thedemands of new application increasing amount of processing and the growth of technology encouragesmanufacturer to more powerful and high quality processors in such systems The trend in growth of thepersonal computers toward heterogeneous processor now has affected the modern embedded systems Today s embedded systems often have more than one core per state of the art processor and arechanging to heterogeneous ones These changes began from hardware and happened so fast that causeda gap and maybe mismatching between the hardware and the operating systems that used to manage theresources on them of course the usage of HMC have had such advantages that seems it would be apopular trend in these systems in the future In this project we deal with the scheduling of periodic real time tasks on the HMC that which theexistence of deadline make the scheduling more sensitive The proposed method is a combination ofscheduling methods on non real time HMC and scheduling methods on homogeneous processor Atfirst we categorized the task sets into the groups equal to the number of cores then we assign them tothe most matched cores Now in each group a local scheduler with many well known polices can beused In this project we used Round Robin as local policy Finally when the system goes under heavyburdens some tasks can be moved from higher priority queue to lower priority queue This movementcan be done in just one direction Therefore if one of the lower queue face with the congestion wecan t move some tasks to other queues The performance of this method measured regards to thecontext switch penalty that we extract from a real processor SPARC64 VI of the SunSystem wecompare the proposed method with two other methods Pfair and extended EDF on WCETbenchmarks The results showed that on average deadlines would be satisfied with 10 percentimprovement In the other hands the system s performance had no significant changes and it takesO n to be run So regards to improvement in satisfying the deadlines and keeping the performance inan already same leverage with the same order of complexity we would have a more efficient system Key words Embedded systems realtime tasks scheduling heterogeneous multicore processor context switchpenalty

محمدعلي منتظري

علي فانيان