6 Result(s)
within
English
Computer Science
Algorithm Analysis and Problem Complexity
Fatos Xhafa
Chapter
Conference Paper
-
Chapter and Conference Paper
Secure and Task Abortion Aware GA-Based Hybrid Metaheuristics for Grid Scheduling
In traditional distributed computing the users and owners of the computational resources usually belong to the same administrative domain. Therefore security and reliability of the resources are not concerned ...
-
Chapter and Conference Paper
A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In this paper we present a hybr...
-
Chapter and Conference Paper
A Compendium of Heuristic Methods for Scheduling in Computational Grids
Scheduling in large scale distributed computing environments such as Computational Grids, is currently receiving a considerable attention of researchers. Despite that scheduling in such systems has much in com...
-
Chapter and Conference Paper
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition
In this paper we present two parallel skeletons for Tabu Search method -a meta-heuristic for solving combinatorial optimization problems. Our parallel skeletons are designed and implemented from the generic pa...
-
Chapter and Conference Paper
Approximating scheduling problems in parallel
We show how to approximate in NC the problem of Scheduling Unrelated Parallel Machines, for a fixed number of machines. We develop a (2 + ε)-approximate parallel algorithm for the problem. Our approach shows h...
-
Chapter and Conference Paper
On parallel versus sequential approximation
Here we deal with the class NCX of optimization problems that arc approximable within constant ratio in NC. We first introduce a new kind of reduction that preserves the relative error of the approximate solut...
