Multi-criterion tabu programming for pareto-optimal task assignment in distributed computer systems

Authors:
Jerzy Balicki
Affiliations:
Naval University of Gdynia, Gdynia, Poland
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 7
Cited 0

Finding a feasible course schedule using Tabu search

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Genetic programming (videotape): the movie

Genetic programming (videotape): the movie
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
A Subpath Ejection Method for the Vehicle Routing Problem

Management Science
Tabu Search

Tabu Search
Grid resource management: state of the art and future trends

Grid resource management: state of the art and future trends
Immune systems in multi-criterion evolutionary algorithm for task assignments in distributed computer system

AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-criterion tabu programming is a new approach for a decision making support and it can be applied to determine the Pareto solutions. Similarly to rules applied in the genetic programming, tabu programming solves problems by using a general solver that is based on a tabu algorithm. In the formulated task assignment problem as a multi-criterion question, both a workload of a bottleneck computer and the cost of system are minimized; in contrast, a reliability of the distributed system is maximized. Moreover, there are constraints for the performance of the distributed systems and the probability that all tasks meet their deadlines. In addition, constraints related to memory limits and computer locations are imposed on the feasible task assignment. Finally, results of some numerical experiments have been presented.