Dynamic load distribution using anti-tasks and load state vectors

S. M. Lau; Qin Lu; K. S. Leung

Dynamic load distribution using anti-tasks and load state vectors

S. M. Lau, Qin Lu, K. S. Leung

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

1 Citation (Scopus)

Abstract

We propose a new load distribution (LD) algorithm which is based on anti-tasks and load state vectors. Anti-tasks are composite agents which travel around a distributed system to facilitate the pairing up of task senders and receivers, as well as the collection and dissemination of load information. Time-stamped load information of processing nodes is stored in load state vectors which, when used together with anti-tasks, encourage mutual sharing of load information among processing nodes. Anti-tasks, which make use of load state vectors to decide their traveling paths, are spontaneously directed towards processing nodes having high transient workload, thus allowing their surplus workload to be relocated quickly.

Original language	English
Title of host publication	Proceedings - International Conference on Distributed Computing Systems
Publisher	IEEE
Pages	212-221
Number of pages	10
Publication status	Published - 1 Jan 1998
Externally published	Yes
Event	Proceedings of the 1998 18th International Conference on Distributed Computing Systems - Amsterdam, Netherlands Duration: 26 May 1998 → 29 May 1998

Conference

Conference	Proceedings of the 1998 18th International Conference on Distributed Computing Systems
Country/Territory	Netherlands
City	Amsterdam
Period	26/05/98 → 29/05/98

ASJC Scopus subject areas

Hardware and Architecture

Cite this

@inproceedings{7e183a1f2af046f89f6d2eccd9f2518c,

title = "Dynamic load distribution using anti-tasks and load state vectors",

abstract = "We propose a new load distribution (LD) algorithm which is based on anti-tasks and load state vectors. Anti-tasks are composite agents which travel around a distributed system to facilitate the pairing up of task senders and receivers, as well as the collection and dissemination of load information. Time-stamped load information of processing nodes is stored in load state vectors which, when used together with anti-tasks, encourage mutual sharing of load information among processing nodes. Anti-tasks, which make use of load state vectors to decide their traveling paths, are spontaneously directed towards processing nodes having high transient workload, thus allowing their surplus workload to be relocated quickly.",

author = "Lau, {S. M.} and Qin Lu and Leung, {K. S.}",

year = "1998",

month = jan,

day = "1",

language = "English",

pages = "212--221",

booktitle = "Proceedings - International Conference on Distributed Computing Systems",

publisher = "IEEE",

address = "United States",

note = "Proceedings of the 1998 18th International Conference on Distributed Computing Systems ; Conference date: 26-05-1998 Through 29-05-1998",

}

TY - GEN

T1 - Dynamic load distribution using anti-tasks and load state vectors

AU - Lau, S. M.

AU - Lu, Qin

AU - Leung, K. S.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - We propose a new load distribution (LD) algorithm which is based on anti-tasks and load state vectors. Anti-tasks are composite agents which travel around a distributed system to facilitate the pairing up of task senders and receivers, as well as the collection and dissemination of load information. Time-stamped load information of processing nodes is stored in load state vectors which, when used together with anti-tasks, encourage mutual sharing of load information among processing nodes. Anti-tasks, which make use of load state vectors to decide their traveling paths, are spontaneously directed towards processing nodes having high transient workload, thus allowing their surplus workload to be relocated quickly.

AB - We propose a new load distribution (LD) algorithm which is based on anti-tasks and load state vectors. Anti-tasks are composite agents which travel around a distributed system to facilitate the pairing up of task senders and receivers, as well as the collection and dissemination of load information. Time-stamped load information of processing nodes is stored in load state vectors which, when used together with anti-tasks, encourage mutual sharing of load information among processing nodes. Anti-tasks, which make use of load state vectors to decide their traveling paths, are spontaneously directed towards processing nodes having high transient workload, thus allowing their surplus workload to be relocated quickly.

UR - http://www.scopus.com/inward/record.url?scp=0031636773&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SP - 212

EP - 221

BT - Proceedings - International Conference on Distributed Computing Systems

PB - IEEE

T2 - Proceedings of the 1998 18th International Conference on Distributed Computing Systems

Y2 - 26 May 1998 through 29 May 1998

ER -

Dynamic load distribution using anti-tasks and load state vectors

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this