{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:05:04Z","timestamp":1742403904940},"reference-count":26,"publisher":"Elsevier BV","issue":"9","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":["Parallel Computing"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0167-8191(00)00031-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T04:06:40Z","timestamp":1051243600000},"page":"1109-1128","source":"Crossref","is-referenced-by-count":22,"title":["List scheduling of general task graphs under LogP"],"prefix":"10.1016","volume":"26","author":[{"given":"Tomasz","family":"Kalinowski","sequence":"first","affiliation":[]},{"given":"Iskander","family":"Kort","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(00)00031-4_BIB1","unstructured":"C. Boeres, Versatile communication cost modelling for multicomputer task scheduling heuristics, Ph.D. Thesis, University of Edinburgh, 1996"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB2","unstructured":"P. Chr\u00e9tienne, Task scheduling over distributed memory machines, Technical Report 253, MASI, Pierre and Marie Curie University, Paris, 1988"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB3","unstructured":"P. Chr\u00e9tienne, Complexity of tree-scheduling with interprocessor communication delays, Technical Report 90.5, MASI, Pierre and Marie Curie University, Paris, 1990"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB4","unstructured":"P. Chr\u00e9tienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and Its Applications, Wiley, New York, 1995"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB5","doi-asserted-by":"crossref","unstructured":"D.E. Culler, et al., LogP: a practical model of parallel computation, Communications of the ACM 39 (11), November 1996, 78\u201385","DOI":"10.1145\/240455.240477"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB6","doi-asserted-by":"crossref","unstructured":"D.E. Culler, L.T. Liu, R.P. Martin, C. Yoshikawa, LogP performance assessment of fast network interfaces, IEEE Micro, February 1996","DOI":"10.1109\/40.482310"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB7","doi-asserted-by":"crossref","unstructured":"S. Fortune, J. Wyllie, Parallelism in random access machines, in: Proceedings of the 10th ACM Symposium on Theory of Computing, 1978, pp. 114\u2013118","DOI":"10.1145\/800133.804339"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB8","doi-asserted-by":"crossref","unstructured":"P.B. Gibbons, Y. Matias, V. Ramachandran, Can a shared-memory model serve as a bridging model for parallel computation? in: Proceedings of the Nineth Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, June 22\u201325, 1997, pp. 72\u201383, SIGACT\/SIGARCH and EATCS","DOI":"10.1145\/258492.258500"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB9","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. Applied Mathematic"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB10","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":"Operational Research"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB11","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 Journal of Computing 18 (2), (1989) 244\u2013257","DOI":"10.1137\/0218016"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB12","unstructured":"K.K. Keeton, T.E. Anderson, D.A. Patterson, Logp quantified: the case for low-overhead local area networks, in: Hot Interconnects III: A Symposium on High Performance Interconnects, Stanford University, Stanford, CA, August 1995, pp. 10\u201312"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB13","doi-asserted-by":"crossref","unstructured":"I. Kort, D. Trystram, Assessing LogP model parameters for the IBM-SP, in: EUROPAR'98, Southampton, UK, September 1998","DOI":"10.1007\/BFb0057860"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB14","doi-asserted-by":"crossref","unstructured":"I. Kort, D. Trystram, Some results on scheduling flat trees in LogP model, Journal of Information Systems and Operational Research (INFOR) (1998), to appear","DOI":"10.1080\/03155986.1999.11732369"},{"issue":"2","key":"10.1016\/S0167-8191(00)00031-4_BIB15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/88.218176","article-title":"Parallax: A tool for parallel program scheduling","volume":"1","author":"Lewis","year":"1993","journal-title":"IEEE Parallel and Distributed Technology"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB16","unstructured":"W. L\u00f6we, M. Middendorf, W. Zimmermann, Scheduling inverse trees under the communication model of the LogP-Machine, Theoretical Computer Science (1997), to appear"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB17","doi-asserted-by":"crossref","unstructured":"W. L\u00f6we, W. Zimmermann, J. Eisenbiegler, On linear schedules of task graphs on generalized LogP-Machines, in: Europar'97: Parallel Processing, LNCS 1300, 1997, pp. 895\u2013904","DOI":"10.1007\/BFb0002832"},{"issue":"2","key":"10.1016\/S0167-8191(00)00031-4_BIB18","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","article-title":"Towards an architecture-independent analysis of parallel algorithms","volume":"19","author":"Papadimitriou","year":"1990","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with unit interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB20","doi-asserted-by":"crossref","unstructured":"B. Shirazi, H.B. Chen, K. Kavi, J. Marquis, A.R. Hurson, PARSA: A parallel program software development tool, in: IEEE CS Press (Ed.), Symposium on Assesment of Quality Software Develompemnt Tools, 1994, pp. 96\u2013111","DOI":"10.1109\/AQSDT.1994.315759"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Communication of the ACM"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB22","unstructured":"J. Verriet, Scheduling tree-structured programs in the LogP model, Technical Report UU-CS-1997-18, Department of Computer Science, Utrecht University, 1997"},{"issue":"3","key":"10.1016\/S0167-8191(00)00031-4_BIB23","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 Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB24","doi-asserted-by":"crossref","unstructured":"T. Yang, A. Gerasoulis, PYRROS: static task scheduling and code generation for message-passing multiprocessors, in: Proceedings of the Sixth ACM International Conference on Supercomputing, Washington, DC, July 1992, pp. 428\u2013437","DOI":"10.1145\/143369.143446"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB25","first-page":"854","article-title":"An approach to machine-independent parallel programming","author":"Zimmermann","year":"1994","journal-title":"Lecture notes in Computer Science"},{"key":"10.1016\/S0167-8191(00)00031-4_BIB26","first-page":"1470","article-title":"On optimal k-linear scheduling of tree-like task graphs for Log-Machines","author":"Zimmermann","year":"1998","journal-title":"Lecture notes in Computer Science"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:02:26Z","timestamp":1578502946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819100000314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0167819100000314"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(00)00031-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}