default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristof Beyls
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j6]Kristof Beyls, Erik H. D'Hollander:
Refactoring for Data Locality. Computer 42(2): 62-71 (2009)- 2008
- [j5]Kristof Beyls, Erik H. D'Hollander:
Refactoring Intermediately Executed Code to Reduce Cache Capacity Misses. J. Instr. Level Parallelism 10 (2008) - [c14]Fabian Diet, Erik H. D'Hollander, Kristof Beyls, Harald Devos:
Embedding Smart Buffers for Window Operations in a Stream-Oriented C-to-VHDL Compiler. DELTA 2008: 142-147 - [c13]Erik H. D'Hollander, Kristof Beyls:
High Performance Computing with FPGAs. High Performance Computing Workshop 2008: 55-73 - 2007
- [j4]Sven Verdoolaege
, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions. Algorithmica 48(1): 37-66 (2007) - [j3]Harald Devos, Kristof Beyls, Mark Christiaens, Jan M. Van Campenhout, Erik H. D'Hollander, Dirk Stroobandt:
Finding and Applying Loop Transformations for Generating Optimized FPGA Implementations. Trans. High Perform. Embed. Archit. Compil. 1: 159-178 (2007) - 2006
- [c12]Kristof Beyls, Erik H. D'Hollander:
Intermediately executed code is the key to find refactorings that improve temporal data locality. Conf. Computing Frontiers 2006: 373-382 - [c11]Kristof Beyls, Erik H. D'Hollander:
Discovery of Locality-Improving Refactorings by Reuse Path Analysis. HPCC 2006: 220-229 - 2005
- [j2]Kristof Beyls, Erik H. D'Hollander:
Generating cache hints for improved program efficiency. J. Syst. Archit. 51(4): 223-250 (2005) - [c10]Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor:
Experiences with Enumeration of Integer Projections of Parametric Polytopes. CC 2005: 91-105 - [c9]Kristof Beyls, Erik H. D'Hollander, Frederik Vandeputte:
RDVIS: A Tool that Visualizes the Causes of Low Locality and Hints Program Optimizations. International Conference on Computational Science (2) 2005: 166-173 - 2004
- [c8]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. CASES 2004: 248-258 - [c7]Kristof Beyls, Erik H. D'Hollander:
Platform-Independent Cache Optimization by Pinpointing Low-Locality Reuse. International Conference on Computational Science 2004: 448-455 - [c6]Yijun Yu, Kristof Beyls, Erik H. D'Hollander:
Performance Visualizations using XML Representations. IV 2004: 795-800 - 2002
- [c5]Kristof Beyls, Erik H. D'Hollander:
Reuse Distance-Based Cache Hint Selection. Euro-Par 2002: 265-274 - [c4]Kristof Beyls, Erik H. D'Hollander, Yijun Yu:
Visualization Enables the Programmer to Reduce Cache Misses. IASTED PDCS 2002: 774-781 - 2001
- [c3]Yijun Yu, Kristof Beyls, Erik H. D'Hollander:
Visualizing the Impact of the Cache on Program Execution. IV 2001: 336-341 - 2000
- [j1]Kristof Beyls, Erik H. D'Hollander:
Compiler Generated Multithreading to Alleviate Memory Latency. J. Univers. Comput. Sci. 6(10): 968-993 (2000) - [c2]Kristof Beyls, Erik H. D'Hollander:
Cache Remapping to Improve the Performance of Tiled Algorithms. Euro-Par 2000: 998-1007
1990 – 1999
- 1999
- [c1]Kristof Beyls, Erik H. D'Hollander, Yijun Yu:
JPT: A Java Parallelization Tool. PVM/MPI 1999: 173-180
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-04-25 05:43 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:
