A negotiation protocol for dynamic load distribution using batch task assignments

doi:10.1006/jpdc.1998.1501

Return

A negotiation protocol for dynamic load distribution using batch task assignments

1998-12-01

PRE

秦璐 (Qin Lu)

Sau‐Ming Lau

DOI：10.1006/jpdc.1998.1501

Original

Original request for help

Save

Abstract

En 中文

A dynamic bad distribution (LD) algorithm improves the performance of a distributed system by using current system load information to relocate application tasks among processing nodes, so that workload imbalance in the system can be smoothed out. In this paper, we propose a guarantee and reservation protocol (GR protocol) which can be used by dynamic LD algorithms. In contrast to the commonly used single task assignments, GR protocol uses hatch msk assignments. meaning that multiple tasks can be selected for remote execution during each single sender-receiver negotiation session. GR protocol is used to obtain a mutual agreement between a task sender and a receiver on an appropriate task batch size. GR protocol is based on a virtual workload model which ensures coordinated even dispersements of tasks in the system. This model also avoids processor thrashing, a situation when a receiver node is flooded with excessive remotely assigned tasks and thus becomes overloaded inadvertently. (C) 1998 Academic Press.

Keywords:

dynamic load distribution

protocol design

distributed resource scheduling

performance modeling