Scheduling with unit processing and communication times on a ring network: Approximation results - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1996

Scheduling with unit processing and communication times on a ring network: Approximation results

Résumé

We consider the problem of scheduling UET-UCT task graphs on a ring network of m processors, in order to minimize the makespan. We show that no polynomial-time algorithm with relative performance better than 4/3 can exist in that case (unless P=NP), and prove that the relative performance g of the general list scheduling algorithm proposed by Rayward-Smith is such that [radicm]leg lap-1 + 3/8m -1/2m, for m even.

Dates et versions

Identifiants

Citer

Chams Lahlou. Scheduling with unit processing and communication times on a ring network: Approximation results. Second International Euro-Par Conference, Aug 1996, Lyon, France. pp.539-542, ⟨10.1007/BFb0024746⟩. ⟨hal-00365913⟩
41 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More