J
Jorg Henkel
Researcher at Karlsruhe Institute of Technology
Publications - 581
Citations - 13625
Jorg Henkel is an academic researcher from Karlsruhe Institute of Technology. The author has contributed to research in topics: Computer science & Cache. The author has an hindex of 52, co-authored 545 publications receiving 11773 citations. Previous affiliations of Jorg Henkel include Braunschweig University of Technology & University of Stuttgart.
Papers
More filters
Journal ArticleDOI
Hardware-software cosynthesis for microcontrollers
TL;DR: The authors present a software-oriented approach to hardware-software partitioning which avoids restrictions on the software semantics as well as an iterative partitioning process based on hardware extraction controlled by a cost function.
Proceedings ArticleDOI
Mapping on multi/many-core systems: survey of current and emerging trends
TL;DR: An extensive survey and categorization of state-of-the-art mapping methodologies and highlights the emerging trends for multi/many-core systems.
Proceedings ArticleDOI
A low latency generic accuracy configurable adder
TL;DR: A low-latency generic accuracy configurable adder to support variable approximation modes that provides a higher number of potential configurations compared to state-of-the-art, thus enabling a high degree of design flexibility and trade-off between performance and output quality.
Proceedings ArticleDOI
On-chip networks: a scalable, communication-centric embedded system design paradigm
TL;DR: Trends in system-on-chip designs are discussed, problems and opportunities of the NoC paradigm are critiques, research activities are summarized, and several directions for future research are outlined.
Proceedings ArticleDOI
ADAM: run-time agent-based distributed application mapping for on-chip communication
TL;DR: This work is presenting the first scheme for a runtime application mapping in a distributed manner using agents targeting for adaptive NoC-based heterogeneous multi-processor systems and achieves on an average 7.1 times lower computational effort for the mapping algorithm compared to the simple nearest-neighbor (NN) heuristics proposed in (E. Carvalho et al., 2007).