Uniform Job Scheduling Model for Distributed Processing Environment with Distributed Storage

HEJTMÁNEK, Lukáš a Petr HOLUB. Uniform Job Scheduling Model for Distributed Processing Environment with Distributed Storage. CESNET z.s.p.o., 2004, 13 s. Technical report 9/2004.

Základní údaje

• Originální název: Uniform Job Scheduling Model for Distributed Processing Environment with Distributed Storage
• Název anglicky: Uniform Job Scheduling Model for Distributed Processing Environment with Distributed Storage
• Autoři: HEJTMÁNEK, Lukáš a Petr HOLUB.
• Vydání: 13 s. Technical report 9/2004, 2004.
• Nakladatel: CESNET z.s.p.o.

Další údaje

• Typ výsledku: Účelové publikace
• Utajení: není předmětem státního či obchodního tajemství
• WWW: URL
• Organizační jednotka: Ústav výpočetní techniky
• Klíčová slova anglicky: scheduling; uniform tasks; PO-class scheduling algorithm; network traffic prediction service
• Štítky: network traffic prediction service, PO-class scheduling algorithm, scheduling, uniform tasks

Anotace

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.

Anotace anglicky

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.