{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:57:32Z","timestamp":1725559052064},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253396"},{"type":"electronic","value":"9783540319566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31956-6_35","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T21:00:56Z","timestamp":1278536456000},"page":"296-305","source":"Crossref","is-referenced-by-count":4,"title":["Holistic and Trajectory Approaches for Distributed Non-preemptive FP\/DP* Scheduling"],"prefix":"10.1007","author":[{"given":"Steven","family":"Martin","sequence":"first","affiliation":[]},{"given":"Pascale","family":"Minet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01088855","volume":"9","author":"K. Tindell","year":"1995","unstructured":"Tindell, K., Burns, A., Wellings, A.J.: Analysis of hard real-time communications. Real-Time Systems\u00a09, 147\u2013171 (1995)","journal-title":"Real-Time Systems"},{"key":"35_CR2","volume-title":"Real-time systems","author":"J. Liu","year":"2000","unstructured":"Liu, J.: Real-time systems. Prentice Hall, New Jersey (2000)"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01995675","volume":"2","author":"S. Baruah","year":"1990","unstructured":"Baruah, S., Howell, R., Rosier, L.: Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems\u00a02, 301\u2013324 (1990)","journal-title":"Real-Time Systems"},{"key":"35_CR4","unstructured":"Martin, S., Minet, P.: Worst case end-to-end response times for non-preemptive FP\/DP* scheduling. INRIA Research Report, No 5418 (December 2004)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Tindell, K., Clark, J.: Holistic schedulability analysis for distributed hard real-time systems. Microprocessors and Microprogramming, Euromicro Jal\u00a040 (1994)","DOI":"10.1016\/0165-6074(94)90080-9"},{"key":"35_CR6","unstructured":"Spuri, M.: Holistic analysis for deadline scheduled real-time distributed systems, INRIA Research Report No 2873 (April 1996)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-45318-0_1","volume-title":"Network Calculus","author":"J. Boudec Le","year":"2001","unstructured":"Le Boudec, J., Thiran, P.: Network calculus: A theory of deterministic queuing systems for the Internet. In: Thiran, P., Le Boudec, J.-Y. (eds.) Network Calculus. LNCS, vol.\u00a02050, p. 3. Springer, Heidelberg (2001)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in integrated services networks. IEEE ACM Transactions on Networking (1994)","DOI":"10.1109\/90.298432"}],"container-title":["Lecture Notes in Computer Science","Networking - ICN 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31956-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:30:53Z","timestamp":1605760253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31956-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253396","9783540319566"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31956-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}