 | 2010 |
| 10 |  | Timon D. ter Braak,
Philip K. F. Hölzenspies,
Jan Kuper,
Johann Hurink,
Gerard J. M. Smit:
Run-time spatial resource management for real-time applications on heterogeneous MPSoCs.
DATE 2010: 357-362 |
| 9 |  | Jochem H. Rutgers,
Pascal T. Wolkotte,
Philip K. F. Hölzenspies,
Jan Kuper,
Gerard J. M. Smit:
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits.
DSD 2010: 699-705 |
| 8 |  | Arjan Boeijink,
Philip K. F. Hölzenspies,
Jan Kuper:
Introducing the PilGRIM: A Processor for Executing Lazy Functional Languages.
IFL 2010: 54-71 |
| 7 |  | Philip K. F. Hölzenspies,
Timon D. ter Braak,
Jan Kuper,
Gerard J. M. Smit,
Johann Hurink:
Run-time Spatial Mapping of Streaming Applications to Heterogeneous Multi-Processor Systems.
International Journal of Parallel Programming 38(1): 68-83 (2010) |
| 2008 |
| 6 |  | Philip K. F. Hölzenspies,
Johann Hurink,
Jan Kuper,
Gerard J. M. Smit:
Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC).
DATE 2008: 212-217 |
| 2007 |
| 5 |  | Pascal T. Wolkotte,
Philip K. F. Hölzenspies,
Gerard J. M. Smit:
Using an FPGA for Fast Bit Accurate SoC Simulation.
IPDPS 2007: 1-8 |
| 4 |  | Pascal T. Wolkotte,
Philip K. F. Hölzenspies,
Gerard J. M. Smit:
Fast, Accurate and Detailed NoC Simulations.
NOCS 2007: 323-332 |
| 3 |  | Philip K. F. Hölzenspies,
Jan Kuper,
Gerard J. M. Smit,
Johann Hurink:
Demonstration of Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC).
Quantitative Aspects of Embedded Systems 2007 |
| 2 |  | Gerard J. M. Smit,
André B. J. Kokkeler,
Pascal T. Wolkotte,
Philip K. F. Hölzenspies,
Marcel D. van de Burgwal,
Paul M. Heysters:
The Chameleon Architecture for Streaming DSP Applications.
EURASIP J. Emb. Sys. 2007: (2007) |
| 2003 |
| 1 |  | Philip K. F. Hölzenspies,
Erik Schepers,
Wouter Bach,
Mischa Jonker,
Bart Sikkes,
Gerard J. M. Smit,
Paul J. M. Havinga:
A Communication Model Based on an n-Dimensional Torus Architecture Using Deadlock-Free Wormhole Routing.
DSD 2003: 166-172 |