Abstract
The efficient scheduling algorithm is critical to achieve high performance in parallel and distributed systems. The main objective of task scheduling is to assign the tasks onto the available processors with the aim of producing minimum schedule length and without violating the precedence constraints. So we developed new algorithm called Mean Communication Node with Duplication MCND algorithm to achieve high performance task scheduling. The MCND algorithm has two phases namely, task priority and processor selection. Our algorithm takes into account the average of parents' communication costs for each task to reduce the overhead communication. The algorithm uses new task duplication algorithm. We build a simulation to compare the MCND algorithm with CPOP with duplication algorithm. The algorithms are applied on real application. From results, the MCND algorithm shows the best results
Highlights
The availability of high performance networks leads to a new platform, called as heterogeneous distributed platform
The performance of a parallel applications on Heterogeneous Distributed Computing Systems (HeDCS) critically depends on the method used to allocate the tasks partitioned from the application onto the appropriate processors in the system [1,2,3,4]
Boor task scheduling algorithm can undo any potential gains from the parallelism presented in the application, so selecting task scheduling algorithm is the important step of executing the parallel applications
Summary
The availability of high performance networks leads to a new platform, called as heterogeneous distributed platform. Examples of list-based algorithms are Heterogeneous Earliest Finish Time (HEFT) and Critical Path On Processor (CPOP) [17]. Another static scheduling category is task duplication based algorithms, in which tasks are duplicated on more than one processor to reduce the waiting time of the dependent tasks. The Developed Algorithm The Mean Communication Node with Duplication MCND algorithm is list-based scheduling algorithm It uses the main idea of HCPT algorithm with some edits and adding new duplication algorithm. It consists of two phases only, task priority and processor selection. For each task ti in TL For each processor in the processor set ( є Q) do Compute EFT( , ) value
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of Electrical Engineering and Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
