default search action
Peter M. W. Knijnenburg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [c30]Sven van Haastregt, Peter M. W. Knijnenburg:
Interactive presentation: Feasibility of combined area and performance optimization for superscalar processors using random search. DATE 2007: 606-611 - [c29]Francisco J. Cazorla, Enrique Fernández, Peter M. W. Knijnenburg, Alex Ramírez, Rizos Sakellariou, Mateo Valero:
On the Problem of Minimizing Workload Execution Time in SMT Processors. ICSAMOS 2007: 66-73 - [c28]Thomas A. M. Bernard, Chris R. Jesshope, Peter M. W. Knijnenburg:
Strategies for Compiling µ TC to Novel Chip Multiprocessors. SAMOS 2007: 127-138 - [e1]Holger Blume, Georgi Gaydadjiev, C. John Glossner, Peter M. W. Knijnenburg:
Proceedings of the 2007 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (IC-SAMOS 2007), Samos, Greece, July 16-19, 2007. IEEE 2007, ISBN 1-4244-1058-4 [contents] - 2006
- [j14]Peter M. W. Knijnenburg:
Special Issue: 10th International Workshop on Compilers for Parallel Computers (CPC 2003). Concurr. Comput. Pract. Exp. 18(11): 1333-1334 (2006) - [j13]Karine Heydemann, François Bodin, Peter M. W. Knijnenburg, Laurent Morin:
UFS: a global trade-off strategy for loop unrolling for VLIW architectures. Concurr. Comput. Pract. Exp. 18(11): 1413-1434 (2006) - [j12]Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández, Alex Ramírez, Mateo Valero:
Predictable Performance in SMT Processors: Synergy between the OS and SMTs. IEEE Trans. Computers 55(7): 785-799 (2006) - [c27]Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
On the impact of data input sets on statistical compiler tuning. IPDPS 2006 - [c26]Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Code Size Reduction by Compiler Tuning. SAMOS 2006: 186-195 - 2005
- [c25]Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Automatic Selection of Compiler Options Using Non-parametric Inferential Statistics. IEEE PACT 2005: 123-132 - [c24]Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández, Alex Ramírez, Mateo Valero:
Architectural support for real-time task scheduling in SMT processors. CASES 2005: 166-176 - [c23]Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Optimizing general purpose compiler optimization. Conf. Computing Frontiers 2005: 180-188 - [c22]Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Generating new general compiler optimization settings. ICS 2005: 161-168 - 2004
- [j11]Peter M. W. Knijnenburg, Toru Kisuki, Kyle A. Gallivan, Michael F. P. O'Boyle:
The effect of cache models on iterative compilation for combined tiling and unrolling. Concurr. Comput. Pract. Exp. 16(2-3): 247-270 (2004) - [j10]Francisco J. Cazorla, Alex Ramírez, Mateo Valero, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández:
QoS for High-Performance SMT Processors in Embedded Systems. IEEE Micro 24(4): 24-31 (2004) - [c21]Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández, Alex Ramírez, Mateo Valero:
Predictable performance in SMT processors. Conf. Computing Frontiers 2004: 433-443 - [c20]Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández, Alex Ramírez, Mateo Valero:
Implicit vs. Explicit Resource Allocation in SMT Processors. DSD 2004: 44-51 - [c19]Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández, Alex Ramírez, Mateo Valero:
Feasibility of QoS for SMT. Euro-Par 2004: 535-540 - [c18]Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernández, Alex Ramírez, Mateo Valero:
Enabling SMT for real-time embedded systems. EUSIPCO 2004: 1341-1344 - [c17]Rogier P. J. Pinkers, Peter M. W. Knijnenburg, Masayo Haneda, Harry A. G. Wijshoff:
Statistical Selection of Compiler Options. MASCOTS 2004: 494-501 - 2003
- [j9]Peter M. W. Knijnenburg, Toru Kisuki, Michael F. P. O'Boyle:
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation. J. Supercomput. 24(1): 43-67 (2003) - 2002
- [j8]Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Integrating Loop and Data Transformations for Global Optimization. J. Parallel Distributed Comput. 62(4): 563-590 (2002) - [c16]Grigori Fursin, Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Evaluating Iterative Compilation. LCPC 2002: 362-376 - [c15]Peter M. W. Knijnenburg, Toru Kisuki, Michael F. P. O'Boyle:
Iterative Compilation. Embedded Processor Design Challenges 2002: 171-187 - 2001
- [c14]Peter M. W. Knijnenburg, Toru Kisuki, Kyle A. Gallivan:
Cache Models for Iterative Compilation. Euro-Par 2001: 254-261 - 2000
- [j7]Henri E. Bal, Raoul Bhoedjang, Rutger F. H. Hofman, Ceriel J. H. Jacobs, Thilo Kielmann, Jason Maassen, Rob van Nieuwpoort, John Romain, Luc Renambot, Tim Rühl, Ronald Veldema, Kees Verstoep, Aline Baggio, Gerco Ballintijn, Ihor Kuz, Guillaume Pierre, Maarten van Steen, Andrew S. Tanenbaum, Gerben Doornbos, Desmond Germans, Hans J. W. Spoelder, Evert Jan Baerends, Stan J. A. van Gisbergen, Hamid Afsermanseh, G. Dick van Albada, Adam Belloum, David Dubbeldam, Zeger W. Hendrikse, Louis O. Hertzberger, Alfons G. Hoekstra, Kamil Iskra, Drona Kandhai, Dennis C. Koelma, Frank van der Linden, Benno J. Overeinder, Peter M. A. Sloot, Piero Spinnato, Dick H. J. Epema, Arjan J. C. van Gemund, Pieter P. Jonker, Andrei Radulescu, Kees van Reeuwijk, Henk J. Sips, Peter M. W. Knijnenburg, Michael S. Lew, Floris Sluiter, Lex Wolters, Hans Blom, Cees de Laat:
The Distributed ASCI Supercomputer Project. ACM SIGOPS Oper. Syst. Rev. 34(4): 76-96 (2000) - [c13]Toru Kisuki, Peter M. W. Knijnenburg, Michael F. P. O'Boyle:
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation. IEEE PACT 2000: 237-248
1990 – 1999
- 1999
- [j6]Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Nonsingular Data Transformations: Definition, Validity, and Applications. Int. J. Parallel Program. 27(3): 131-159 (1999) - [c12]Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Efficient Parallelization Using Combined Loop and Data Transformations. IEEE PACT 1999: 283-292 - [c11]Michel Barreteau, François Bodin, Zbigniew Chamski, Henri-Pierre Charles, Christine Eisenbeis, John R. Gurd, Jan Hoogerbrugge, Ping Hu, William Jalby, Toru Kisuki, Peter M. W. Knijnenburg, Paul van der Mark, Andy Nisbet, Michael F. P. O'Boyle, Erven Rohou, André Seznec, Elena Stöhr, Menno Treffers, Harry A. G. Wijshoff:
OCEANS - Optimising Compilers for Embedded Applications. Euro-Par 1999: 1171-1175 - [c10]Toru Kisuki, Peter M. W. Knijnenburg, Michael F. P. O'Boyle, François Bodin, Harry A. G. Wijshoff:
A Feasibility Study in Iterative Compilation. ISHPC 1999: 121-132 - 1998
- [j5]Aart J. C. Bik, Peter Brinkhaus, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
The Automatic Generation of Sparse Primitives. ACM Trans. Math. Softw. 24(2): 190-225 (1998) - [c9]Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Integrating Loop and Data Transformations for Global Optimization. IEEE PACT 1998: 12- - [c8]Michel Barreteau, François Bodin, Peter Brinkhaus, Zbigniew Chamski, Henri-Pierre Charles, Christine Eisenbeis, John R. Gurd, Jan Hoogerbrugge, Ping Hu, William Jalby, Peter M. W. Knijnenburg, Michael F. P. O'Boyle, Erven Rohou, Rizos Sakellariou, André Seznec, Elena Stöhr, Menno Treffers, Harry A. G. Wijshoff:
OCEANS: Optimising Compilers for Embedded Applications. Euro-Par 1998: 1123-1130 - [c7]Rizos Sakellariou, Christine Eisenbeis, Peter M. W. Knijnenburg:
Efficient implementation of the row-column 8×8 IDCT on VLIW architectures. EUSIPCO 1998: 1-4 - 1997
- [j4]Peter M. W. Knijnenburg, Joost N. Kok:
The Semantics of the Combination of Atomized Statements and Parallel Choice. Formal Aspects Comput. 9(5-6): 518-536 (1997) - [c6]Bas Aarts, Michel Barreteau, François Bodin, Peter Brinkhaus, Zbigniew Chamski, Henri-Pierre Charles, Christine Eisenbeis, John R. Gurd, Jan Hoogerbrugge, Ping Hu, William Jalby, Peter M. W. Knijnenburg, Michael F. P. O'Boyle, Erven Rohou, Rizos Sakellariou, Henk Schepers, André Seznec, Elena Stöhr, Marco Verhoeven, Harry A. G. Wijshoff:
OCEANS: Optimizing Compilers for Embedded Applications. Euro-Par 1997: 1351-1356 - [c5]Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Non-Singular Data Transformations: Definition, Validity and Applications. International Conference on Supercomputing 1997: 309-316 - 1996
- [j3]Peter M. W. Knijnenburg:
A Note on the Smyth Powerdomain Construction. Fundam. Informaticae 26(2): 133-139 (1996) - 1994
- [j2]Peter M. W. Knijnenburg, Frank Nordemann:
Partial Hyperdoctrines: Categorical Models for Partial Function Logic and Hoare Logic. Math. Struct. Comput. Sci. 4(2): 117-146 (1994) - [c4]Aart J. C. Bik, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Reshaping Access Patterns for Generating Sparse Codes. LCPC 1994: 406-420 - 1993
- [c3]Joost N. Kok, Peter M. W. Knijnenburg:
Divergence Models for Atomized Statements and Parallel Choice. ISTCS 1993: 231-239 - 1992
- [c2]Peter M. W. Knijnenburg, Frank Nordemann:
A Categorical Interpretation of Partial Function Logic and Hoare Logic. LFCS 1992: 229-240 - 1991
- [j1]Peter M. W. Knijnenburg, Jan van Leeuwen:
On Models for Propositional Dynamic Logic. Theor. Comput. Sci. 91(2): 181-203 (1991) - [c1]Peter M. W. Knijnenburg, Joost N. Kok:
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). FCT 1991: 297-306
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:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint