{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:02:29Z","timestamp":1648929749878},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":["Performance Evaluation"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-5316(01)00050-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:12:57Z","timestamp":1027617177000},"page":"193-218","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling memory accesses through a shared bus"],"prefix":"10.1016","volume":"46","author":[{"given":"Eli","family":"Almog","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-5316(01)00050-5_BIB1","unstructured":"H. Alborzi, E. Torng, P. Uthaisombut, S. Wagner, The k-client problem, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997, pp. 73\u201382."},{"issue":"2","key":"10.1016\/S0166-5316(01)00050-5_BIB2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/2.17","article-title":"Sequoia: a fault-tolerant tightly coupled multiprocessor for transaction processing","volume":"21","author":"Bernstein","year":"1988","journal-title":"Computer"},{"key":"10.1016\/S0166-5316(01)00050-5_BIB3","doi-asserted-by":"crossref","unstructured":"R. Bhatia, S. Khuller, J. Naor, The loading time scheduling problem, in: Proceedings of the 36th IEEE Conference on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 72\u201381.","DOI":"10.1109\/SFCS.1995.492464"},{"key":"10.1016\/S0166-5316(01)00050-5_BIB4","unstructured":"A. Borodin, R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998."},{"key":"10.1016\/S0166-5316(01)00050-5_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","article-title":"A theory of plan merging","volume":"57","author":"Foulser","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/S0166-5316(01)00050-5_BIB6","first-page":"303","article-title":"Approximation algorithms for the shortest common supersequence","volume":"2","author":"Fraser","year":"1995","journal-title":"Nord. J. Comp."},{"key":"10.1016\/S0166-5316(01)00050-5_BIB7","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0166-5316(01)00050-5_BIB8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF01934067","article-title":"The string merging problem","volume":"21","author":"Itoga","year":"1981","journal-title":"BIT"},{"issue":"5","key":"10.1016\/S0166-5316(01)00050-5_BIB9","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1137\/S009753979223842X","article-title":"On the approximation of shortest common supersequences and longest common subsequences","volume":"24","author":"Jiang","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-5316(01)00050-5_BIB10","unstructured":"E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Z\u00ecpkin (Eds.), Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, Vol. 4, North-Holland, Amsterdam, 1990."},{"issue":"2","key":"10.1016\/S0166-5316(01)00050-5_BIB11","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-5316(01)00050-5_BIB12","unstructured":"R. Motwani, S. Phillips, E. Torng, Non-clairvoyant scheduling, in: Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 422\u2013431."},{"issue":"1","key":"10.1016\/S0166-5316(01)00050-5_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/40.521","article-title":"The balance multiprocessor system","volume":"8","author":"Thakkar","year":"1988","journal-title":"IEEE Micro"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531601000505?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531601000505?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T11:57:36Z","timestamp":1555761456000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531601000505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166531601000505"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(01)00050-5","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}