{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:11Z","timestamp":1750306691572,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612698","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"128-137","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Scheduling shared continuous resources on many-cores"],"prefix":"10.1145","author":[{"given":"Andr\u00e9","family":"Brinkmann","sequence":"first","affiliation":[{"name":"Johannes Gutenberg-Universit\u00e4t Mainz, Mainz, Germany"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]},{"given":"Lars","family":"Nagel","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg-Universit\u00e4t Mainz, Mainz, Germany"}]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]},{"given":"Tim","family":"S\u00fc\u00df","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg-Universit\u00e4t Mainz, Mainz, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"volume-title":"K. H. Ecker, and E. Pesch. phHandbook on Scheduling: From Theory to Applications","year":"2007","key":"e_1_3_2_1_1_1","unstructured":"\\.zewicz ( 2007 ) B\u0142a.zewicz, Ecker, and Pesch}Blazewicz:2007J. B\u0142a.zewicz , K. H. Ecker, and E. Pesch. phHandbook on Scheduling: From Theory to Applications . Springer , 2007. \\.zewicz et al.(2007)B\u0142a.zewicz, Ecker, and Pesch}Blazewicz:2007J. B\u0142a.zewicz, K. H. Ecker, and E. Pesch. phHandbook on Scheduling: From Theory to Applications. Springer, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.7494\/dmms.2007.1.2.59"},{"key":"e_1_3_2_1_3_1","volume-title":"Discrete-continuous scheduling problems -- mean completion time results. phEuropean Journal of Operational Research, 94 (2): 302--309","author":"J\u00f3zefowska J.","year":"1996","unstructured":"fowska and Weglarz(1996)}Jozefowska:1996 J. J\u00f3zefowska and J. Weglarz . Discrete-continuous scheduling problems -- mean completion time results. phEuropean Journal of Operational Research, 94 (2): 302--309 , 1996 . fowska and Weglarz(1996)}Jozefowska:1996J. J\u00f3zefowska and J. Weglarz. Discrete-continuous scheduling problems -- mean completion time results. phEuropean Journal of Operational Research, 94 (2): 302--309, 1996."},{"key":"e_1_3_2_1_4_1","volume-title":"On a methodology for discrete-continuous scheduling. phEuropean Journal of Operational Research, 107 (2): 338--353","author":"J\u00f3zefowska J.","year":"1998","unstructured":"fowska and Weglarz(1998)}Jozefowska:1998 J. J\u00f3zefowska and J. Weglarz . On a methodology for discrete-continuous scheduling. phEuropean Journal of Operational Research, 107 (2): 338--353 , 1998 . fowska and Weglarz(1998)}Jozefowska:1998J. J\u00f3zefowska and J. Weglarz. On a methodology for discrete-continuous scheduling. phEuropean Journal of Operational Research, 107 (2): 338--353, 1998."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00025-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"fowska etal(2000)J\u00f3zefowska Mika R\u00f3.zycki Walig\u00f3ra and Weglarz}Jozefowska:2000J. J\u00f3zefowska M. Mika R. R\u00f3.zycki G. Walig\u00f3ra and J. Weglarz. Solving the discrete-continuous project scheduling problem via its discretization. phMathematical Methods of Operations Research 52 (3): 489--499 2000.  fowska et al.(2000)J\u00f3zefowska Mika R\u00f3.zycki Walig\u00f3ra and Weglarz}Jozefowska:2000J. J\u00f3zefowska M. Mika R. R\u00f3.zycki G. Walig\u00f3ra and J. Weglarz. Solving the discrete-continuous project scheduling problem via its discretization. phMathematical Methods of Operations Research 52 (3): 489--499 2000.","DOI":"10.1007\/s001860000094"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"fowska etal(2002)J\u00f3zefowska Mika R\u00f3.zycki Walig\u00f3ra and Weglarz}Jozefowska:2002J. J\u00f3zefowska M. Mika R. R\u00f3.zycki G. Walig\u00f3ra and J. Weglarz. A heuristic approach to allocating the continuous resource in discrete-continuous scheduling problems to minimize the makespan. phJournal of Scheduling 5 (6): 487--499 2002.  fowska et al.(2002)J\u00f3zefowska Mika R\u00f3.zycki Walig\u00f3ra and Weglarz}Jozefowska:2002J. J\u00f3zefowska M. Mika R. R\u00f3.zycki G. Walig\u00f3ra and J. Weglarz. A heuristic approach to allocating the continuous resource in discrete-continuous scheduling problems to minimize the makespan. phJournal of Scheduling 5 (6): 487--499 2002.","DOI":"10.1002\/jos.119"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0551-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"phHandbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Leung J. Y.-T.","year":"2004","unstructured":"J. Y.-T. Leung . phHandbook of Scheduling: Algorithms, Models, and Performance Analysis . Chapman & Hall\/CRC , 2004 . J. Y.-T. Leung. phHandbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall\/CRC, 2004."},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"Power-aware acheduling of preemptable jobs on identical parallel processors to minimize makespan. phAnnals of Operations Research","author":"R\u00f3 R.","year":"2011","unstructured":".zycki and Weglarz(2011)}Rozycki:2011 R. R\u00f3 .zycki and J. Weglarz . Power-aware acheduling of preemptable jobs on identical parallel processors to minimize makespan. phAnnals of Operations Research , pages 1 -- 18 , 2011 . ISSN 0254--5330. 10.1007\/s10479-011-0957--5. .zycki and Weglarz(2011)}Rozycki:2011R. R\u00f3.zycki and J. Weglarz. Power-aware acheduling of preemptable jobs on identical parallel processors to minimize makespan. phAnnals of Operations Research, pages 1--18, 2011. ISSN 0254--5330. 10.1007\/s10479-011-0957--5."},{"key":"e_1_3_2_1_11_1","volume-title":"Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines. phEuropean Journal of Operational Research, 218 (1): 68--75","author":"R\u00f3 R.","year":"2012","unstructured":".zycki and Weglarz(2012)}Rozycki:2012 R. R\u00f3 .zycki and J. Weglarz . Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines. phEuropean Journal of Operational Research, 218 (1): 68--75 , 2012 . ISSN 0377--2217. 10.1016\/j.ejor.2011.10.017. .zycki and Weglarz(2012)}Rozycki:2012R. R\u00f3.zycki and J. Weglarz. Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines. phEuropean Journal of Operational Research, 218 (1): 68--75, 2012. ISSN 0377--2217. 10.1016\/j.ejor.2011.10.017."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9343-5"},{"key":"e_1_3_2_1_13_1","volume-title":"Project scheduling with finite or infinite number of activity processing modes -- a survey. phEuropean Journal of Operational Research, 208 (3): 177--205","author":"Weglarz J.","year":"2011","unstructured":"J. Weglarz , J. J\u00f3zefowska , M. Mika , and G. Walig\u00f3ra . Project scheduling with finite or infinite number of activity processing modes -- a survey. phEuropean Journal of Operational Research, 208 (3): 177--205 , 2011 . J. Weglarz, J. J\u00f3zefowska, M. Mika, and G. Walig\u00f3ra. Project scheduling with finite or infinite number of activity processing modes -- a survey. phEuropean Journal of Operational Research, 208 (3): 177--205, 2011."},{"key":"e_1_3_2_1_14_1","first-page":"374","volume-title":"A scheduling model for reduced cpu energy. In phProceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Yao F. F.","year":"1995","unstructured":"F. F. Yao , A. J. Demers , and S. Shenker . A scheduling model for reduced cpu energy. In phProceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS) , pages 374 -- 382 , 1995 . F. F. Yao, A. J. Demers, and S. Shenker. A scheduling model for reduced cpu energy. In phProceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pages 374--382, 1995."}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":14,"alternative-id":["10.1145\/2612669.2612698","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612698","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}