Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Torgny Andersson
Robert J. Zomer
R. Chandrasekaran
Scott A. Starks
Maaly Nassar
Hui Yu
Hikaru Fujisaki
Michael Terry
Zhihao Li
Radu Timofte
Home
/
Author
/
FLORIAN BRANDNER
Author Info
Open Visualization
Name
Affiliation
Papers
FLORIAN BRANDNER
Tech Univ Denmark, Embedded Syst Engn Sect, DK-2800 Lyngby, Denmark
29
Collaborators
Citations
PageRank
39
202
14.97
Referers
Referees
References
361
640
337
Search Limit
100
640
Publications (29 rows)
Collaborators (39 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Work-conserving dynamic time-division multiplexing for multi-criticality systems
1
0.37
2020
Building the Case for Temperature Awareness in Energy Consumption Models: an Application of the Energy-Frequency Convexity Rule.
0
0.34
2018
Analysis of preemption costs for the stack cache
0
0.34
2018
Shedding the Shackles of Time-Division Multiplexing
3
0.38
2018
Worst-Case Execution Time Analysis of Predicated Architectures.
0
0.34
2017
Eager Stack Cache Memory Transfers.
0
0.34
2016
Efficient context switching for the stack cache: implementation and analysis
0
0.34
2015
Criticality: static profiling for real-time programs.
5
0.47
2014
Refinement of worst-case execution time bounds by graph pruning.
1
0.36
2014
Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis.
3
0.39
2014
Static analysis of worst-case stack cache behavior
13
0.61
2013
Automatic generation of compiler backends
0
0.34
2013
A time-predictable stack cache
18
0.78
2013
Elimination of parallel copies using code motion on data dependence graphs
0
0.34
2013
Static profiling of the worst-case in real-time programs
7
0.52
2012
Static routing in symmetric real-time network-on-chips
8
0.53
2012
Copy elimination on data dependence graphs
0
0.34
2012
A Statically Scheduled Time-Division-Multiplexed Network-on-Chip for Real-Time Systems
47
1.58
2012
A non-iterative data-flow algorithm for computing liveness sets in strict SSA programs
2
0.37
2011
Towards a Time-predictable Dual-Issue Microprocessor: The Patmos Approach
46
1.70
2011
Modeling application-specific processors for embedded systems.
0
0.34
2011
Studying Optimal Spilling in the Light of SSA
5
0.41
2011
Completeness of automatically generated instruction selectors
1
0.35
2010
RTTM: real-time transactional memory
14
0.73
2010
Embedded JIT Compilation with CACAO on YARI
8
0.54
2009
Precise simulation of interrupts using a rollback mechanism
1
0.36
2009
Stack allocation of objects in the CACAO virtual machine
5
0.51
2009
Generalized instruction selection using SSA-graphs
6
0.47
2008
Compiler generation from structural architecture descriptions
8
0.48
2007
1