A Reliability-Based Task Scheduling Method for Wireless Distributed Systems

Parallel computing and distributed computing are the popular terminologies of scheduling. With advancement in technology, systems have become much more compact and fast and need of parallelization plays a major role for this compaction. Wireless computing is also a common concept associated with each new development. Scheduling of tasks has always been a challenging area and is an NP-complete problem. Moreover, when it comes to wireless distributed computing, reliable scheduling plays an important role in order to complete a task in a wireless distributed system. This work proposes an algorithm to dynamically schedule tasks on heterogeneous processors within a wireless distributed computing system. A lot of heuristics, meta-heuristics & genetics have been used earlier with scheduling strategies. However, most of them haven't taken reliability into account before scheduling. Here a heuristic that deals with reliable scheduling is considered. The scheduler also works within an environment which has dynamically changing resources and adapts itself to changing system resources. The testing was carried out with up to 200 tasks being scheduled while testing in a real time wireless distributed environment. Experiments have shown that the algorithm outperforms the other strategies and can achieve a better reliability along with no increase in make-span, in spite of wireless nodes.