default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Pallez
Person information
- affiliation: Inria, Labri, France
- affiliation: University of Bordeaux, Talence, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Yishu Du, Loris Marchal
, Guillaume Pallez, Yves Robert:
Improving batch schedulers with node stealing for failed jobs. Concurr. Comput. Pract. Exp. 36(12) (2024)- [j24]Daiane I. Dolci, James R. Maddison, David A. Ham, Guillaume Pallez, Julien Herrmann:
checkpoint_schedules: schedules for incremental checkpointing of adjoint simulations. J. Open Source Softw. 9(96): 6148 (2024) - [c37]Alexis Bandet, Francieli Boito, Guillaume Pallez:
Scheduling Distributed I/O Resources in HPC Systems. Euro-Par (1) 2024: 137-151 - [c36]Ahmad Tarraf, Alexis Bandet, Francieli Boito, Guillaume Pallez, Felix Wolf:
Capturing Periodic I/O Using Frequency Techniques. IPDPS 2024: 465-478 - 2023
- [b2]Guillaume Pallez:
Model Design and Accuracy for Resource Management in HPC. (Conception et précision des modèles pour la gestion de ressources en HPC). University of Bordeaux, France, 2023 - [j23]Emmanuel Jeannot, Guillaume Pallez, Nicolas Vidal:
IO-aware Job-Scheduling: Exploiting the Impacts of Workload Characterizations to select the Mapping Strategy. Int. J. High Perform. Comput. Appl. 37(3-4): 213-228 (2023) - [j22]Yiqin Gao, Guillaume Pallez, Yves Robert, Frédéric Vivien:
Dynamic Scheduling Strategies for Firm Semi-Periodic Real-Time Tasks. IEEE Trans. Computers 72(1): 55-68 (2023) - [j21]Francieli Boito, Guillaume Pallez, Luan Teylo, Nicolas Vidal:
IO-Sets: Simple and Efficient Approaches for I/O Bandwidth Management. IEEE Trans. Parallel Distributed Syst. 34(10): 2783-2796 (2023) - [c35]Robin Boëzennec, Fanny Dufossé, Guillaume Pallez:
Optimization Metrics for the Evaluation of Batch Schedulers in HPC. JSSPP 2023: 97-115 - [i13]Ahmad Tarraf, Alexis Bandet, Francieli Boito, Guillaume Pallez, Felix Wolf:
FTIO: Detecting I/O Periodicity Using Frequency Techniques. CoRR abs/2306.08601 (2023) - 2022
- [j20]Yishu Du, Loris Marchal, Guillaume Pallez, Yves Robert:
Optimal Checkpointing Strategies for Iterative Applications. IEEE Trans. Parallel Distributed Syst. 33(3): 507-522 (2022) - [c34]Francieli Boito, Guillaume Pallez, Luan Teylo:
The role of storage target allocation in applications' I/O performance with BeeGFS. CLUSTER 2022: 267-277 - [c33]Anne Benoit, Yishu Du, Thomas Hérault, Loris Marchal, Guillaume Pallez, Lucas Perotin, Yves Robert, Hongyang Sun, Frédéric Vivien:
Checkpointing à la Young/Daly: An Overview. IC3 2022: 701-710 - 2021
- [j19]Emmanuel Jeannot, Guillaume Pallez, Nicolas Vidal:
Scheduling periodic I/O access with bi-colored chains: models and algorithms. J. Sched. 24(5): 469-481 (2021) - [j18]Ana Gainaru, Brice Goglin, Valentin Honoré, Guillaume Pallez:
Profiles of Upcoming HPC Applications and Their Impact on Reservation Strategies. IEEE Trans. Parallel Distributed Syst. 32(5): 1178-1190 (2021) - [c32]Yiqin Gao, Guillaume Pallez, Yves Robert, Frédéric Vivien:
Work-in-Progress: Evaluating Task Dropping Strategies for Overloaded Real-Time Systems. RTSS 2021: 528-531 - 2020
- [j17]Julien Herrmann, Guillaume Pallez:
H-Revolve: A Framework for Adjoint Computation on Synchronous Hierarchical Platforms. ACM Trans. Math. Softw. 46(2): 12:1-12:25 (2020) - [c31]Yishu Du, Loris Marchal, Guillaume Pallez Aupy, Yves Robert:
Robustness of the Young/Daly formula for stochastic iterative applications. ICPP 2020: 15:1-15:11 - [c30]Jesús Carretero, Emmanuel Jeannot, Guillaume Pallez, David E. Singh, Nicolas Vidal:
Mapping and scheduling HPC applications for optimizing I/O. ICS 2020: 33:1-33:12 - [c29]Ana Gainaru, Brice Goglin, Valentin Honoré, Guillaume Pallez Aupy, Padma Raghavan, Yves Robert, Hongyang Sun:
Reservation and Checkpointing Strategies for Stochastic Jobs. IPDPS 2020: 853-863
2010 – 2019
- 2019
- [j16]Guillaume Aupy, Anne Benoit, Brice Goglin, Loïc Pottier, Yves Robert:
Co-scheduling HPC workloads on cache-partitioned CMP platforms. Int. J. High Perform. Comput. Appl. 33(6) (2019) - [j15]Guillaume Aupy, Brice Goglin, Valentin Honoré, Bruno Raffin:
Modeling high-throughput applications for in situ analytics. Int. J. High Perform. Comput. Appl. 33(6) (2019) - [j14]Ana Gainaru, Hongyang Sun, Guillaume Aupy, Yuankai Huo, Bennett A. Landman, Padma Raghavan:
On-the-fly scheduling versus reservation-based scheduling for unpredictable workflows. Int. J. High Perform. Comput. Appl. 33(6) (2019) - [j13]Tien-Dat Phan, Guillaume Pallez, Shadi Ibrahim, Padma Raghavan:
A New Framework for Evaluating Straggler Detection Mechanisms in MapReduce. ACM Trans. Model. Perform. Evaluation Comput. Syst. 4(3): 14:1-14:23 (2019) - [j12]Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
I/O Scheduling Strategy for Periodic Applications. ACM Trans. Parallel Comput. 6(2): 7:1-7:26 (2019) - [c28]Massinissa Ait Aba, Alix Munier Kordon, Guillaume Pallez:
Scheduling on Two Unbounded Resources with Communication Costs. Euro-Par 2019: 117-128 - [c27]Ana Gainaru, Guillaume Pallez, Hongyang Sun, Padma Raghavan:
Speculative Scheduling for Stochastic HPC Applications. ICPP 2019: 32:1-32:10 - [c26]Guillaume Aupy, Ana Gainaru, Valentin Honoré, Padma Raghavan, Yves Robert, Hongyang Sun:
Reservation Strategies for Stochastic Jobs. IPDPS 2019: 166-175 - [c25]Guillaume Aupy, Olivier Beaumont, Lionel Eyraud-Dubois:
Sizing and Partitioning Strategies for Burst-Buffers to Reduce IO Contention. IPDPS 2019: 631-640 - [c24]Ana Gainaru, Guillaume Pallez:
Making Speculative Scheduling Robust to Incomplete Data. ScalA@SC 2019: 62-71 - 2018
- [j11]Guillaume Aupy, Xueyan Tang:
Parallel and distributed algorithms. Concurr. Comput. Pract. Exp. 30(17) (2018) - [j10]Guillaume Aupy, Anne Benoit, Sicheng Dai, Loïc Pottier, Padma Raghavan, Yves Robert, Manu Shantharam:
Co-scheduling Amdahl applications on cache-partitioned systems. Int. J. High Perform. Comput. Appl. 32(1): 123-138 (2018) - [c23]Guillaume Aupy, Anne Benoit, Brice Goglin, Loic Pottier, Yves Robert:
Co-Scheduling HPC Workloads on Cache-Partitioned CMP Platforms. CLUSTER 2018: 348-358 - [c22]Hongyang Sun, Redouane Elghazi, Ana Gainaru, Guillaume Aupy, Padma Raghavan:
Scheduling Parallel Tasks under Multiple Resources: List Scheduling vs. Pack Scheduling. IPDPS 2018: 194-203 - [c21]Guillaume Aupy, Olivier Beaumont, Lionel Eyraud-Dubois:
What Size Should Your Buffers to Disks be? IPDPS 2018: 660-669 - [p1]Guillaume Aupy, Yves Robert:
Scheduling for Fault-Tolerance: An Introduction. Topics in Parallel and Distributed Computing 2018: 143-170 - 2017
- [j9]Guillaume Aupy, Julien Herrmann:
Periodicity in optimal hierarchical checkpointing schemes for adjoint computations. Optim. Methods Softw. 32(3): 594-624 (2017) - [c20]Guillaume Aupy, Yves Robert, Frédéric Vivien:
Assuming Failure Independence: Are We Right to be Wrong? CLUSTER 2017: 709-716 - [c19]Tien-Dat Phan, Shadi Ibrahim, Amelie Chi Zhou, Guillaume Aupy, Gabriel Antoniu:
Energy-Driven Straggler Mitigation in MapReduce. Euro-Par 2017: 385-398 - [c18]Shashank Shekhar, Ajay Dev Chhokra, Anirban Bhattacharjee, Guillaume Aupy, Aniruddha S. Gokhale:
INDICES: Exploiting Edge Resources for Performance-Aware Cloud-Hosted Services. ICFEC 2017: 75-80 - [c17]Guillaume Aupy, Clement Brasseur, Loris Marchal:
Dynamic Memory-Aware Task-Tree Scheduling. IPDPS 2017: 758-767 - [c16]Guillaume Aupy, Anne Benoit, Loïc Pottier, Padma Raghavan, Yves Robert, Manu Shantharam:
Co-Scheduling Algorithms for Cache-Partitioned Systems. IPDPS Workshops 2017: 874-883 - [c15]Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
Periodic I/O Scheduling for Super-Computers. PMBS@SC 2017: 44-66 - [i12]Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
Periodic I/O scheduling for super-computers. CoRR abs/1702.06900 (2017) - 2016
- [j8]Guillaume Aupy, Anne Benoit, Henri Casanova, Yves Robert:
Checkpointing Strategies for Scheduling Computational Workflows. Int. J. Netw. Comput. 6(1): 2-26 (2016) - [j7]Guillaume Aupy, Anne Benoit:
Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems. Parallel Process. Lett. 26(1): 1650001:1-1650001:23 (2016) - [j6]Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan:
Co-scheduling algorithms for high-throughput workload execution. J. Sched. 19(6): 627-640 (2016) - [j5]Guillaume Aupy, Julien Herrmann, Paul D. Hovland, Yves Robert:
Optimal Multistage Algorithm for Adjoint Computation. SIAM J. Sci. Comput. 38(3) (2016) - [c14]Guillaume Aupy, JeongHyung Park, Padma Raghavan:
Locality-Aware Laplacian Mesh Smoothing. ICPP 2016: 588-597 - [i11]Guillaume Aupy, JeongHyung Park, Padma Raghavan:
Locality-Aware Laplacian Mesh Smoothing. CoRR abs/1606.00803 (2016) - 2015
- [j4]Guillaume Aupy, Anne Benoit, Matthieu Journault, Yves Robert:
Power-aware replica placement in tree networks with multiple servers per client. Sustain. Comput. Informatics Syst. 5: 41-53 (2015) - [c13]Guillaume Aupy, Anne Benoit, Henri Casanova, Yves Robert:
Scheduling Computational Workflows on Failure-Prone Platforms. IPDPS Workshops 2015: 473-482 - [c12]Ana Gainaru, Guillaume Aupy, Anne Benoit, Franck Cappello, Yves Robert, Marc Snir:
Scheduling the I/O of HPC Applications Under Congestion. IPDPS 2015: 1013-1022 - [c11]Humayun Kabir, Joshua Dennis Booth, Guillaume Aupy, Anne Benoit, Yves Robert, Padma Raghavan:
STS-k: a multilevel sparse triangular solution scheme for NUMA multicores. SC 2015: 55:1-55:11 - [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 - 2014
- [b1]Guillaume Aupy:
Resilient and energy-efficient scheduling algorithms at scale. (Algorithmes d'ordonnancement fiables et efficaces énergétiquement à l'échelle). École normale supérieure de Lyon, France, 2014 - [j3]Guillaume Aupy, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
Checkpointing algorithms and fault prediction. J. Parallel Distributed Comput. 74(2): 2048-2064 (2014) - [c10]Guillaume Aupy, Anne Benoit, Matthieu Journault, Yves Robert:
Power-Aware Replica Placement in Tree Networks with Multiple Servers per Client. Euro-Par 2014: 608-619 - 2013
- [j2]Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert:
Reclaiming the energy of a schedule: models and algorithms. Concurr. Comput. Pract. Exp. 25(11): 1505-1523 (2013) - [c9]Guillaume Aupy, Mathieu Faverge, Yves Robert, Jakub Kurzak, Piotr Luszczek, Jack J. Dongarra:
Implementing a Systolic Algorithm for QR Factorization on Multicore Clusters with PaRSEC. Euro-Par Workshops 2013: 657-667 - [c8]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 - [c7]Guillaume Aupy, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
Checkpointing Strategies with Prediction Windows. PRDC 2013: 1-10 - [c6]Guillaume Aupy, Anne Benoit, Thomas Hérault, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
On the Combination of Silent Error Detection and Checkpointing. PRDC 2013: 11-20 - [c5]Guillaume Aupy, Anne Benoit, Thomas Hérault, Yves Robert, Jack J. Dongarra:
Optimal Checkpointing Period: Time vs. Energy. PMBS@SC 2013: 203-214 - [i10]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) - [i9]Guillaume Aupy, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
Checkpointing algorithms and fault prediction. CoRR abs/1302.3752 (2013) - [i8]Guillaume Aupy, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
Checkpointing strategies with prediction windows. CoRR abs/1302.4558 (2013) - [i7]Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan:
Co-Scheduling Algorithms for High-Throughput Workload Execution. CoRR abs/1304.7793 (2013) - [i6]Guillaume Aupy, Anne Benoit, Thomas Hérault, Yves Robert, Jack J. Dongarra:
Optimal Checkpointing Period: Time vs. Energy. CoRR abs/1310.8456 (2013) - [i5]Guillaume Aupy, Anne Benoit, Thomas Hérault, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
On the Combination of Silent Error Detection and Checkpointing. CoRR abs/1310.8486 (2013) - 2012
- [c4]Guillaume Aupy, Anne Benoit, Yves Robert:
Energy-aware scheduling under reliability and makespan constraints. HiPC 2012: 1-10 - [c3]Guillaume Aupy:
Energy-aware Scheduling: Models and Complexity Results. IPDPS Workshops 2012: 2478-2481 - [i4]Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert:
Reclaiming the energy of a schedule: models and algorithms. CoRR abs/1204.0939 (2012) - [i3]Guillaume Aupy, Yves Robert, Frédéric Vivien, Dounia Zaidouni:
Impact of fault prediction on checkpointing strategies. CoRR abs/1207.6936 (2012) - [i2]Guillaume Aupy, Anne Benoit:
Approximation algorithms for energy, reliability and makespan optimization problems. CoRR abs/1210.4673 (2012) - 2011
- [j1]Guillaume Aupy, Olivier Bournez:
On the number of binary-minded individuals required to compute sqrt(1/2). Theor. Comput. Sci. 412(22): 2262-2267 (2011) - [c2]Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert:
Brief announcement: reclaiming the energy of a schedule, models and algorithms. SPAA 2011: 135-136 - [c1]Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs:
Speed Scaling to Manage Temperature. TAPAS 2011: 9-20 - [i1]Guillaume Aupy, Anne Benoit, Yves Robert:
Energy-aware scheduling under reliability and makespan constraints. CoRR abs/1111.5528 (2011)
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-12-02 21:33 CET 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:
