{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T12:04:43Z","timestamp":1696593883031},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,12]],"date-time":"2012-05-12T00:00:00Z","timestamp":1336780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10586-012-0211-1","type":"journal-article","created":{"date-parts":[[2012,5,11]],"date-time":"2012-05-11T13:58:41Z","timestamp":1336744721000},"page":"223-238","source":"Crossref","is-referenced-by-count":10,"title":["SEParAT: scheduling support environment for parallel application task graphs"],"prefix":"10.1007","volume":"15","author":[{"given":"J\u00f6rg","family":"D\u00fcmmler","sequence":"first","affiliation":[]},{"given":"Raphael","family":"Kunis","sequence":"additional","affiliation":[]},{"given":"Gudula","family":"R\u00fcnger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,12]]},"reference":[{"key":"211_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/4434.895101","volume":"8","author":"I. Ahmad","year":"2000","unstructured":"Ahmad, I., Kwok, Y.-K., Wu, M.-Y., Shu, W.: Casch: a tool for computer-aided scheduling. IEEE Concurrency 8, 21\u201333 (2000)","journal-title":"IEEE Concurrency"},{"issue":"1","key":"211_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jpdc.1997.1346","volume":"44","author":"A. Alexandrov","year":"1997","unstructured":"Alexandrov, A., Ionescu, M.F., Schauser, K.E., Scheiman, C.: LogGP: incorporating long messages into the LogP model for parallel computation. Journ. of Parallel and Distr. Computing 44(1), 71\u201379 (1997)","journal-title":"Journ. of Parallel and Distr. Computing"},{"key":"211_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/1-84628-339-6_9","volume-title":"Grid Computing: Software Environments and Tools, Chapter: Programming, Deploying, Composing, for the Grid","author":"L. Baduel","year":"2006","unstructured":"Baduel, L., Baude, F., Caromel, D., Contes, A., Huet, F., Morel, M., Quilici, R.: Grid Computing: Software Environments and Tools, Chapter: Programming, Deploying, Composing, for the Grid, pp. 205\u2013229. Springer, Berlin (2006)"},{"issue":"10","key":"211_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/2.467577","volume":"28","author":"P. Banerjee","year":"1995","unstructured":"Banerjee, P., Chandy, J., Gupta, M., Hodge, E., Holm, J., Lain, A., Palermo, D., Ramaswamy, S., Su, E.: The paradigm compiler for distributed-memory multicomputers. IEEE Comp. 28(10), 37\u201347 (1995)","journal-title":"IEEE Comp."},{"issue":"10","key":"211_CR5","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.parco.2006.08.004","volume":"32","author":"S. Bansal","year":"2006","unstructured":"Bansal, S., Kumar, P., Singh, K.: An improved two-step algorithm for task and data parallel scheduling in distributed memory machines. Parallel Computing 32(10), 759\u2013774 (2006)","journal-title":"Parallel Computing"},{"issue":"11","key":"211_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MC.2009.372","volume":"42","author":"K.J. Barker","year":"2009","unstructured":"Barker, K.J., Davis, K., Hoisie, A., Kerbyson, D.J., Lang, M., Pakin, S., Sancho, J.C.: Using performance modeling to design large-scale systems. IEEE Comput. 42(11), 42\u201349 (2009)","journal-title":"IEEE Comput."},{"key":"211_CR7","first-page":"41.2","volume-title":"Proc. of 17th Int. Symp. on Parallel and Distr. Processing IPDPS\u201903:","author":"V. Boudet","year":"2003","unstructured":"Boudet, V., Desprez, F., Suter, F.: One-step algorithm for mixed data and task parallel scheduling without data replication. In: Proc. of 17th Int. Symp. on Parallel and Distr. Processing IPDPS\u201903:, p. 41.2. IEEE Comput. Soc., Los Alamitos (2003)"},{"issue":"3","key":"211_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10586-006-9747-2","volume":"9","author":"J. Cao","year":"2006","unstructured":"Cao, J., Chan, A.T., Sun, Y., Das, S.K., Guo, M.: A taxonomy of application scheduling tools for high performance cluster computing. Cluster Computing 9(3), 355\u2013371 (2006)","journal-title":"Cluster Computing"},{"key":"211_CR9","series-title":"Lecture Notes in Computer Science","first-page":"230","volume-title":"Proc. of 10th Int. Euro-Par Conf. (Euro-Par\u201904)","author":"H. Casanova","year":"2004","unstructured":"Casanova, H., Desprez, F., Suter, F.: From heterogeneous task scheduling to heterogeneous mixed parallel scheduling. In: Danelutto, M., Laforenza, D., Vanneschi, M. (eds.) Proc. of 10th Int. Euro-Par Conf. (Euro-Par\u201904), Pisa, Italy, August\/September 2004. Lecture Notes in Computer Science, vol. 3149, pp. 230\u2013237. Springer, Berlin (2004)"},{"key":"211_CR10","first-page":"1","volume-title":"Principles Practice of Parallel Programming","author":"D.E. Culler","year":"1993","unstructured":"Culler, D.E., Karp, R.M., Patterson, D.A., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: towards a realistic model of parallel computation. In: Principles Practice of Parallel Programming, pp. 1\u201312 (1993)"},{"issue":"4","key":"211_CR11","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., Leung, J.Y.-T.: Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics 2(4), 473\u2013487 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"211_CR12","first-page":"663","volume-title":"Proc. of the 2007 High Performance Computing & Simulation (HPCS\u201907) Conference","author":"J. D\u00fcmmler","year":"2007","unstructured":"D\u00fcmmler, J., Kunis, R., R\u00fcnger, G.: A comparison of scheduling algorithms for multiprocessortasks with precedence constraints. In: Proc. of the 2007 High Performance Computing & Simulation (HPCS\u201907) Conference, pp. 663\u2013669 (2007). ECMS"},{"key":"211_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-540-74466-5_4","volume-title":"Proc. of the 13th International Euro-Par Conference","author":"J. D\u00fcmmler","year":"2007","unstructured":"D\u00fcmmler, J., Kunis, R., R\u00fcnger, G.: A scheduling toolkit for multiprocessor-task programming with dependencies. In: Proc. of the 13th International Euro-Par Conference. Lecture Notes in Computer Science, vol. 4641, pp. 23\u201332. Springer, Berlin (2007)"},{"key":"211_CR14","series-title":"Advances in Parallel Computing","first-page":"321","volume-title":"Parallel Computing: Architectures, Algorithms and Applications: Proc. of the Int. Conf. ParCo 2007","author":"J. D\u00fcmmler","year":"2007","unstructured":"D\u00fcmmler, J., Kunis, R., R\u00fcnger, G.: Layer-based scheduling algorithms for multiprocessor-tasks with precedence constraints. In: Parallel Computing: Architectures, Algorithms and Applications: Proc. of the Int. Conf. ParCo 2007. Advances in Parallel Computing, vol. 15, pp. 321\u2013328 (2007). IOS Press"},{"key":"211_CR15","first-page":"64","volume-title":"Proc. of the 16th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP\u201908)","author":"J. D\u00fcmmler","year":"2008","unstructured":"D\u00fcmmler, J., Rauber, T., R\u00fcnger, G.: A transformation framework for communicating multiprocessor-tasks. In: Proc. of the 16th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP\u201908), pp. 64\u201371. IEEE Press, New York (2008)"},{"key":"211_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-78699-3_1","volume-title":"Proceedings of the 13th Job Scheduling Strategies for Parallel Processing","author":"E. Frachtenberg","year":"2008","unstructured":"Frachtenberg, E., Schiegelshohn, U.: New challenges of parallel job scheduling. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) Proceedings of the 13th Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science, vol. 4942, pp. 1\u201323. Springer, Berlin (2008)"},{"issue":"3","key":"211_CR17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1155\/1997\/532130","volume":"6","author":"M. Hill","year":"1997","unstructured":"Hill, M., McColl, W., Skillicorn, D.: Questions and answers about BSP. Scientific Programming 6(3), 249\u2013274 (1997)","journal-title":"Scientific Programming"},{"key":"211_CR18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4615-0361-3_5","volume-title":"Performance Analysis and Grid Computing","author":"M. K\u00fchnemann","year":"2004","unstructured":"K\u00fchnemann, M., Rauber, T., R\u00fcnger, G.: Performance modelling for task-parallel programs. In: Performance Analysis and Grid Computing, pp. 77\u201391. Kluwer, Norwell (2004)"},{"issue":"8","key":"211_CR19","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1002\/cpe.1674","volume":"23","author":"R. Kunis","year":"2011","unstructured":"Kunis, R., R\u00fcnger, G.: Optimizing layer-based scheduling algorithms for parallel tasks with dependencies. Concurrency and Computation: Practice and Experience 23(8), 827\u2013849 (2011)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"211_CR20","first-page":"278","volume-title":"13th Int. Symp. on High-Performance Distr. Comp","author":"O.-K. Kwon","year":"2004","unstructured":"Kwon, O.-K., Hahm, J., Kim, S., Lee, J.R.: Grasp: a grid resource allocation system based on ogsa. In: 13th Int. Symp. on High-Performance Distr. Comp, pp. 278\u2013279 (2004)"},{"key":"211_CR21","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/S0377-2217(02)00264-3","volume":"142","author":"R. Lepere","year":"2002","unstructured":"Lepere, R., Mounie, G., Trystram, D.: An approximation algorithm for scheduling trees of malleable tasks. European Journ. of Operational Research 142, 242\u2013249 (2002)","journal-title":"European Journ. of Operational Research"},{"issue":"4","key":"211_CR22","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1142\/S0129054102001308","volume":"13","author":"R. Lepere","year":"2002","unstructured":"Lepere, R., Trystram, D., Woeginger, G.J.: Approximation algorithms for scheduling malleable tasks under precedence constraints. Int. Journ. of Foundation of Comp. Sci. 13(4), 613\u2013627 (2002)","journal-title":"Int. Journ. of Foundation of Comp. Sci."},{"issue":"2","key":"211_CR23","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/88.218176","volume":"1","author":"T. Lewis","year":"1993","unstructured":"Lewis, T., El-Rewini, H.: Parallax: a tool for parallel program scheduling. IEEE Parallel Distr. Technol. 1(2), 62\u201372 (1993)","journal-title":"IEEE Parallel Distr. Technol."},{"key":"211_CR24","first-page":"167","volume-title":"Proc. of 5th Annual ACM-SIAM Symp. on Discrete Algorithms SODA\u201994","author":"W. Ludwig","year":"1994","unstructured":"Ludwig, W., Tiwari, P.: Scheduling malleable and nonmalleable parallel tasks. In: Proc. of 5th Annual ACM-SIAM Symp. on Discrete Algorithms SODA\u201994, pp. 167\u2013176. SIAM, Philadelphia (1994)"},{"key":"211_CR25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/305619.305622","volume-title":"SPAA\u201999: Proc. of 11th Annual ACM Symp. on Parallel Algorithms and Architectures","author":"G. Mounie","year":"1999","unstructured":"Mounie, G., Rapine, C., Trystram, D.: Efficient approximation algorithms for scheduling malleable tasks. In: SPAA\u201999: Proc. of 11th Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 23\u201332. ACM, New York (1999)"},{"issue":"2","key":"211_CR26","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539701385995","volume":"37","author":"G. Mounie","year":"2007","unstructured":"Mounie, G., Rapine, C., Trystram, D.: A $\\frac{3}{2}$ -approximation algorithm for scheduling independent monotonic malleable tasks. SIAM Journ. on Computing 37(2), 401\u2013412 (2007)","journal-title":"SIAM Journ. on Computing"},{"key":"211_CR27","first-page":"3","volume-title":"Proc. of 12th Int. Conf. on Parallel and Distr. Syst. (ICPADS06)","author":"T. N\u2019Takpe","year":"2006","unstructured":"N\u2019Takpe, T., Suter, F.: Critical path and area based scheduling of parallel task graphs on heterogeneous platforms. In: Proc. of 12th Int. Conf. on Parallel and Distr. Syst. (ICPADS06), Washington, DC, USA, pp. 3\u201310. IEEE Comput. Soc., Los Alamitos (2006)"},{"key":"211_CR28","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/ISPDC.2007.1","volume-title":"Proc. of 6th Int. Symp. on Parallel and Distr. Computing (ISPDC\u201907)","author":"T. N\u2019Takpe","year":"2007","unstructured":"N\u2019Takpe, T., Suter, F., Casanova, H.: A comparison of scheduling approaches for mixed-parallel applications on heterogeneous platforms. In: Proc. of 6th Int. Symp. on Parallel and Distr. Computing (ISPDC\u201907), pp. 35\u201342. IEEE Comput. Soc., Los Alamitos (2007)"},{"key":"211_CR29","first-page":"39","volume-title":"Proc. of 15th Int. Parallel & Distr. Processing Symp. (IPDPS01)","author":"A. Radulescu","year":"2001","unstructured":"Radulescu, A., Nicolescu, C., van Gemund, A.J.C., Jonker, P.: CPR: mixed task and data parallel scheduling for distributed systems. In: Proc. of 15th Int. Parallel & Distr. Processing Symp. (IPDPS01), pp. 39\u201348. IEEE Comput. Soc., Los Alamitos (2001)"},{"key":"211_CR30","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/ICPP.2001.952048","volume-title":"Proc. of 2001 Int. Conf. on Parallel Processing","author":"A. Radulescu","year":"2001","unstructured":"Radulescu, A., van Gemund, A.J.C.: A low-cost approach towards mixed task and data parallel scheduling. In: Proc. of 2001 Int. Conf. on Parallel Processing, pp. 69\u201376. IEEE Comput. Soc., Los Alamitos (2001)"},{"issue":"11","key":"211_CR31","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/71.642945","volume":"8","author":"S. Ramaswamy","year":"1997","unstructured":"Ramaswamy, S., Sapatnekar, S., Banerjee, P.: A framework for exploiting task and data parallelism on distributed memory multicomputers. IEEE Trans. Parallel Distr. Syst. 8(11), 1098\u20131116 (1997)","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"issue":"6\u20137","key":"211_CR32","first-page":"483","volume":"45","author":"T. Rauber","year":"1998","unstructured":"Rauber, T., R\u00fcnger, G.: Compiler support for task scheduling in hierarchical execution models. Journ. Syst. Archit. 45(6\u20137), 483\u2013503 (1998)","journal-title":"Journ. Syst. Archit."},{"key":"211_CR33","volume-title":"Proc. of 9th SIAM Conf. on Parallel Processing for Scientific Computing (PPSC)","author":"T. Rauber","year":"1999","unstructured":"Rauber, T., R\u00fcnger, G.: Scheduling of data parallel modules for scientific computing. In: Proc. of 9th SIAM Conf. on Parallel Processing for Scientific Computing (PPSC). SIAM, Philadelphia (1999)"},{"issue":"4","key":"211_CR34","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/32.844492","volume":"26","author":"T. Rauber","year":"2000","unstructured":"Rauber, T., R\u00fcnger, G.: A transformation approach to derive efficient parallel implementations. IEEE Transactions on Software Engineering 26(4), 315\u2013339 (2000)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"211_CR35","first-page":"111","volume-title":"Parallel Computing: Software Technology, Algorithms, Architectures and Applications (PARCO 2003)","author":"H.J. Sips","year":"2003","unstructured":"Sips, H.J., van Reeuwijk, K.: An integrated annotation and compilation framework for task and data parallel programming in Java. In: Parallel Computing: Software Technology, Algorithms, Architectures and Applications (PARCO 2003), Dresden, Germany, pp. 111\u2013118. Elsevier, Amsterdam (2003)"},{"key":"211_CR36","volume-title":"Beowulf Cluster Computing with Linux","author":"T. Tannenbaum","year":"2001","unstructured":"Tannenbaum, T., Wright, D., Miller, K., Livny, M.: Condor\u2014a distributed job scheduler. In: Sterling, T. (ed.) Beowulf Cluster Computing with Linux. MIT Press, Cambridge (2001)"},{"key":"211_CR37","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/HCW.1999.765092","volume-title":"Proc. of 8th Heterogeneous Computing Workshop, HCW\u201999","author":"H. Topcuoglu","year":"1999","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.-Y.: Task scheduling algorithms for heterogeneous processors. In: Proc. of 8th Heterogeneous Computing Workshop, HCW\u201999, Washington, DC, USA, p. 3. IEEE Comput. Soc., Los Alamitos (1999)"},{"issue":"2","key":"211_CR38","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/TPDS.2003.1178879","volume":"14","author":"A.J.C. van Gemund","year":"2003","unstructured":"van Gemund, A.J.C.: Symbolic performance modeling of parallel systems. IEEE Trans. Parallel Distrib. Syst. 14(2), 154\u2013165 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"211_CR39","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"M.Y. Wu","year":"1990","unstructured":"Wu, M.Y., Gajski, D.D.: Hypertool: a programming aid for message-passing systems. IEEE Trans. Parallel Distr. Syst. 1(3), 330\u2013343 (1990)","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"key":"211_CR40","first-page":"428","volume-title":"6th ACM Int. Conf. on Supercomputing","author":"T. Yang","year":"1992","unstructured":"Yang, T., Gerasoulis, A.: Pyrros: static task scheduling and code generation for message passing multiprocessors. In: 6th ACM Int. Conf. on Supercomputing, pp. 428\u2013437 (1992)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-012-0211-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-012-0211-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-012-0211-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:40:14Z","timestamp":1559227214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-012-0211-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,12]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["211"],"URL":"https:\/\/doi.org\/10.1007\/s10586-012-0211-1","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,12]]}}}