A Novel Critical-Path Based Scheduling Algorithm for Stochastic Workflow in Distributed Computing Systems

Author(s):  
Alemeh Matani ◽  
Asghar Darvishy
2016 ◽  
Vol 5 (4) ◽  
pp. 77-95 ◽  
Author(s):  
Harendra Kumar ◽  
Nutan Kumari Chauhan ◽  
Pradeep Kumar Yadav

Distributed computing systems [DCS] offer the potential for allocating a number of tasks to different processors for execution. It is desired to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution in order to make the best use of the computational power available. This paper proposes a new mathematical model for allocating the tasks of distributed program to multiple processors in order to achieve optimal cost and optimal reliability of the system. Phase-wise execution cost, residence cost of each task on different processors, inter task communication cost and relocation cost for each task have been considered as a fuzzy number which is more realistic and general in nature. The fuzzy problem has been transformed into crisp one by using the defuzzification method. The present algorithm is formulated and applied to numerical examples to demonstrate its effectiveness. The present model is suitable for arbitrary number of phases and processors with random program structure.


Sign in / Sign up

Export Citation Format

Share Document