{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:17Z","timestamp":1750306877406,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"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":["SIGBED Rev."],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p>In this paper, we propose a dynamic global scheduling algorithm for a previously-presented specific model of real-time tasks called \"Parallel Graphs\" [1], based on the Least Laxity First priority assignment policy \"LLF\", we apply LLF policy on each subtask in the graphs individually, taking in consideration their precedence constraints. This model of tasks is a combination of graphs and parallelism, in which each subtask in the graph can execute sequentially or parallel according to its number of processors defined by the model. So we study parallelism possibilities in order to find the best structure of the tasks according to the practical specifications of the system.<\/jats:p>","DOI":"10.1145\/2452537.2452541","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T13:31:59Z","timestamp":1364218319000},"page":"25-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic scheduling algorithm for parallel real-time graph tasks"],"prefix":"10.1145","volume":"9","author":[{"given":"Manar","family":"Qamhieh","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Est, France"}]},{"given":"Serge","family":"Midonnet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Est, France"}]},{"given":"Laurent","family":"George","sequence":"additional","affiliation":[{"name":"ECE-Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2012,11]]},"reference":[{"volume-title":"A Parallelizing Algorithm for Real-Time Tasks of Directed Acyclic Graphs Model,\" in RTAS Work-In-Progress Session","year":"2012","author":"Qamhieh M.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","unstructured":"\"Openmp.\" {Online}. Available: http:\/\/www.openmp.org  \"Openmp.\" {Online}. Available: http:\/\/www.openmp.org"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.42"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2011.27"},{"volume-title":"Test, Compare and Evaluate Real-time Scheduling Algorithms,\" in WATERS","year":"2012","author":"Chandarli Y.","key":"e_1_2_1_5_1"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452537.2452541","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2452537.2452541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:26Z","timestamp":1750234706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452537.2452541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1145\/2452537.2452541"],"URL":"https:\/\/doi.org\/10.1145\/2452537.2452541","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2012,11]]},"assertion":[{"value":"2012-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}