{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T23:02:07Z","timestamp":1757545327492,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Systems"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1020227912579","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:37:24Z","timestamp":1047717444000},"page":"209-238","source":"Crossref","is-referenced-by-count":3,"title":["Analysis of Worst Case DMA Response Time in a Fixed-Priority Bus Arbitration Protocol"],"prefix":"10.1007","volume":"23","author":[{"given":"Joosun","family":"Hahn","sequence":"first","affiliation":[]},{"given":"Rhan","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Sang Lyul","family":"Min","sequence":"additional","affiliation":[]},{"given":"Jane W.-S.","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5096704_CR1","volume-title":"Compilers Principles, Techniques, and Tools","author":"A. V. Aho","year":"1988","unstructured":"Aho, A. V., Sethi, R., and Ullman, J. D. 1988. Compilers Principles, Techniques, and Tools. Reading, MA: Addison-Wesley Publishing Company."},{"issue":"5","key":"5096704_CR2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/32.387477","volume":"21","author":"A. Burns","year":"1995","unstructured":"Burns, A., Tindell, K., and Wellings, A. 1995. Effective analysis for engineering real-time fixed priority schedulers. IEEE Transactions on Software Engineering 21(5): 475-480.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5096704_CR3","volume-title":"Crafting a Compiler with C","author":"C. N. Fischer","year":"1991","unstructured":"Fischer, C. N., and LeBlanc, R. J. 1991. Crafting a Compiler with C. Redwood City, CA: The Benjamin\/Cummings Publishing Company, Inc."},{"key":"5096704_CR4","unstructured":"Huang, T.-Y. 1997. Worst-case timing analysis of concurrently executing DMA I\/O and programs. Ph.D. thesis, University of Illinois at Urbana-Champaign."},{"issue":"5","key":"5096704_CR5","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1093\/comjnl\/29.5.390","volume":"29","author":"M. Joseph","year":"1986","unstructured":"Joseph, M. and Pandya, P. 1986. Finding response times in a real-time system. The BCS Computer Journal 29(5): 390-395.","journal-title":"The BCS Computer Journal"},{"key":"5096704_CR6","volume-title":"MIPS RISC Architecture","author":"G. Kane","year":"1992","unstructured":"Kane, G., and Heinrich, J. 1992. MIPS RISC Architecture. Englewood Cliffs, NJ: Prentice Hall."},{"issue":"9","key":"5096704_CR7","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1109\/32.241774","volume":"19","author":"D. I. Katcher","year":"1993","unstructured":"Katcher, D. I., Arakawa, H., and Strosnider, J. K. 1993. Engineering and analysis of fixed priority schedulers. IEEE Transactions on Software Engineering 19(9): 920-934.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5096704_CR8","unstructured":"Kim, S.-K., Min, S. L., and Ha, R. 1996. Efficient worst case timing analysis of data caching. In Proceedings of the Second Real-Time Technology and Applications Symposium, pp. 230-240."},{"key":"5096704_CR9","doi-asserted-by":"crossref","unstructured":"Lam, M. S., and Wilson, R. P. 1992. Limits of control flow on parallelism. In Proceedings of the 19th Annual International Symposium on Computer Architecture, pp. 46-57.","DOI":"10.1109\/ISCA.1992.753303"},{"key":"5096704_CR10","unstructured":"Lee, C.-G., Hahn, J., Seo, Y.-M., Min, S. L., Ha, R., Hong, S., Park, C. Y., Lee, M., and Kim, C. S. 1996. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. In Proceedings of the 17th Real-Time Systems Symposium, pp. 264-274."},{"key":"5096704_CR11","unstructured":"Lee, C.-G., Hahn, J., Seo, Y.-M., Min, S. L., Ha, R., Hong, S., Park, C. Y., Lee, M., and Kim, C. S. 1997. Enhanced analysis of cache-related preemption delay in fixed-priority preemptive scheduling. In Proceedings of the 18th Real-Time Systems Symposium, pp. 187-198."},{"key":"5096704_CR12","doi-asserted-by":"crossref","unstructured":"Lehoczky, J. P., Sha, L., and Ding, Y. 1989. The rate monotonic scheduling algorithm\u2014exact chracterization and average case behavior. In Proceedings of the 10th Real-Time Systems Symposium, pp. 166-171.","DOI":"10.1109\/REAL.1989.63567"},{"issue":"7","key":"5096704_CR13","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/32.392980","volume":"21","author":"S.-S. Lim","year":"1995","unstructured":"Lim, S.-S., Bae, Y. H., Jang, G. T., Rhee, B.-D., Min, S. L., Park, C. Y., Shin, H., Park, K., Moon, S.-M., and Kim, C. S. 1995. An accurate worst case timing analysis for RISC processors. IEEE Transactions on Software Engineering 21(7): 593-604.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"5096704_CR14","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. L. Liu","year":"1973","unstructured":"Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1): 46-61.","journal-title":"Journal of the ACM"},{"issue":"1","key":"5096704_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01088696","volume":"5","author":"C. Y. Park","year":"1993","unstructured":"Park, C. Y. 1993. Predicting program execution times by analyzing static and dynamic program paths. Journal of Real-Time Systems 5(1): 31-62.","journal-title":"Journal of Real-Time Systems"},{"issue":"2","key":"5096704_CR16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00571421","volume":"1","author":"P. Puschner","year":"1989","unstructured":"Puschner, P., and Koza, C. 1989. Calculating the maximum execution time of real-time programs. Journal of Real-Time Systems 1(2): 159-176.","journal-title":"Journal of Real-Time Systems"},{"key":"5096704_CR17","unstructured":"Rogers, A., and Rosenberg, S. 1993. Cycle level SPIM. Technical Report, Dept. of Computer Science, Princeton University."},{"key":"5096704_CR18","unstructured":"Tindell, K. 1994. Adding time-offsets to schedulability analysis. Technical Report YCS 221, Dept. of Computer Science, University of York."},{"issue":"2","key":"5096704_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01088593","volume":"6","author":"K. Tindell","year":"1994","unstructured":"Tindell, K., Burns, A., and Wellings, A. 1994. An extendible approach for analyzing fixed priority hard real-time tasks. Journal of Real-Time Systems 6(2): 133-151.","journal-title":"Journal of Real-Time Systems"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020227912579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020227912579\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020227912579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T07:24:16Z","timestamp":1754637856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020227912579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5096704"],"URL":"https:\/\/doi.org\/10.1023\/a:1020227912579","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}