A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Efficient scheduling of tasks for an application is considered a crucial aspect in distributed systems to achieve a superior performance. This paper presents a task scheduling algorithm base on the Ant Colony Optimization (BTS-ACO). This algorithmdepends on an initial bound on each processor to control the procedure of task allocation. Herein, the priority of tasks is to processor with the minimal load. The algorithm investigates the effect of scheduling sorted (SLoT) and random (RLoT) list ofdoi:10.5121/ijcsit.2013.5313 fatcat:5bxsw45lgnfq7cdbmt7hqkztem