Schedule length performance ratios for decentralized load balancing algorithms

• John G. Vaughan ^[1]
  1. [1] University College
• Localización: Mini and Microcomputers and their applications / Emilio Luque Fadón (ed. lit.), 1988, págs. 522-525
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • An aproximation algorithm is described which is suitable for decentralized load balancing in computer networks. It is intended that the algorithm should operate with the support of a suitable cooperation protocol. The algorithm is evaluated principally in relation to the schedule length criterionn. Worst-case bounds on achievable schedule length ratios are derived.