{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:23:19Z","timestamp":1774120999956,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1073983","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"86-95","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Scheduling malleable tasks with precedence constraints"],"prefix":"10.1145","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[{"name":"Universit\u00e4t zu Kiel, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[{"name":"McMaster University, Hamilton, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 1st Workshop on Scalable Shared Memory Multiprocessors","author":"Agarwal A.","year":"1991","unstructured":"A. Agarwal , D. Chaiken , K. Johnson , D. Kranz , J. Kubiatowicz , K. Kurihara , B.-H. Lim , G. Maa , and D. Nussbaum , The MIT Alewife machine: a large-scale distributed-memory multiprocessor , Proceedings of the 1st Workshop on Scalable Shared Memory Multiprocessors , 1991 . A. Agarwal, D. Chaiken, K. Johnson, D. Kranz, J. Kubiatowicz, K. Kurihara, B.-H. Lim, G. Maa, and D. Nussbaum, The MIT Alewife machine: a large-scale distributed-memory multiprocessor, Proceedings of the 1st Workshop on Scalable Shared Memory Multiprocessors, 1991."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646664.700618"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/240455.240477"},{"key":"e_1_3_2_1_4_1","volume-title":"Parallel computer architecture: A hardware\/software approach","author":"Culler D. E.","year":"1999","unstructured":"D. E. Culler , J. P. Singh and A. Gupta , Parallel computer architecture: A hardware\/software approach , Morgan Kaufmann Publishers , San Francisco , 1999 . D. E. Culler, J. P. Singh and A. Gupta, Parallel computer architecture: A hardware\/software approach, Morgan Kaufmann Publishers, San Francisco, 1999."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402042"},{"key":"e_1_3_2_1_6_1","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J. Y.-T","author":"Dutot P.-F.","year":"2004","unstructured":"P.-F. Dutot , G. Mouni\u00e9 and D. Trystram , Scheduling parallel tasks -- approximation algorithms , in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J. Y.-T . Leung (Eds.), CRC Press , Boca Raton , 2004 . P.-F. Dutot, G. Mouni\u00e9 and D. Trystram, Scheduling parallel tasks -- approximation algorithms, in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J. Y.-T. Leung (Eds.), CRC Press, Boca Raton, 2004."},{"key":"e_1_3_2_1_7_1","first-page":"187","volume":"4","author":"Garey M.","year":"1975","unstructured":"M. Garey and R. Graham , Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing , 4 ( 1975 ), 187 -- 200 . M. Garey and R. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing, 4 (1975), 187--200.","journal-title":"Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218016"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 10th European Symposium on Algorithms, ESA 2002, LNCS 2461","author":"Jansen K.","unstructured":"K. Jansen , Scheduling malleable parallel tasks: an asymptotic fully polynomial-time approximation scheme , Proceedings of the 10th European Symposium on Algorithms, ESA 2002, LNCS 2461 , 562--573. K. Jansen, Scheduling malleable parallel tasks: an asymptotic fully polynomial-time approximation scheme, Proceedings of the 10th European Symposium on Algorithms, ESA 2002, LNCS 2461, 562--573."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, 490--498","author":"Jansen K.","unstructured":"K. Jansen and L. Porkolab , Linear-time approximation schemes for scheduling malleable parallel tasks , Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, 490--498 . K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, 490--498."},{"key":"e_1_3_2_1_13_1","unstructured":"K. Jansen and H. Zhang An approximation algorithm for scheduling malleable tasks under general precedence constraints manuscript.  K. Jansen and H. Zhang An approximation algorithm for scheduling malleable tasks under general precedence constraints manuscript."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00031-4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00264-3"},{"issue":"4","key":"e_1_3_2_1_17_1","first-page":"613","volume":"13","author":"Lep\u00e8re R.","year":"2002","unstructured":"R. Lep\u00e8re , D. Trystram and G. J. Woeginger , Approximation algorithms for scheduling malleable tasks under precedence constraints, International Journal of Foundations of Computer Science , 13 ( 4 ), ( 2002 ), 613 -- 627 . R. Lep\u00e8re, D. Trystram and G. J. Woeginger, Approximation algorithms for scheduling malleable tasks under precedence constraints, International Journal of Foundations of Computer Science, 13(4), (2002), 613--627.","journal-title":"Approximation algorithms for scheduling malleable tasks under precedence constraints, International Journal of Foundations of Computer Science"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Ludwig W.","year":"1994","unstructured":"W. Ludwig and P. Tiwari , Scheduling malleable and nonmalleable parallel tasks , Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, SODA 1994 , 167--176. W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, SODA 1994, 167--176."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/305619.305622"},{"key":"e_1_3_2_1_20_1","unstructured":"G. Mouni\u00e9 C. Rapine and D. Trystram A 3\/2-dual approximation algorithm for scheduling independent monotonic malleable tasks manuscript.  G. Mouni\u00e9 C. Rapine and D. Trystram A 3\/2-dual approximation algorithm for scheduling independent monotonic malleable tasks manuscript."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113399"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/602770.602812"},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"17","volume":"15","author":"Prasanna G. N. S.","year":"1996","unstructured":"G. N. S. Prasanna and B. R. Musicus , The Optimal Control Approach to Generalized Multiprocessor Scheduling, Algorithmica , 15 ( 1 ), ( 1996 ), 17 -- 49 . G. N. S. Prasanna and B. R. Musicus, The Optimal Control Approach to Generalized Multiprocessor Scheduling, Algorithmica, 15(1), (1996), 17--49.","journal-title":"The Optimal Control Approach to Generalized Multiprocessor Scheduling, Algorithmica"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.4.909"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141909"}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","location":"Las Vegas Nevada USA","acronym":"SPAA05","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1073983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T21:24:30Z","timestamp":1673126670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1073983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":24,"alternative-id":["10.1145\/1073970.1073983","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1073983","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}