{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T22:16:18Z","timestamp":1673734578101},"reference-count":22,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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 Architecture"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1383-7621(99)00043-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:33:56Z","timestamp":1049726036000},"page":"851-871","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling optimization through iterative refinement"],"prefix":"10.1016","volume":"46","author":[{"given":"Mayez","family":"Al-Mouhamed","sequence":"first","affiliation":[]},{"given":"Adel","family":"Al-Massarani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/S1383-7621(99)00043-0_BIB1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","article-title":"A comparison of list schedules for parallel processing systems","volume":"17","author":"Adam","year":"1974","journal-title":"Comm. ACM"},{"issue":"12","key":"10.1016\/S1383-7621(99)00043-0_BIB2","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/32.62447","article-title":"Lower bounds on the number of processors and time for scheduling precedence graphs with communication costs","volume":"16","author":"Al-Mouhamed","year":"1990","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/S1383-7621(99)00043-0_BIB3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/71.238623","article-title":"Analysis of macro-dataflow dynamic scheduling on non-uniform memory access architectures","volume":"19","author":"Al-Mouhamed","year":"1993","journal-title":"IEEE Trans. Parallel and Distributed Sys."},{"key":"10.1016\/S1383-7621(99)00043-0_BIB4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"10.1016\/S1383-7621(99)00043-0_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/71.265940","article-title":"A genetic algorithm for multiprocessor scheduling","volume":"5","author":"Hou","year":"1994","journal-title":"IEEE Trans. Parallel and Distributed Sys."},{"key":"10.1016\/S1383-7621(99)00043-0_BIB6","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S1383-7621(99)00043-0_BIB7","doi-asserted-by":"crossref","unstructured":"J.-J. Hwang, Y.-C. Chow, F.D. Anger, C.Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM Computing (1989) 244\u2013257","DOI":"10.1137\/0218016"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB8","first-page":"1","article-title":"A general approach to mapping of parallel computation upon multiprocessor architectures","volume":"3","author":"Kim","year":"1988","journal-title":"Proc. Inter. Conf. Parallel Process."},{"issue":"3","key":"10.1016\/S1383-7621(99)00043-0_BIB9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/43.21844","article-title":"ESP: Placement by simulated evolution","volume":"8","author":"Kling","year":"1989","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB10","unstructured":"B. Kruatrachue, Static task scheduling and grain packing in parallel processing systems, Ph.D. Thesis, Department of Computer Science, Oregon State University, 1987"},{"issue":"5","key":"10.1016\/S1383-7621(99)00043-0_BIB11","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/71.503776","article-title":"Dynamic critical path scheduling: An effective technique for scheduling task graphs onto multiprocessors","volume":"7","author":"Kwok","year":"1996","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB12","unstructured":"Y.-K. Kwok, I. Ahmad, On using task duplication in parallel program scheduling, Under review with IEEE Trans. Parallel and Distributed Systems, 1996"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0743-7315(90)90034-M","article-title":"Architectures for statically scheduled dataflow","volume":"10","author":"Lee","year":"1990","journal-title":"J. Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB14","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM Computers, 1990, pp. 322\u2013328","DOI":"10.1137\/0219021"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB15","unstructured":"D.M. Pase, A comparative analysis of static parallel schedulers where communication costs are significant, Ph.D. Thesis, Oregon, July 1989"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TC.1982.1675884","article-title":"A task allocation model for distributed computing systems","volume":"31","author":"Richard Ma","year":"1982","journal-title":"IEEE Trans. Computers C"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB17","doi-asserted-by":"crossref","unstructured":"V. Sarkar, J. Hennessy, Compile-time partitioning and scheduling of parallel programs, in: Proceedings of the SIGPLAN Symposium on Compiler Construction, 1986, pp. 17\u201326","DOI":"10.1145\/12276.13313"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB18","first-page":"24","article-title":"Partitioning concurrent VLSI simulated programs onto multiprocessor by simulated annealing","volume":"134","author":"Sheild","year":"1987","journal-title":"IEEE proceedings"},{"key":"10.1016\/S1383-7621(99)00043-0_BIB19","unstructured":"G.C. Sih, E.A. Lee, Scheduling to account for interprocessor communication within interconnection constrained processing network, Inter. Conf. Parallel Process. I (1990) 9\u201316"},{"issue":"2","key":"10.1016\/S1383-7621(99)00043-0_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":"10","author":"Sih","year":"1993","journal-title":"IEEE Trans. Parallel and Distributed Sys."},{"issue":"3","key":"10.1016\/S1383-7621(99)00043-0_BIB21","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/71.80160","article-title":"Hypertool: A programming aid for message-passing systems","volume":"1","author":"Wu","year":"1990","journal-title":"IEEE Trans. Parallel and Distributed Sys."},{"issue":"3","key":"10.1016\/S1383-7621(99)00043-0_BIB22","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","article-title":"DSC: scheduling parallel tasks on an unbounded number of processors","volume":"5","author":"Yang","year":"1994","journal-title":"IEEE Trans. Parallel and Distributed Sys."}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762199000430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762199000430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T17:51:09Z","timestamp":1578678669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762199000430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S1383762199000430"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(99)00043-0","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}