default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Renaud-Goud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c22]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- 2022
- [j5]Florent Dubois, Paul Renaud-Goud, Patricia Stolf:
Capacitated Vehicle Routing Problem Under Deadlines: An Application to Flooding Crisis. IEEE Access 10: 45629-45642 (2022) - [j4]Léo Grange, Patricia Stolf, Georges Da Costa, Paul Renaud-Goud:
Multi-Objective and Cooperative Power Planning for Datacenter With On-Site Renewable Energy Sources. IEEE Access 10: 104067-104092 (2022) - [c21]Florent Dubois, Paul Renaud-Goud, Patricia Stolf:
Dynamic Capacitated Vehicle Routing Problem for Flash Flood Victim's Relief Operations. ISCRAM 2022: 68-86
2010 – 2019
- 2019
- [c20]Patricia Stolf, Jean-Marc Pierson, Amal Sayah, Georges Da Costa, Paul Renaud-Goud:
e-Flooding: Crisis Management through Two Temporal Loops. HICSS 2019: 1-10 - [c19]Florent Dubois, Paul Renaud-Goud, Patricia Stolf:
Capacitated Vehicle Routing Problem under Deadlines. ICT-DM 2019: 1-8 - [c18]Berk Celik, Gustavo Rostirolla, Stéphane Caux, Paul Renaud-Goud, Patricia Stolf:
Analysis of demand response for datacenter energy management using GA and time-of-use prices. ISGT Europe 2019: 1-5 - [c17]Stéphane Caux, Paul Renaud-Goud, Gustavo Rostirolla, Patricia Stolf:
Phase-Based Tasks Scheduling in Data Centers Powered Exclusively by Renewable Energy. SBAC-PAD 2019: 136-143 - 2018
- [c16]Stéphane Caux, Paul Renaud-Goud, Gustavo Rostirolla, Patricia Stolf:
IT Optimization for Datacenters Under Renewable Power Constraint. Euro-Par 2018: 339-351 - [c15]Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
Lock-Free Search Data Structures: Throughput Modeling with Poisson Processes. OPODIS 2018: 9:1-9:16 - [i10]Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas:
White-box methodologies, programming abstractions and libraries. CoRR abs/1801.08761 (2018) - [i9]Phuong Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Philippas Tsigas, Anders Gidenstam, Paul Renaud-Goud, Ivan Walulya, Aras Atalar:
Models for energy consumption of data structures and algorithms. CoRR abs/1801.09992 (2018) - [i8]Phuong Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas, Ivan Walulya:
Power models, energy models and libraries for energy-efficient concurrent data structures and algorithms. CoRR abs/1801.10556 (2018) - [i7]Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas, Ivan Walulya:
D2.4 Report on the final prototype of programming abstractions for energy-efficient inter-process communication. CoRR abs/1802.03013 (2018) - [i6]Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes. CoRR abs/1805.04794 (2018) - 2016
- [c14]Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses. OPODIS 2016: 23:1-23:17 - [i5]Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses. CoRR abs/1611.05793 (2016) - 2015
- [j3]Lazaros Papadopoulos, Ivan Walulya, Paul Renaud-Goud, Philippas Tsigas, Dimitrios Soudris, Brendan Barry:
Performance and power consumption evaluation of concurrent queue implementations in embedded systems. Comput. Sci. Res. Dev. 30(2): 165-175 (2015) - [c13]Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas:
Modeling Energy Consumption of Lock-Free Queue Implementations. IPDPS 2015: 229-238 - [c12]Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based Model. DISC 2015: 341-355 - [r1]Guillaume Aupy, Anne Benoit, Paul Renaud-Goud, Yves Robert:
Energy-Aware Algorithms for Task Graph Scheduling, Replica Placement and Checkpoint Strategies. Handbook on Data Centers 2015: 37-80 - [i4]Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
Analyzing the Performance of Lock-Free Data Structures: A Conflict-based Model. CoRR abs/1508.03566 (2015) - 2014
- [c11]Olivier Beaumont, Juan Angel Lorenzo, Lionel Eyraud-Dubois, Paul Renaud-Goud:
Efficient and robust allocation algorithms in clouds under memory constraints. HiPC 2014: 1-10 - 2013
- [j2]Anne Benoit, Rami G. Melhem, Paul Renaud-Goud, Yves Robert:
Assessing the Performance of Energy-Aware mappings. Parallel Process. Lett. 23(2) (2013) - [c10]Olivier Beaumont, Lionel Eyraud-Dubois, Pierre Pesneau, Paul Renaud-Goud:
Reliable Service Allocation in Clouds with Memory and Capacity Constraints. Euro-Par Workshops 2013: 698-706 - [c9]Guillaume Aupy, Anne Benoit, Rami G. Melhem, Paul Renaud-Goud, Yves Robert:
Energy-aware checkpointing of divisible tasks with soft or hard deadlines. IGCC 2013: 1-8 - [c8]Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud:
Approximation algorithms for energy minimization in Cloud service allocation under reliability constraints. HiPC 2013: 295-304 - [i3]Guillaume Aupy, Anne Benoit, Rami G. Melhem, Paul Renaud-Goud, Yves Robert:
Energy-aware checkpointing of divisible tasks with soft or hard deadlines. CoRR abs/1302.3720 (2013) - [i2]Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud:
Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints. CoRR abs/1302.4414 (2013) - [i1]Olivier Beaumont, Lionel Eyraud-Dubois, Paul Renaud-Goud:
Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints. CoRR abs/1310.5255 (2013) - 2012
- [b1]Paul Renaud-Goud:
Energy-aware scheduling : complexity and algorithms. (Ordonnancement sous contrainte d'énergie : complexité et algorithmes). École normale supérieure de Lyon, France, 2012 - [c7]Anne Benoit, Rami G. Melhem, Paul Renaud-Goud, Yves Robert:
Power-aware Manhattan Routing on Chip Multiprocessors. IPDPS 2012: 189-200 - [c6]Anne Benoit, Hubert Larchevêque, Paul Renaud-Goud:
Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks. IPDPS 2012: 1022-1033 - 2011
- [j1]Anne Benoit, Paul Renaud-Goud, Yves Robert:
Models and complexity results for performance and energy optimization of concurrent streaming applications. Int. J. High Perform. Comput. Appl. 25(3): 261-273 (2011) - [c5]Anne Benoit, Paul Renaud-Goud, Yves Robert:
On the Performance of Greedy Algorithms for Power Consumption Minimization. ICPP 2011: 454-463 - [c4]Anne Benoit, Paul Renaud-Goud, Yves Robert, Rami G. Melhem:
Energy-Aware Mappings of Series-Parallel Workflows onto Chip Multiprocessors. ICPP 2011: 472-481 - [c3]Anne Benoit, Paul Renaud-Goud, Yves Robert:
Power-Aware Replica Placement and Update Strategies in Tree Networks. IPDPS 2011: 2-13 - 2010
- [c2]Anne Benoit, Paul Renaud-Goud, Yves Robert:
Performance and energy optimization of concurrent pipelined applications. IPDPS 2010: 1-12 - [c1]Anne Benoit, Paul Renaud-Goud, Yves Robert:
Sharing Resources for Performance and Energy Optimization of Concurrent Streaming Applications. SBAC-PAD 2010: 79-86
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 21:26 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:
