FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W748777793> ?p ?o ?g. }

• W748777793 abstract "Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, existing results in real-time scheduling of parallel tasks focus on restrictive task models such as the synchronous model where a task is a sequence of alternating parallel and sequential segments, and parallel segments have threads of execution that are of equal length. In this paper, we address a general model for deterministic parallel tasks, where a task is represented as a DAG with different nodes having different execution requirements. We make several key contributions towards both preemptive and non-preemptive realtime scheduling of DAG tasks on multi-core processors. First, we propose a task decomposition that splits a DAG into sequential tasks. Second, we prove that parallel tasks, upon decomposition, can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first for a general DAG model. Third, we prove that the decomposition has a resource augmentation bound of 4 plus a non-preemption overhead for non-preemptive global EDF scheduling. To our knowledge, this is the first resource augmentation bound for nonpreemptive scheduling of parallel tasks. Through simulations, Type of Report: Other Department of Computer Science & Engineering Washington University in St. Louis Campus Box 1045 St. Louis, MO 63130 ph: (314) 935-6160 Real-Time Scheduling of Parallel Tasks under a General DAG Model Abusayeed Saifullah, David Ferry, Kunal Agrawal, Chenyang Lu, and Christopher Gill Department of Computer Science and Engineering Washington University in St. Louis Abstract—Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, existing results in real-time scheduling of parallel tasks focus on restrictive task models such as the synchronous model where a task is a sequence of alternating parallel and sequential segments, and parallel segments have threads of execution that are of equal length. In this paper, we address a general model for deterministic parallel tasks, where a task is represented as a DAG with different nodes having different execution requirements. We make several key contributions towards both preemptive and non-preemptive realtime scheduling of DAG tasks on multi-core processors. First, we propose a task decomposition that splits a DAG into sequential tasks. Second, we prove that parallel tasks, upon decomposition, can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first for a general DAG model. Third, we prove that the decomposition has a resource augmentation bound of 4 plus a non-preemption overhead for non-preemptive global EDF scheduling. To our knowledge, this is the first resource augmentation bound for nonpreemptive scheduling of parallel tasks. Through simulations, we demonstrate that the achieved bounds are safe and sufficient.Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, existing results in real-time scheduling of parallel tasks focus on restrictive task models such as the synchronous model where a task is a sequence of alternating parallel and sequential segments, and parallel segments have threads of execution that are of equal length. In this paper, we address a general model for deterministic parallel tasks, where a task is represented as a DAG with different nodes having different execution requirements. We make several key contributions towards both preemptive and non-preemptive realtime scheduling of DAG tasks on multi-core processors. First, we propose a task decomposition that splits a DAG into sequential tasks. Second, we prove that parallel tasks, upon decomposition, can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first for a general DAG model. Third, we prove that the decomposition has a resource augmentation bound of 4 plus a non-preemption overhead for non-preemptive global EDF scheduling. To our knowledge, this is the first resource augmentation bound for nonpreemptive scheduling of parallel tasks. Through simulations, we demonstrate that the achieved bounds are safe and sufficient." @default.
• W748777793 created "2016-06-24" @default.
• W748777793 creator A5016200671 @default.
• W748777793 creator A5034805517 @default.
• W748777793 creator A5076029698 @default.
• W748777793 creator A5078543343 @default.
• W748777793 date "2012-01-01" @default.
• W748777793 modified "2023-09-23" @default.
• W748777793 title "Real-Time Scheduling of Parallel Tasks under a General DAG Model" @default.
• W748777793 cites W1486080590 @default.
• W748777793 cites W1563776668 @default.
• W748777793 cites W1580874598 @default.
• W748777793 cites W1602274988 @default.
• W748777793 cites W1965708711 @default.
• W748777793 cites W1965747554 @default.
• W748777793 cites W1968005108 @default.
• W748777793 cites W1971930430 @default.
• W748777793 cites W1980996541 @default.
• W748777793 cites W1996275534 @default.
• W748777793 cites W2023380008 @default.
• W748777793 cites W2028801713 @default.
• W748777793 cites W2047379384 @default.
• W748777793 cites W2049602716 @default.
• W748777793 cites W2083734282 @default.
• W748777793 cites W2090902997 @default.
• W748777793 cites W2098147619 @default.
• W748777793 cites W2101926965 @default.
• W748777793 cites W2104879235 @default.
• W748777793 cites W2107451471 @default.
• W748777793 cites W2116581888 @default.
• W748777793 cites W2116636977 @default.
• W748777793 cites W2122154156 @default.
• W748777793 cites W2123219527 @default.
• W748777793 cites W2123705102 @default.
• W748777793 cites W2124888010 @default.
• W748777793 cites W2132215926 @default.
• W748777793 cites W2146412113 @default.
• W748777793 cites W2162450406 @default.
• W748777793 doi "https://doi.org/10.7936/k71r6nr4" @default.
• W748777793 hasPublicationYear "2012" @default.
• W748777793 type Work @default.
• W748777793 sameAs 748777793 @default.
• W748777793 citedByCount "4" @default.
• W748777793 countsByYear W7487777932012 @default.
• W748777793 countsByYear W7487777932014 @default.
• W748777793 countsByYear W7487777932019 @default.
• W748777793 crossrefType "journal-article" @default.
• W748777793 hasAuthorship W748777793A5016200671 @default.
• W748777793 hasAuthorship W748777793A5034805517 @default.
• W748777793 hasAuthorship W748777793A5076029698 @default.
• W748777793 hasAuthorship W748777793A5078543343 @default.
• W748777793 hasConcept C107568181 @default.
• W748777793 hasConcept C111919701 @default.
• W748777793 hasConcept C11413529 @default.
• W748777793 hasConcept C120314980 @default.
• W748777793 hasConcept C122141398 @default.
• W748777793 hasConcept C126255220 @default.
• W748777793 hasConcept C127456818 @default.
• W748777793 hasConcept C134306372 @default.
• W748777793 hasConcept C173608175 @default.
• W748777793 hasConcept C206729178 @default.
• W748777793 hasConcept C206952183 @default.
• W748777793 hasConcept C2779960059 @default.
• W748777793 hasConcept C33923547 @default.
• W748777793 hasConcept C41008148 @default.
• W748777793 hasConcept C68387754 @default.
• W748777793 hasConcept C74197172 @default.
• W748777793 hasConcept C77553402 @default.
• W748777793 hasConcept C78766204 @default.
• W748777793 hasConceptScore W748777793C107568181 @default.
• W748777793 hasConceptScore W748777793C111919701 @default.
• W748777793 hasConceptScore W748777793C11413529 @default.
• W748777793 hasConceptScore W748777793C120314980 @default.
• W748777793 hasConceptScore W748777793C122141398 @default.
• W748777793 hasConceptScore W748777793C126255220 @default.
• W748777793 hasConceptScore W748777793C127456818 @default.
• W748777793 hasConceptScore W748777793C134306372 @default.
• W748777793 hasConceptScore W748777793C173608175 @default.
• W748777793 hasConceptScore W748777793C206729178 @default.
• W748777793 hasConceptScore W748777793C206952183 @default.
• W748777793 hasConceptScore W748777793C2779960059 @default.
• W748777793 hasConceptScore W748777793C33923547 @default.
• W748777793 hasConceptScore W748777793C41008148 @default.
• W748777793 hasConceptScore W748777793C68387754 @default.
• W748777793 hasConceptScore W748777793C74197172 @default.
• W748777793 hasConceptScore W748777793C77553402 @default.
• W748777793 hasConceptScore W748777793C78766204 @default.
• W748777793 hasLocation W7487777931 @default.
• W748777793 hasOpenAccess W748777793 @default.
• W748777793 hasPrimaryLocation W7487777931 @default.
• W748777793 hasRelatedWork W1607577956 @default.
• W748777793 hasRelatedWork W1987228334 @default.
• W748777793 hasRelatedWork W2008659392 @default.
• W748777793 hasRelatedWork W2027934431 @default.
• W748777793 hasRelatedWork W2081746076 @default.
• W748777793 hasRelatedWork W2090822559 @default.
• W748777793 hasRelatedWork W2090902997 @default.
• W748777793 hasRelatedWork W2092933369 @default.
• W748777793 hasRelatedWork W2116581888 @default.
• W748777793 hasRelatedWork W2156316099 @default.

• next