default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouis-Claude Canon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Sonia Ben Mokhtar, Louis-Claude Canon
, Anthony Dugois, Loris Marchal, Etienne Rivière:
A scheduling framework for distributed key-value stores and its application to tail latency minimization. J. Sched. 27(2): 183-202 (2024)- [c31]Louis-Claude Canon, Anthony Dugois, Loris Marchal:
Solving the Restricted Assignment Problem to Schedule Multi-get Requests in Key-Value Stores. Euro-Par (1) 2024: 195-209 - 2023
- [j13]Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam:
List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds. J. Parallel Distributed Comput. 174: 100-117 (2023) - [c30]Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam:
Asymptotic Performance and Energy Consumption of SLACK. Euro-Par 2023: 81-95 - [c29]Louis-Claude Canon, Damien Landré, Laurent Philippe, Jean-Marc Pierson, Paul Renaud-Goud:
Assessing Power Needs to Run a Workload with Quality of Service on Green Datacenters. Euro-Par 2023: 229-242 - [c28]Louis-Claude Canon, Anthony Dugois, Loris Marchal, Etienne Rivière:
Hector: A Framework to Design and Evaluate Scheduling Strategies in Persistent Key-Value Stores. ICPP 2023: 535-545 - 2022
- [c27]Louis-Claude Canon, Anthony Dugois, Loris Marchal:
Bounding the Flow Time in Online Scheduling with Structured Processing Sets. IPDPS 2022: 683-693 - 2021
- [j12]Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon, Denis Trystram:
Scheduling on Two Types of Resources: A Survey. ACM Comput. Surv. 53(3): 56:1-56:36 (2021) - [c26]Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam:
Update on the Asymptotic Optimality of LPT. Euro-Par 2021: 55-69 - [c25]Sonia Ben Mokhtar, Louis-Claude Canon, Anthony Dugois, Loris Marchal, Etienne Rivière:
Taming Tail Latency in Key-Value Stores: A Scheduling Perspective. Euro-Par 2021: 136-150 - [c24]Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam:
Shelf schedules for independent moldable tasks to minimize the energy consumption. SBAC-PAD 2021: 126-136 - 2020
- [j11]Louis-Claude Canon, Aurélie Kong Win Chang, Yves Robert, Frédéric Vivien:
Scheduling independent stochastic tasks under deadline and budget constraints. Int. J. High Perform. Comput. Appl. 34(2) (2020) - [j10]Louis-Claude Canon, Loris Marchal, Bertrand Simon, Frédéric Vivien:
Online Scheduling of Task Graphs on Heterogeneous Platforms. IEEE Trans. Parallel Distributed Syst. 31(3): 721-732 (2020)
2010 – 2019
- 2019
- [j9]Li Han, Valentin Le Fèvre, Louis-Claude Canon, Yves Robert, Frédéric Vivien:
A generic approach to scheduling and checkpointing workflows. Int. J. High Perform. Comput. Appl. 33(6) (2019) - [c23]Yiqin Gao, Louis-Claude Canon, Yves Robert, Frédéric Vivien:
Scheduling independent stochastic tasks on heterogeneous cloud platforms. CLUSTER 2019: 1-11 - [c22]Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam:
A Comparison of Random Task Graph Generation Methods for Scheduling Problems. Euro-Par 2019: 61-73 - [c21]Li Han, Louis-Claude Canon, Jing Liu, Yves Robert, Frédéric Vivien:
Improved Energy-Aware Strategies for Periodic Real-Time Tasks under Reliability Constraints. RTSS 2019: 17-29 - [i3]Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam:
A Comparison of Random Task Graph Generation Methods for Scheduling Problems. CoRR abs/1902.05808 (2019) - [i2]Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon, Denis Trystram:
Scheduling on Two Types of Resources: a Survey. CoRR abs/1909.11365 (2019) - 2018
- [j8]Li Han, Louis-Claude Canon, Henri Casanova, Yves Robert, Frédéric Vivien:
Checkpointing Workflows for Fail-Stop Errors. IEEE Trans. Computers 67(8): 1105-1120 (2018) - [c20]Louis-Claude Canon, Loris Marchal, Bertrand Simon, Frédéric Vivien:
Online Scheduling of Task Graphs on Hybrid Platforms. Euro-Par 2018: 192-204 - [c19]Li Han, Valentin Le Fèvre, Louis-Claude Canon, Yves Robert, Frédéric Vivien:
A Generic Approach to Scheduling and Checkpointing Workflows. ICPP 2018: 28:1-28:10 - [c18]Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam:
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. HPCS 2018: 460-467 - [c17]Louis-Claude Canon, Aurélie Kong Win Chang, Yves Robert, Frédéric Vivien:
Scheduling Independent Stochastic Tasks Under Deadline and Budget Constraints. SBAC-PAD 2018: 33-40 - [i1]Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam:
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. CoRR abs/1803.08121 (2018) - 2017
- [j7]Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe:
Controlling the correlation of cost matrices to assess scheduling algorithm performance on heterogeneous platforms. Concurr. Comput. Pract. Exp. 29(15) (2017) - [j6]Louis-Claude Canon, Laurent Philippe:
On the Heterogeneity Bias of Cost Matrices for Assessing Scheduling Algorithms. IEEE Trans. Parallel Distributed Syst. 28(6): 1675-1688 (2017) - [c16]Li Han, Louis-Claude Canon, Henri Casanova, Yves Robert, Frédéric Vivien:
Checkpointing Workflows for Fail-Stop Errors. CLUSTER 2017: 487-497 - [c15]Louis-Claude Canon, Loris Marchal, Frédéric Vivien:
Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms. Euro-Par 2017: 232-244 - 2016
- [j5]Louis-Claude Canon, Emmanuel Jeannot:
Correlation-Aware Heuristics for Evaluating the Distribution of the Longest Path Length of a DAG with Random Weights. IEEE Trans. Parallel Distributed Syst. 27(11): 3158-3171 (2016) - [c14]Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe:
Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling. Euro-Par 2016: 133-145 - 2015
- [j4]Anne Benoit, Louis-Claude Canon, Loris Marchal:
Non-clairvoyant reduction algorithms for heterogeneous platforms. Concurr. Comput. Pract. Exp. 27(6): 1612-1624 (2015) - [c13]Louis-Claude Canon, Laurent Philippe:
On the Heterogeneity Bias of Cost Matrices When Assessing Scheduling Algorithms. Euro-Par 2015: 109-121 - 2014
- [c12]Louis-Claude Canon, Adel Essafi, Denis Trystram:
A proactive approach for coping with uncertain resource availabilities on desktop grids. HiPC 2014: 1-9 - 2013
- [c11]Anne Benoit, Louis-Claude Canon, Loris Marchal:
Non-clairvoyant Reduction Algorithms for Heterogeneous Platforms. Euro-Par Workshops 2013: 270-279 - [c10]Louis-Claude Canon:
Scheduling associative reductions with homogeneous costs when overlapping communications and computations. HiPC 2013: 119-128 - 2012
- [j3]Anne Benoit, Louis-Claude Canon, Emmanuel Jeannot, Yves Robert:
Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms. J. Sched. 15(5): 615-627 (2012) - 2011
- [c9]Louis-Claude Canon, Adel Essafi, Grégory Mounié, Denis Trystram:
A Bi-Objective Scheduling Algorithm for Desktop Grids with Uncertain Resource Availabilities. Euro-Par (2) 2011: 238-249 - [c8]Louis-Claude Canon, Emmanuel Jeannot, Jon B. Weissman:
A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids. ICDCS 2011: 343-352 - [c7]Louis-Claude Canon, Emmanuel Jeannot:
MO-Greedy: An Extended Beam-Search Approach for Solving a Multi-criteria Scheduling Problem on Heterogeneous Machines. IPDPS Workshops 2011: 57-69 - 2010
- [b1]Louis-Claude Canon:
Outils et algorithmes pour gérer l'incertitude lors de l'ordonnancement d'application sur plateformes distribuées. (Tools and algorithms for coping with uncertainty when scheduling application on distributed platforms). Henri Poincaré University, Nancy, France, 2010 - [j2]Louis-Claude Canon, Olivier Dubuisson, Jens Gustedt, Emmanuel Jeannot:
Defining and controlling the heterogeneity of a cluster: The Wrekavoc tool. J. Syst. Softw. 83(5): 786-802 (2010) - [j1]Louis-Claude Canon, Emmanuel Jeannot:
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments. IEEE Trans. Parallel Distributed Syst. 21(4): 532-546 (2010) - [c6]Louis-Claude Canon:
Coping with uncertainty in scheduling problems. IPDPS Workshops 2010: 1-4 - [c5]Louis-Claude Canon, Emmanuel Jeannot, Jon B. Weissman:
A dynamic approach for characterizing collusion in desktop grids. IPDPS 2010: 1-12
2000 – 2009
- 2008
- [c4]Louis-Claude Canon, Emmanuel Jeannot, Rizos Sakellariou, Wei Zheng:
Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics. CoreGRID Integration Workshop 2008: 73-84 - [c3]Louis-Claude Canon, Emmanuel Jeannot:
Scheduling strategies for the bicriteria optimization of the robustness and makespan. IPDPS 2008: 1-8 - 2007
- [c2]Louis-Claude Canon, Emmanuel Jeannot:
A Comparison of robustness metrics for scheduling DAGs on heterogeneous systems. CLUSTER 2007: 558-567 - 2006
- [c1]Louis-Claude Canon, Emmanuel Jeannot:
Wrekavoc: a tool for emulating heterogeneity. IPDPS 2006
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
