Uniform Job Scheduling Model for Distributed Processing Environment with Distributed Storage
| Authors | |
|---|---|
| Year of publication | 2004 |
| MU Faculty or unit | |
| Citation | |
| Description | In this report, we describe components, algorithms and mathematical details for the scheduling jobs with respect to distributed both computing capacity and storage capacity. The work was designed for distributed video processing in Grid environments described in [5]. The video processing features important advantage of having almost exactly uniform job size and thus the scheduling algorithm may belong to PO class under certain assumptions discussed here. Furthermore we provide in-depth discussion of requirements on network traficc prediction services that need to be used to optimize data location with respect to available processing capacity and vice versa. |