- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c9 |      | Abhik Sarkar, Frank Mueller, Harini Ramaprasad: Static task partitioning for locked caches in multi-core real-time systems. CASES 2012: 161-170 |
| c8 | | Mayank Shekhar, Abhik Sarkar, Harini Ramaprasad, Frank Mueller: Semi-Partitioned Hard-Real-Time Scheduling under Locked Cache Migration in Multicore Systems. ECRTS 2012: 331-340 |
| 2011 | ||
| c7 | | Abhik Sarkar, Frank Mueller, Harini Ramaprasad: Predictable task migration for locked caches in multi-core systems. LCTES 2011: 131-140 |
| 2010 | ||
| j1 | | Harini Ramaprasad, Frank Mueller: Tightening the bounds on feasible preemptions. ACM Trans. Embedded Comput. Syst. 10(2): 27 (2010) |
| 2009 | ||
| c6 | | Abhik Sarkar, Frank Mueller, Harini Ramaprasad, Sibin Mohan: Push-assisted migration of real-time tasks in multi-core processors. LCTES 2009: 80-89 |
| c5 | | Harini Ramaprasad, Frank Mueller: Bounding Worst-Case Response Times of Tasks under PIP. IEEE Real-Time and Embedded Technology and Applications Symposium 2009: 183-192 |
| 2008 | ||
| c4 | | Harini Ramaprasad, Frank Mueller: Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions. IEEE Real-Time and Embedded Technology and Applications Symposium 2008: 58-67 |
| 2006 | ||
| c3 | | Harini Ramaprasad, Frank Mueller: Bounding Preemption Delay within Data Cache Reference Patterns for Real-Time Tasks. IEEE Real Time Technology and Applications Symposium 2006: 71-80 |
| c2 | | Harini Ramaprasad, Frank Mueller: Tightening the Bounds on Feasible Preemption Points. RTSS 2006: 212-224 |
| 2005 | ||
| c1 | | Harini Ramaprasad, Frank Mueller: Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns. IEEE Real-Time and Embedded Technology and Applications Symposium 2005: 148-157 |
| 1 | Sibin Mohan | |
| 2 | Frank Mueller | |
| 3 | Abhik Sarkar | |
| 4 | Mayank Shekhar |
Data released under the ODC-BY 1.0 license — See also our legal information page