{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:32:54Z","timestamp":1767652374175},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"University of Engineering and Technology\u2014Vietnam National University, Hanoi","award":["CN.13.01"],"award-info":[{"award-number":["CN.13.01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tc.2014.2346178","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T18:35:33Z","timestamp":1407436533000},"page":"1805-1818","source":"Crossref","is-referenced-by-count":8,"title":["An <sc>fptas<\/sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation"],"prefix":"10.1109","volume":"64","author":[{"given":"Thi Huyen Chau","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Grolleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-005-0507-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2516821.2516831"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2005.1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.167"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-009-9078-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"ref15","article-title":"The fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines revisited","author":"nguyen","year":"0","journal-title":"Proc Int Conf Real-Time Netw Syst"},{"key":"ref16","first-page":"105","article-title":"Efficient computation of response time bounds under fixed-priority scheduling","author":"bini","year":"0","journal-title":"Proc Int Conf Real-Time Netw Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1989.63567"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.5.390"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007964900035"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-009-9071-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.66"},{"key":"ref27","first-page":"233","article-title":"A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines","author":"fisher","year":"0","journal-title":"Proc Int Conf Real-Time Netw Syst"},{"key":"ref3","author":"audsley","year":"1991","journal-title":"Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-012-9156-y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2010.40"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.25"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2362336.2362352"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.21"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2003.1223647"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in hard real-time environment","volume":"20","author":"c","year":"1973","journal-title":"J ACM"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1998.739773"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2013.31"},{"key":"ref21","first-page":"13","article-title":"Initial values for on-line response time calculations","author":"bril","year":"0","journal-title":"Proc Euromicro Conf Real-Time Systems"},{"key":"ref24","article-title":"Approximating response times for static-priority tasks with release jitters","author":"richard","year":"0","journal-title":"Proc WIP Euromicro Int Conf Real-Time Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1990.128748"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2002.1181571"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-011-9137-6"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7118804\/06873248.pdf?arnumber=6873248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:42:24Z","timestamp":1642005744000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6873248\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":31,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2346178","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}