{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T22:52:49Z","timestamp":1683067969285},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0167-8191(94)90110-4","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"15-28","source":"Crossref","is-referenced-by-count":14,"title":["Scheduling independent multiprocessor tasks on a uniform k-processor system"],"prefix":"10.1016","volume":"20","author":[{"given":"J","family":"B\u0142a\u0142ewicz","sequence":"first","affiliation":[]},{"given":"M","family":"Drozdowski","sequence":"additional","affiliation":[]},{"given":"G","family":"Schmidt","sequence":"additional","affiliation":[]},{"given":"D","family":"de Werra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90110-4_BIB1","first-page":"1109","article-title":"Fault tolerance: the survival attribute of digital systems","volume":"66","author":"Avizienis","year":"1978"},{"key":"10.1016\/0167-8191(94)90110-4_BIB2","series-title":"Introduction to Sequenching and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/0167-8191(94)90110-4_BIB3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"C35","author":"B\u0142a\u0142ewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90110-4_BIB4","unstructured":"J. B\u0142\u0142ewicz, M. Drozdowski, G. Schmidt and D. de Werra, Scheduling independent multiprocessor tasks on a uniform k-processor system, Report R-92\/030, Institute of Computing Science, Technical University of Pozna\u0144, Poland."},{"key":"10.1016\/0167-8191(94)90110-4_BIB5","series-title":"Scheduling in Computer and Manufacturing Systems","author":"B\u0142a\u0142ewicz","year":"1992"},{"key":"10.1016\/0167-8191(94)90110-4_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(88)90209-8","article-title":"Preemptive scheduling of independent jobs on a hypercube","volume":"28","author":"Chen","year":"1988","journal-title":"IPL"},{"key":"10.1016\/0167-8191(94)90110-4_BIB7","series-title":"Computer and Job-Shop Scheduling Theory","author":"Coffman","year":"1976"},{"key":"10.1016\/0167-8191(94)90110-4_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0165-6074(81)90050-8","article-title":"On diagnosibility of self-testing multimicroprocessor systems","volume":"7","author":"Dal Cin","year":"1981","journal-title":"Microprocessing and Microprogramming"},{"key":"10.1016\/0167-8191(94)90110-4_BIB9","series-title":"Parallel Processing, The Cm\u2217 Experience","author":"Gehringer","year":"1987"},{"key":"10.1016\/0167-8191(94)90110-4_BIB10","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"12","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-8191(94)90110-4_BIB11","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","article-title":"Preemptive scheduling of uniform processor systems","volume":"25","author":"Gonzalez","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(94)90110-4_BIB12","series-title":"Mathematical Programming: The State of Art","first-page":"200","article-title":"Recent results in theory of machine scheduling","author":"Lawler","year":"1983"},{"key":"10.1016\/0167-8191(94)90110-4_BIB13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01920917","article-title":"Scheduling on semi-identical processors","volume":"28","author":"Schmidt","year":"1984","journal-title":"Z. Oper. Res. Theory"},{"issue":"1","key":"10.1016\/0167-8191(94)90110-4_BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0167-8191(94)90110-4_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(91)90201-R","article-title":"Scheduling on a hypercube","volume":"40","author":"Shen","year":"1991","journal-title":"Informat. Processing Lett."},{"key":"10.1016\/0167-8191(94)90110-4_BIB16","series-title":"Hard Real-Time Systems","author":"Stankovic","year":"1988"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T09:57:30Z","timestamp":1585130250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194901104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0167819194901104"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90110-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}