{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:39Z","timestamp":1755221019955,"version":"3.43.0"},"reference-count":20,"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:1020232013487","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:37:24Z","timestamp":1047717444000},"page":"273-295","source":"Crossref","is-referenced-by-count":10,"title":["Utilization Based Schedulability Bounds for Age Constraint Process Sets in Real-Time Systems"],"prefix":"10.1007","volume":"23","author":[{"given":"Lars","family":"Lundberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5096706_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, W., and Wisser, R. 1997. Schedulers for age constraint tasks and their performance evaluation. In Proceedings of the Third International EuroPar Conference. Passau, Germany.","DOI":"10.1007\/BFb0002884"},{"key":"5096706_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, W., and Z\u00f6bel, D. 1997. Integrating fixed priority and static scheduling to maintain external consitency. Technical report. http:\/\/www.uni-koblenz.de\/fb4\/publikationen\/gelberihe\/RR-9-97.ps.gz","DOI":"10.1007\/978-1-4615-6069-2_6"},{"key":"5096706_CR3","doi-asserted-by":"crossref","unstructured":"Audsley, N., Burns, A., Richardson, M., and Wellings, A. 1992. Absolute and relative temporal constraints in hard real-time databases. In Proceedings of IEEE Euromicro Workshop on Real-Time Systems. Los Alamitos, California.","DOI":"10.1109\/EMWRT.1992.637486"},{"key":"5096706_CR4","doi-asserted-by":"crossref","unstructured":"Audsley, N., Burns, A., Richardson, M., and Wellings, A. 1993. The end of the line for static cyclic scheduling? In Proceedings of Euromicro Workshop on Real-Time Systems. Oulu, Finland, pp. 36-41.","DOI":"10.1109\/EMWRT.1993.639042"},{"key":"5096706_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(96)00060-9","volume":"58","author":"A. Burns","year":"1996","unstructured":"Burns, A., and Davis, R. 1996. Choosing task periods to minimise system utilisation in time triggered systems. Information Processing Letters 58: 223-229.","journal-title":"Information Processing Letters"},{"key":"5096706_CR6","unstructured":"Burns, A., and Wellings, A. 1996. Real-Time Systems and Programming Languages. Addison-Wesley."},{"key":"5096706_CR7","unstructured":"Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. W.H. Freeman and company."},{"key":"5096706_CR8","first-page":"1239","volume":"II","author":"E. S. H. Hou","year":"1990","unstructured":"Hou, E. S. H., Hong, R., and Ansari, N. 1990. Efficient multiprocessor scheduling based on genetic algorithms. 16th Annual Conference of the IEEE Industrial Electronics Society, Vol II, pp. 1239-1243.","journal-title":"Efficient multiprocessor scheduling based on genetic algorithms"},{"key":"5096706_CR9","doi-asserted-by":"crossref","unstructured":"Kopetz, H. 1998. The time-triggered model of computation. In Proceedings of the IEEE Real-Time Systems Symposium. Madrid, Spain, pp. 168-177.","DOI":"10.1109\/REAL.1998.739743"},{"key":"5096706_CR10","doi-asserted-by":"crossref","unstructured":"Lehoczky, J. P. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of the 11th Real-Time Systems Symposium, pp. 201-209.","DOI":"10.1109\/REAL.1990.128748"},{"key":"5096706_CR11","unstructured":"Lehoczky, J. P., Sha, L., and Ding, Y. 1989. The rate monotone scheduling algorithm: exact characterization and average case behavior. In Proceedings of IEEE 10th Real-Time Systems Symposium."},{"key":"5096706_CR12","doi-asserted-by":"crossref","unstructured":"Leung, J., and Whitehead, J. 1980. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation 237-250.","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"5096706_CR13","doi-asserted-by":"crossref","unstructured":"Liu, C., and Leyland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 46-61.","DOI":"10.1145\/321738.321743"},{"key":"5096706_CR14","doi-asserted-by":"crossref","unstructured":"Lundberg, L. 1998a. Fixed priority scheduling of age constraint processes. In Proceedings of EuroPar-98. Southampton, England, pp. 288-296.","DOI":"10.1007\/BFb0057864"},{"key":"5096706_CR15","doi-asserted-by":"crossref","unstructured":"Lundberg, L. 1998b. Multiprocessor scheduling of age constraint processes. In Proceedings of the Fifth IEEE International Conference on Real-Time Computing Systems and Applications. Hiroshima, Japan pp. 42-47.","DOI":"10.1109\/RTCSA.1998.726350"},{"key":"5096706_CR16","doi-asserted-by":"crossref","unstructured":"Lundberg, L., and Lennerstad, H. 1998. Using recorded values for bounding the minimum completion time in multiprocessors. IEEE Transactions on Parallel and Distributed Systems, pp. 346-358.","DOI":"10.1109\/71.667896"},{"key":"5096706_CR17","doi-asserted-by":"crossref","unstructured":"Nanda, A. K., DeGroot, D., and Stenger, D. L. 1992. Scheduling directed task graphs on multiprocessors using simulated annealing. In Proceedings of the IEEE 12th International Conference on Distributed Systems, pp. 20-27.","DOI":"10.1109\/ICDCS.1992.235059"},{"key":"5096706_CR18","unstructured":"Nissanke, N. 1997. Realtime Systems. Prentice Hall."},{"key":"5096706_CR19","unstructured":"Song, X., and Liu, J. 1992. How well can data temporal consistency be maintained. In Proceedings of the 1992 IEEE Symposium on Computer Aided Control Systems Design. Napa, California, USA."},{"issue":"2","key":"5096706_CR20","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 analysing fixed priority hard real-time tasks. Real-Time Systems 6(2): 133-151.","journal-title":"Real-Time Systems"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020232013487.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020232013487\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020232013487.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T07:24:22Z","timestamp":1754637862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020232013487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5096706"],"URL":"https:\/\/doi.org\/10.1023\/a:1020232013487","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}