A New Duplication Task Scheduling Algorithm in Heterogeneous Distributed Computing Systems
Aida A. Nasr, Nirmeen A. Wahab El-Bahnasawy, Ayman El‐Sayed Omera · Bulletin of Electrical Engineering and Informatics · 2016
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
Bulletin of Electrical Engineering and Informatics · Institute of Advanced Engineering and Science (IAES) · article · 2016
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
Open the resolved locator · 10.11591/559
Metadata licence: OpenAlex metadata (CC0)