{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:22Z","timestamp":1725467362425},"publisher-location":"Boston","reference-count":6,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402077769"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-23484-5_38","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T09:56:37Z","timestamp":1153130197000},"page":"387-394","source":"Crossref","is-referenced-by-count":0,"title":["Improvement of the processors operating ratio in task scheduling using the deadline method"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Kashiwagi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshinobu","family":"Higami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Ya","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"K. Kashiwagj and S. Kobayashi, \u201cLimitation of used processor for task scheduling,\u201d Proc. 19st IASTED International Multi-Conf. Applied Informatics, pp.122\u2013126, Innsbruck, Austria, Feb. 2001."},{"key":"38_CR2","first-page":"487","volume":"VTI-9","author":"K. Kashiwagj","year":"2001","unstructured":"K. Kashiwagj and S. Kobayashi, \u201cConsideration of task\u2019s deadline for cheduling method with used processors limitation,\u201d Proc. Advanced Computer Systems, no. VTI-9, pp.487\u2013496, Memo, Poland, Oct. 2001.","journal-title":"Proc. Advanced Computer Systems"},{"issue":"11","key":"38_CR3","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","volume":"33","author":"H. Kasahara","year":"1984","unstructured":"H. Kasahara and S. Narita, \u201cPractical multiprocessor scheduling algorithms for efficient parallel processing,\u201d IEEE Trans. Computers, no.33(11), pp. 1023\u20131029, 1984.","journal-title":"IEEE Trans. Computers"},{"key":"38_CR4","volume-title":"Parallel & distributed computing handbook","author":"A. Y. Zomaya","year":"1996","unstructured":"Albert Y. Zomaya, Parallel & distributed computing handbook, McGraw-Hill, New York, 1996."},{"key":"38_CR5","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"1994","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Introduction to algorithms, The MIT Press, Massachusetts, 1994."},{"key":"38_CR6","unstructured":"H. Hashimoto, K. Kashiwagi, Y. Higami and S. Kobayashi, \u201cHow to limit the number of available processors for every task in scheduling\u201d, Proc. SJCIEE2001 (Japanese), Sept. 2001."}],"container-title":["Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-23484-5_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T04:43:13Z","timestamp":1619498593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-23484-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402077769"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/0-387-23484-5_38","relation":{},"subject":[]}}