default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Huard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i2]Lars A. Bratholm, Will Gerrard, Brandon M. Anderson, Shaojie Bai, Sunghwan Choi, Lam Dang, Pavel Hanchar, Addison Howard, Guillaume Huard, Sanghoon Kim, J. Zico Kolter, Risi Kondor, Mordechai Kornbluth, Youhan Lee, Youngsoo Lee, Jonathan P. Mailoa, Thanh Tu Nguyen, Milos Popovic, Goran Rakocevic, Walter Reade, Wonho Song, Luka Stojanovic, Erik H. Thiede, Nebojsa Tijanic, Andres Torrubia, Devin Willmott, Craig P. Butts, David R. Glowacki, Kaggle participants:
A community-powered search of machine learning strategy space to find NMR property prediction models. CoRR abs/2008.05994 (2020)
2010 – 2019
- 2015
- [c19]David Beniamine, Matthias Diener
, Guillaume Huard, Philippe O. A. Navaux:
TABARNAC: visualizing and resolving memory access issues on NUMA architectures. VPA@SC 2015: 1:1-1:9 - 2014
- [c18]Damien Dosimont, Robin Lamarche-Perrin, Lucas Mello Schnorr, Guillaume Huard, Jean-Marc Vincent:
A spatiotemporal data aggregation technique for performance analysis of large-scale execution traces. CLUSTER 2014: 149-157 - [c17]Damien Dosimont, Generoso Pagano, Guillaume Huard, Vania Marangozova-Martin, Jean-Marc Vincent:
Efficient analysis methodology for huge application traces. HPCS 2014: 951-958 - 2012
- [j6]Lucas Mello Schnorr, Guillaume Huard, Philippe Olivier Alexandre Navaux:
A hierarchical aggregation model to achieve visualization scalability in the analysis of parallel applications. Parallel Comput. 38(3): 91-110 (2012) - 2011
- [c16]Swann Perarnau, Marc Tchiboukdjian, Guillaume Huard:
Controlling cache utilization of HPC applications. ICS 2011: 295-304 - 2010
- [j5]Lucas Mello Schnorr, Guillaume Huard, Philippe Olivier Alexandre Navaux:
Triva: Interactive 3D visualization for performance analysis of parallel applications. Future Gener. Comput. Syst. 26(3): 348-358 (2010) - [c15]Florent Blachot, Guillaume Huard, Johnatan E. Pecero, Erik Saule, Denis Trystram:
Scheduling instructions on hierarchical machines. IPDPS Workshops 2010: 1-8 - [c14]Swann Perarnau, Guillaume Huard:
KRASH: Reproducible CPU load generation on many-core machines. IPDPS 2010: 1-10 - [c13]Swann Perarnau, Guillaume Huard:
KRASH: reproducible CPU load generation on many cores machines. PPoPP 2010: 327-328
2000 – 2009
- 2009
- [c12]Lucas Mello Schnorr, Guillaume Huard, Philippe Olivier Alexandre Navaux:
Towards Visualization Scalability through Time Intervals and Hierarchical Organization of Monitoring Data. CCGRID 2009: 428-435 - [c11]Benoit Claudel, Guillaume Huard, Olivier Richard:
TakTuk, adaptive deployment of remote executions. HPDC 2009: 91-100 - [c10]Lucas Mello Schnorr, Philippe Olivier Alexandre Navaux, Guillaume Huard:
Visual Mapping of Program Components to Resources Representation: A 3D Analysis of Grid Parallel Applications. SBAC-PAD 2009: 127-134 - 2008
- [j4]Adrien Lebre, Guillaume Huard, Yves Denneulin:
Optimisation des E/S disques dans les environnements multi-applicatifs distribués. Tech. Sci. Informatiques 27(3-4): 265-291 (2008) - [c9]Lucas Mello Schnorr, Guillaume Huard, Philippe Olivier Alexandre Navaux:
3D approach to the visualization of parallel applications and Grid monitoring information. GRID 2008: 233-241 - 2006
- [c8]Adrien Lebre, Guillaume Huard, Yves Denneulin, Przemyslaw Sowa:
I/O Scheduling Service for Multi-Application Clusters. CLUSTER 2006 - [c7]Florent Blachot, Benoît Dupont de Dinechin, Guillaume Huard:
SCAN: A Heuristic for Near-Optimal Software Pipelining. Euro-Par 2006: 289-298 - [c6]Adrien Lebre, Yves Denneulin, Guillaume Huard, Przemyslaw Sowa:
Adaptive I/O Scheduling for Distributed Multi-applications Environments. HPDC 2006: 343-344 - 2005
- [j3]Cyrille Martin, Olivier Richard, Guillaume Huard:
Déploiement adaptatif d'applications parallèles. Algorithme de vol de travail appliqué au déploiement d'applications parallèles sur des grappes de grande taille. Tech. Sci. Informatiques 24(5): 547-565 (2005) - [j2]Alain Darte, Guillaume Huard:
New Complexity Results on Array Contraction and Related Problems. J. VLSI Signal Process. 40(1): 35-55 (2005) - [c5]Nicolas Capit, Georges Da Costa, Yiannis Georgiou, Guillaume Huard, Cyrille Martin, Grégory Mounié, Pierre Neyron, Olivier Richard:
A batch scheduler with high level components. CCGRID 2005: 776-783 - [i1]Nicolas Capit, Georges Da Costa, Yiannis Georgiou, Guillaume Huard, Cyrille Martin, Grégory Mounié, Pierre Neyron, Olivier Richard:
A batch scheduler with high level components. CoRR abs/cs/0506006 (2005) - 2002
- [c4]Alain Darte, Guillaume Huard:
New Results on Array Contraction. ASAP 2002: 359-370 - [c3]Alain Darte, Guillaume Huard:
Complexity of Multi-dimensional Loop Alignment. STACS 2002: 179-191 - 2001
- [b1]Guillaume Huard:
Algorithmique du décalage d'instructions. (Instructions shifting algorithmics). École normale supérieure de Lyon, France, 2001 - 2000
- [j1]Alain Darte, Guillaume Huard:
Loop Shifting for Loop Compaction. Int. J. Parallel Program. 28(5): 499-534 (2000)
1990 – 1999
- 1999
- [c2]Antoine Fraboulet, Guillaume Huard, Anne Mignotte:
Loop Alignment for Memory Accesses Optimization. ISSS 1999: 71-77 - [c1]Alain Darte, Guillaume Huard:
Loop Shifting for Loop Compaction. LCPC 1999: 415-431
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-08-05 20:25 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:
