Výsledky vyhledávání - "Christina Robenek"

Tight approximation for scheduling parallel jobs on identical clusters

Autor: Christina Robenek, Pierre-François Dutot, Marin Bougeret, Denis Trystram, Klaus Jansen

Publikováno v: 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum
IPDPSW: International Parallel and Distributed Processing Symposim
IPDPSW: International Parallel and Distributed Processing Symposim, May 2012, Shangai, China. pp.878-885, ⟨10.1109/IPDPSW.2012.108⟩
IPDPS Workshops

International audience; We consider the Multiple Cluster Scheduling Problem (MCSP), where the objective is to schedule n parallel rigid jobs on N identical clusters, minimizing the maximum completion time (makespan). MCSP is 2-inapproximable (unless

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1308dce353fc09486e5a97e4e3cfe52f
https://hal.archives-ouvertes.fr/hal-00738499

Zobrazit plný text záznamu

Scheduling Jobs on Identical and Uniform Processors Revisited

Autor: Klaus Jansen, Christina Robenek

Publikováno v: Approximation and Online Algorithms ISBN: 9783642291159
WAOA

We study the problem of scheduling jobs on uniform processors with the objective to minimize the makespan. In scheduling theory this problem is known as Q||C max . We present an EPTAS for scheduling on uniform machines avoiding the use of an MILP or

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b56102600aa6269f49f79275a8852ce2
https://doi.org/10.1007/978-3-642-29116-6_10

Zobrazit plný text záznamu

Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms

Autor: Christina Robenek, Denis Trystram, Marin Bougeret, Pierre-François Dutot, Klaus Jansen

Publikováno v: Discrete Mathematics, Algorithms and Applications
Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2011, 3 (4), pp.553-586. ⟨10.1142/S1793830911001413⟩
Discrete Mathematics, Algorithms and Applications, 2011, 3 (4), pp.553-586. ⟨10.1142/S1793830911001413⟩

We consider two strongly related problems, multiple strip packing and scheduling parallel jobs in platforms. In the first one we are given a list of n rectangles with heights and widths bounded by one and N strips of unit width and infinite height. T

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2ebe9b3857e6375d06720f85579bcb3
https://hal.inria.fr/hal-00796859

Zobrazit plný text záznamu

Scheduling jobs on heterogeneous platforms

Autor: Pierre-François Dutot, Klaus Jansen, Denis Trystram, Marin Bougeret, Christina Robenek

Publikováno v: COCOON
COCOON, 2011, Dallas, United States
Lecture Notes in Computer Science ISBN: 9783642226847

International audience; In the context of grid scheduling we consider a scheduling scenario, where parallel jobs have to be scheduled non-preemptively on heterogeneous computational platforms of processors. The speed of the processors may differ amon

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d65963de39d545bc8baa5276573cc6f5
https://hal.archives-ouvertes.fr/hal-00738508

Zobrazit plný text záznamu

Tight Approximation for Scheduling Parallel Job on Identical Clusters

Autor: Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek

Publikováno v: HAL
RR-12001, 2012

In the grid computing paradigm, several clusters share their computing resources in order to distribute the workload. Each of the $N$ cluster is a set of $m$ identical processors (connected by a local interconnection network), and $n$ parallel jobs a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fd75814df3bd9ca517ba4a503189f634
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00656780

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání