Bounding preemption delay within data cache reference patterns for real-time tasks

Published in Ramaprasad, H., & Mueller, F. (2006). Bounding preemption delay within data cache reference patterns for real-time tasks. Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium, 2006, 71- 80. doi: 10.1109/RTAS.2006.14 ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. This Article is brought to you for free and open access by the Department of Electrical and Computer Engineering at OpenSIUC. It has been accepted for inclusion in Conference Proceedings by an authorized administrator of OpenSIUC. For more information, please contact opensiuc@lib.siu.edu