A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors

Autor: Alix Munier Kordon, Ning Tang

Publikováno v: RAIRO - Operations Research. 56:3777-3788

This paper considers the minimization of the maximum lateness for a set of dependent tasks with unit duration, unit communication delays release times and due dates. The number of processors is limited, and each task requires one processor for its ex

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7cbddd4dd73dd837f2bb36943096609e
https://doi.org/10.1051/ro/2022174

Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors

Autor: Claire Hanen, Alix Munier Kordon, Theo Pedersen

Publikováno v: Integration of Constraint Programming, Artificial Intelligence, and Operations Research
CPAIOR 2021: Integration of Constraint Programming, Artificial Intelligence, and Operations Research
CPAIOR 2021: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Jul 2021, Vienne, Austria. pp.214-230, ⟨10.1007/978-3-030-78230-6_14⟩
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030782290
CPAIOR

International audience; This paper proposes two deadline adjustment techniques for scheduling non preemptive tasks subject to precedence relations, release dates and deadlines on a limited number of processors. This decision problem is denoted by P|p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaae38ce10e874e0acf752160a824c69
https://hal.science/hal-03548213

The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays

Autor: Aurélien Carlier, Claire Hanen, Alix Munier Kordon

Publikováno v: Journal of Scheduling
Journal of Scheduling, 2017, pp.1-9. ⟨10.1007/s10951-016-0507-8⟩
BASE-Bielefeld Academic Search Engine
Journal of Scheduling, Springer Verlag, 2017, pp.1-9. ⟨10.1007/s10951-016-0507-8⟩

International audience; We consider a finite set of unit time execution tasks with release dates, due dates and precedence delays. The machines are partitionned into k classes. Each task requires one machine from a fixed class to be executed. The pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcf942368bf97a44033bd0a262f081de
https://doi.org/10.1007/s10951-016-0507-8

Scheduling on Two Unbounded Resources with Communication Costs

Autor: Alix Munier Kordon, Massinissa Ait Aba, Guillaume Pallez

Publikováno v: Euro-Par-European Conference on Parallel Processing
Euro-Par-European Conference on Parallel Processing, Aug 2019, Gottingen, Germany
Lecture Notes in Computer Science ISBN: 9783030293994
Euro-Par

International audience; Heterogeneous computing systems are popular and powerful platforms, containing several heterogeneous computing elements (e.g. CPU+GPU). In this work, we consider a platform with two types of machines , each containing an unbou

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

Relaxed Subgraph Execution Model for the Throughput Evaluation of IBSDF Graphs

Autor: Alix Munier-Kordon, Jean-Francois Nezan, Hamza Deroui, Karol Desnos

Publikováno v: International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS)
International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS), Jul 2017, SAMOS, Greece. ⟨10.1109/SAMOS.2017.8344630⟩
SAMOS

International audience; The Interface-Based Synchronous Dataflow (IBSDF) Model of Computation (MoC) is a hierarchical extension of the well-known Synchronous Dataflow (SDF) MoC. The IBSDF model extends the semantics of the SDF model by introducing a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b2e76a6aac93aede90f469bfa6f693d
https://hal.archives-ouvertes.fr/hal-01569593/file/32_Final_Paper.pdf