{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T11:24:47Z","timestamp":1656761087623},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0164-1212(00)00099-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T20:48:11Z","timestamp":1034628491000},"page":"213-229","source":"Crossref","is-referenced-by-count":8,"title":["An optimal scheduling algorithm for minimizing the computing period of cyclic synchronous tasks on multiprocessors"],"prefix":"10.1016","volume":"56","author":[{"given":"Hee-Jun","family":"Park","sequence":"first","affiliation":[]},{"given":"Byung Kook","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(00)00099-6_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1982.1653938","article-title":"Data flow languages","volume":"15","author":"Ackerman","year":"1982","journal-title":"Computer"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB2","unstructured":"Analog Devices, 1995. ADSP-2106x SHARC User's Manual"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB3","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1987.1676922","article-title":"Interprocessor traffic scheduling algorithm for multiple-processor networks","volume":"36","author":"Bianchini","year":"1987","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB4","series-title":"Parallel Computer Architecture","author":"Cullar","year":"1997"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB5","unstructured":"Davari, S., Dhall, S.K., 1986. An on line algorithm for real-time tasks allocation. in: Proceedings of the IEEE Real-Time Systems Symposium, pp. 194\u2013200"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1980.1653418","article-title":"Data flow supercomputers","volume":"13","author":"Dennis","year":"1980","journal-title":"Computer"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB7","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB8","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1109\/71.242159","article-title":"Prediction-based dynamic load-sharing heuristics","volume":"4","author":"Goswami","year":"1993","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB9","series-title":"Advanced Computer Architecture","author":"Hwang","year":"1993"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB10","series-title":"Distributed Objects: Methodologies for Customizing Systems Software","author":"Islam","year":"1996"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB11","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1109\/29.61542","article-title":"Task allocation and scheduling models for multiprocessor digital signal processing","volume":"38","author":"Konstantinides","year":"1990","journal-title":"IEEE Trans. Acoustics, Speech and Signal Processing"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB12","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1109\/78.370642","article-title":"A note on task allocation and scheduling models for multiprocessor digital signal processing","volume":"43","author":"Krishnan","year":"1995","journal-title":"IEEE Trans. Signal Processing"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TC.1987.5009446","article-title":"Static scheduling of synchronous data flow programs for digital signal processing","volume":"36","author":"Lee","year":"1987","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/71.577254","article-title":"Optimal task assignment in homogeneous networks","volume":"8","author":"Lee","year":"1997","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB15","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","article-title":"Heuristic algorithms for tasks assignment in distributed systems","volume":"37","author":"Lo","year":"1988","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB16","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB17","series-title":"Modeling and Simulation of Power Generation Plants","author":"Ordys","year":"1994"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/TC.1972.5008918","article-title":"Optimal scheduling strategies in a multiprocessor system","volume":"21","author":"Ramamoorthy","year":"1972","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB19","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1080\/00207729108910740","article-title":"Task allocation model for distributed systems","volume":"22","author":"Sagar","year":"1991","journal-title":"Int. J. Systems Sci."},{"key":"10.1016\/S0164-1212(00)00099-6_BIB20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/71.207593","article-title":"A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures","volume":"4","author":"Sih","year":"1993","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB21","unstructured":"Texas Instruments, 1993. TMS320C4x Parallel Processing Development System Technical Reference"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB22","unstructured":"Texas Instruments, 1995. TMS320C8x System-Level Synopsis"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB24","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1982.1653941","article-title":"A practical data flow computer","volume":"15","author":"Watson","year":"1982","journal-title":"Computer"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/71.577261","article-title":"On runtime parallel scheduling for processor load balancing","volume":"8","author":"Wu","year":"1997","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0164-1212(00)00099-6_BIB26","series-title":"Linear and Integer Programming","author":"Zionts","year":"1974"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121200000996?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121200000996?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T01:56:28Z","timestamp":1555898188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121200000996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0164121200000996"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(00)00099-6","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}