Distributed image processing scheduling in heterogeneous computing network systems

A decretive concern in distributed computing systems is to efficiently schedule the tasks among all processors so that the overall processing time of the submitted tasks is at a minimum. In this article, following the recently evolved paradigm, referred to as divisible load theory (DLT), we conducted an experimental study on the time performance to process a large volume of image data on a network of workstations. We present our program model and timing mechanism for the distributed image processing and finally display effects of δ parameter and test cases in our mentioned algorithm.