Refereed journal publications

  • H. Ramaprasad and F. Mueller. Tightening the Bounds on Feasible Preemptions. To appear in Transactions on Embedded Computing Systems (TECS), 2007.

Refereed conference publications

  • H. Ramaprasad and F. Mueller. Bounding Worst-Case Response Time for Tasks With Non-Preemptive Regions. To appear in Proc. of the Real-Time and Embedded Technology and Applications Symposium (RTAS), 2008. [PDF]
  • H. Ramaprasad and F. Mueller. Tightening the Bounds on Feasible Preemption Points. In Proc. of the Real-Time Systems Symposium (RTSS), December 2006, pages 212-222. [PDF]
  • H. Ramaprasad and F. Mueller. Bounding Preemption Delay within Data Cache Reference Patterns for Real-Time Tasks. In Proc. of the Real-Time and Embedded Technology and Applications Symposium (RTAS), April 2006, pages 71-80. [PDF]
  • H. Ramaprasad and F. Mueller. Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns. In Proc. of the Real-Time and Embedded Technology and Applications Symposium (RTAS), March 2005, pages 148-157. [PDF]

Posters

  • H. Ramaprasad and F. Mueller. Feasible Preemption Point Analysis for Data Cache Reference Patterns. ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), June 2006. [PDF]
  • H. Ramaprasad and F. Mueller. Deriving Data Cache Reference Patterns From Cache Miss Equations. ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), June 2004. [PDF]