Sciweavers

517 search results - page 30 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
HCW
1999
IEEE
15 years 2 months ago
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
Ammar H. Alhusaini, Viktor K. Prasanna, Cauligi S....
IFIP
2003
Springer
15 years 3 months ago
Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...
Gil Zussman, Uri Yechiali, Adrian Segall
LATIN
2010
Springer
14 years 12 months ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
STACS
2009
Springer
15 years 4 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
15 years 3 months ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang