-
Periodic scheduling of marked graphs using balanced binary words
International audience -
A fast hierarchical arbitration scheme for multi-tb/s packet switches with sh...
Corporate Alcatel-Lucent journal, Special Issue on Core and Wireless Networks -
Scheduling of coupled tasks with high multiplicity
International audience -
Identical Coupled Task Scheduling Problem: The Finite Case
International audience -
Impact de la coopération dans les nouvelles plates-formes de calcul à hautes ...
Computer science is deeply changing methodological aspects of the discovery process in different areas of knowledge. Researchers have at their disposal new... -
Verification of end-to-end real-time constraints in the context of AutoSar
These Cifre réalisée avec PSA Peugeot Citroën -
Maestro: Replica-Aware Map Scheduling for MapReduce
International audience -
Algorithms for on-demand touring problems
As part of this thesis, we investigate the vehicle routing problem. We propose heuristics to solve this problem quickly and efficiently. In this thesis, we deal with... -
Periodic scheduling of marked graphs using balanced binary words
This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the... -
Minimizing makespan for multi-spindle head machines with a mobile table
International audience -
Scheduling with due date assignment under special conditions on job processing
International audience -
Multi-product lot sizing and scheduling on unrelated parallel machines
International audience -
Tabu search and lower bound for an industrial complex shop scheduling problem
International audience -
Temporal safety for real-time multiprocessor systems
The hard real-time systems are characterized by sets of tasks for which are known the deadline, the arrival model (frequency) and the Worst-Case Execution Time (WCET).... -
Scheduling Associative Reductions with Homogeneous Costs when Overlapping Com...
Reduction is a core operation in parallel computing. Optimizing its cost has a high potential impact on the application execution time, particularly in MPI and... -
Belief scheduling for recognition of human action sequence
8 pages en double colonne -
Local search and combinatorial optimization: from structural analysis of a pr...
Many problems from combinatorial optimization are NP-hard, so that exact methods remain inefficient to solve them efficiently. However, metaheuristics are... -
Scheduling checkpoint/restart of high performance computing on dynamic enviro...
The technological advances has led major organizations such as enterprises, universities andresearch institutes to acquire intranets consisting of several servers and...
