{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:50:08Z","timestamp":1761486608777},"reference-count":41,"publisher":"Elsevier BV","issue":"6-7","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999,1]]},"DOI":"10.1016\/s1383-7621(98)00019-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:33:56Z","timestamp":1049726036000},"page":"483-503","source":"Crossref","is-referenced-by-count":40,"title":["Compiler support for task scheduling in hierarchical execution models"],"prefix":"10.1016","volume":"45","author":[{"given":"Thomas","family":"Rauber","sequence":"first","affiliation":[]},{"given":"Gudula","family":"R\u00fcnger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(98)00019-8_BIB1","doi-asserted-by":"crossref","unstructured":"A. Alexandrov, M. Ionescu, K.E. Schauser, C. Scheiman, LogGP: Incorporating long messages into the LogP model one step closer towards a realistic model for parallel computation, Technical Report TRCS95-09, University of California at Santa Barbara, 1995","DOI":"10.1145\/215399.215427"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB2","doi-asserted-by":"crossref","unstructured":"P. Banerjee, J. Chandy, M. Gupta, E. Hodge, J. Holmes, A. Lain, D. Palermo, S. Ramaswamy, E. Su, The Paradigm Compiler for Distributed Memory Multicomputers, IEEE Computer, 1995","DOI":"10.1109\/2.467577"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB3","unstructured":"K. Belkhale, P. Banerjee, Approximate scheduling algorithms for the partitionable independent task scheduling problem, in: Proceedings of the 1990 International Conference of Parallel Processing, 1990, pp. 72\u201375"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB4","doi-asserted-by":"crossref","unstructured":"S. Chakrabarti, J. Demmel, K. Yelick, Modeling the benefits of mixed data and task parallelism, in: Symposium on Parallel Algorithms and Architecture (SPAA), 1995, pp. 74\u201383","DOI":"10.1145\/215399.215423"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB5","doi-asserted-by":"crossref","unstructured":"D.E. Culler, R. Karp, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, in: Proceedings of the Fourth Symposium on Principles and Practice of Parallel Programming, vol. 28, no. 4, 1993, pp. 1\u201312","DOI":"10.1145\/155332.155333"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB6","doi-asserted-by":"crossref","unstructured":"J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N. Sharp, Q. Wu, R.L. While, Parallel programming using skeleton functions, in: Proceedings of the PARLE'93, volume 694 of LNCS, Munich, Germany, June 1993, pp. 146\u2013160","DOI":"10.1007\/3-540-56891-3_12"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/1027140","article-title":"Recent progress in extrapolation methods for ordinary differential equations","volume":"27","author":"Deuflhard","year":"1985","journal-title":"SIAM Review"},{"issue":"1","key":"10.1016\/S1383-7621(98)00019-8_BIB8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/jpdc.1995.1026","article-title":"Accurate predictions of parallel program execution time","volume":"25","author":"Driscoll","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB9","doi-asserted-by":"crossref","unstructured":"J. Du, J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Computing, 1989","DOI":"10.1137\/0402042"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB10","doi-asserted-by":"crossref","unstructured":"A. Feldmann, J. Sgall, T. Shang-Hua, Dynamic scheduling on parallel machines, in: Foundations of Computer Science, 1991, pp. 111\u2013120","DOI":"10.1109\/SFCS.1991.185355"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB11","doi-asserted-by":"crossref","unstructured":"I. Foster, K.M. Chandy, Fortran M: A language for modular parallel programming, Journal of Parallel and Distributed Computing, 1995","DOI":"10.1006\/jpdc.1995.1044"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB12","doi-asserted-by":"crossref","unstructured":"I. Foster, M. Xu, B. Avalani, A. Choudhary, A compilation system that integrates high performance Fortran and Fortran M, in: Proceedings of the 1994 Scalable High Performance Computing Conference, IEEE Computer Society Press, 1994","DOI":"10.1109\/SHPCC.1994.296657"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB13","unstructured":"T.L. Freeman, C. Phillips. Parallel Numerical Algorithms, Prentice-Hall, New York, 1992"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB14","doi-asserted-by":"crossref","unstructured":"R. Graham, Bounds on multiprocessor timing anomalies, SIAM Journal on Appl. Math., 1969","DOI":"10.1137\/0117039"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB15","doi-asserted-by":"crossref","unstructured":"E. Hairer, G. Wanner, Solving Ordinary Differential Equations II, Springer, Berlin, 1991","DOI":"10.1007\/978-3-662-09947-6"},{"key":"#cr-split#-10.1016\/S1383-7621(98)00019-8_BIB16.1","doi-asserted-by":"crossref","unstructured":"P. Hanrahan, D. Salzman, L. Aupperle, A rapid hierarchical radiosity algorithm, Computer Graphics 25 (4) (1991);","DOI":"10.1145\/127719.122740"},{"key":"#cr-split#-10.1016\/S1383-7621(98)00019-8_BIB16.2","unstructured":"Proceedings of SIGGRAPH '91"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB17","unstructured":"R.N. Ibbett, G. Chochia, P.S. Coe, M.I. Cole, P.E. Heywood, T. Heywood, R.J. Pooley, P. Thanisch, N.P. Topham, Algorithms, architectures and models of computation, Technical Report ECS-CSG-22-96, University of Edinburgh, 1996"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB18","doi-asserted-by":"crossref","unstructured":"W.F. McColl. Universal computing, in: Proceedings of EuroPar'96, Springer LNCS 1123, 1996, pp. 25\u201336","DOI":"10.1007\/3-540-61626-8_3"},{"issue":"12","key":"10.1016\/S1383-7621(98)00019-8_BIB19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/2.476198","article-title":"Collective communication in wormhole-routed massively parallel computers","volume":"28","author":"McKinley","year":"1995","journal-title":"IEEE Computer"},{"issue":"3","key":"10.1016\/S1383-7621(98)00019-8_BIB20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","article-title":"Models of machines and computation for mapping in multicomputers","volume":"25","author":"Norman","year":"1993","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB21","unstructured":"S. Ramaswamy, Simultaneous exploitation of task and data parallelism in regular scientific applications, Ph.D. Thesis, University of Illinois at Urbana, Champaign, 1996"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB22","doi-asserted-by":"crossref","unstructured":"S. Ramaswamy, S. Sapatnekar, P. Banerjee, A framework for exploiting data and functional parallelism on distributed-memory multicomputers, Technical Report CRHC-94-10, University of Illinois, 1994","DOI":"10.1109\/ICPP.1994.21"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB23","doi-asserted-by":"crossref","unstructured":"T. Rauber, G. R\u00fcnger, Parallel solution of a Schr\u00f6dinger\u2013Poisson system, in: International Conference on High-Performance Computing and Networking, Springer LNCS 919, 1995, pp. 697\u2013702","DOI":"10.1007\/BFb0046702"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB24","doi-asserted-by":"crossref","unstructured":"T. Rauber, G. R\u00fcnger, Comparing task and data parallel execution schemes for the DIIRK method, in: Proceedings of the EuroPar'96, Springer LNCS 1124, 1996, pp. 52\u201361","DOI":"10.1007\/BFb0024684"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB25","first-page":"589","article-title":"Deriving structured parallel implementations for numerical methods","volume":"41","author":"Rauber","year":"1996","journal-title":"The Euromicro Journal"},{"issue":"1","key":"10.1016\/S1383-7621(98)00019-8_BIB26","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1177\/109434209601000103","article-title":"Parallel iterated Runge\u2013Kutta methods and applications","volume":"10","author":"Rauber","year":"1996","journal-title":"International Journal of Supercomputer Applications"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB27","doi-asserted-by":"crossref","unstructured":"T. Rauber, G. R\u00fcnger, The compiler TwoL for the design of parallel implementations, in: Proceedings of the Fourth International Conference on Parallel Architectures and Compilation Techniques, Boston, MA, 1996, pp. 292\u2013301","DOI":"10.1109\/PACT.1996.552677"},{"issue":"3","key":"10.1016\/S1383-7621(98)00019-8_BIB28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1096-9128(199703)9:3<181::AID-CPE245>3.0.CO;2-6","article-title":"Load balancing schemes for extrapolation methods","volume":"9","author":"Rauber","year":"1997","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB29","doi-asserted-by":"crossref","unstructured":"T. Rauber, G. R\u00fcnger, R. Wilhelm, Deriving optimal data distributions for group parallel numerical algorithms, in: Conference on Massively Parallel Programming Models, Berlin, Germany, 1995, pp. 33\u201341","DOI":"10.1109\/PMMPC.1995.504339"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB30","doi-asserted-by":"crossref","unstructured":"J. Rose, LocusRoute: A parallel global router for standard cells, in: Twenty-fifth ACM\/IEEE Design Automation Conference, 1988, pp. 189\u2013195","DOI":"10.1109\/DAC.1988.14757"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB31","doi-asserted-by":"crossref","unstructured":"J. Rose, Parallel global routing for standard cells, IEEE Transaction on Computer Aided Design 9 (10) (1990)","DOI":"10.1109\/43.62733"},{"issue":"1","key":"10.1016\/S1383-7621(98)00019-8_BIB32","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB33","unstructured":"J. Stoer, R. Bulirsch, Introduction to Numerical Analysis, Springer, New York, 1990"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB34","doi-asserted-by":"crossref","unstructured":"J. Subhlok, Automatic mapping of task and data parallel programs for efficient execution on multiprocessors, Technical Report CMU-CS-93-212, Carnegie Mellon University, 1993","DOI":"10.21236\/ADA274125"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB35","doi-asserted-by":"crossref","unstructured":"J. Turek, W. Ludwig, J. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, Ph. Yu, Scheduling prallelizable tasks to minimize average response time, in: Proceedings of SPAA'94, 1994, pp. 200\u2013209","DOI":"10.1145\/181014.181331"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB36","doi-asserted-by":"crossref","unstructured":"J. Turek, J.L. Wolf, Ph.S. Yu, Approximate algorithms for scheduling parallelizable tasks, in: Proceedings of SPAA'92, 1992, pp. 323\u2013332","DOI":"10.1145\/140901.141909"},{"issue":"8","key":"10.1016\/S1383-7621(98)00019-8_BIB37","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":"Communications of the ACM"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB38","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0377-0427(90)90200-J","article-title":"Parallel iteration of high\u2013order Runge\u2013Kutta methods with stepsize control","volume":"29","author":"van der Houwen","year":"1990","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"197","key":"10.1016\/S1383-7621(98)00019-8_BIB39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/S0025-5718-1992-1106986-8","article-title":"Embedded diagonally implicit Runge\u2013Kutta algorithms on parallel computers","volume":"58","author":"van der Houwen","year":"1992","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S1383-7621(98)00019-8_BIB40","doi-asserted-by":"crossref","unstructured":"S.C. Woo, M. Ohara, E. Torrie, J.P. Singh, A. Gupta, The SPLASH-2 programs: Characterization and methodological considerations, in: Proceedings of the 22nd Annual International Symposium on Computer Architecture, 1995, pp. 24\u201336","DOI":"10.1145\/223982.223990"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762198000198?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762198000198?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T16:36:52Z","timestamp":1580229412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762198000198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":41,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S1383762198000198"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(98)00019-8","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}