Dynamic load distribution using anti-tasks and load state vectors

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 travelling paths, are spontaneously directed towards processing nodes having high transient workload, thus allowing their surplus work-load to be relocated quickly.