Bounds on Gang Scheduling Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Bounds on Gang Scheduling Algorithms

Résumé

We define the bounds of two gang service algorithms, namely time balanced and instruction balanced, using interactivity and throughput based metrics. The workload is composed of V-RAM jobs, and the architectural model chosen is LogP. We also analyze the effect of workload and space sharing strategies on the bounds found. The following results are demonstrated: when interactivity is considered, instruction balanced gang service is the best possible non-clairvoyant algorithm. When the objective is to increase throughput Instruction balanced and time balanced gang service are equivalent algorithms. In this case the preemption strategy is not a determinant factor in performance
Fichier non déposé

Dates et versions

hal-01574110 , version 1 (11-08-2017)

Identifiants

  • HAL Id : hal-01574110 , version 1

Citer

Fabricio Alves Barbosa da Silva, Isaac Scherson. Bounds on Gang Scheduling Algorithms. 2nd International Conference on Parallel Computing Systems, Aug 1999, Ensenada, Mexico. ⟨hal-01574110⟩
195 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More