Matches in SemOpenAlex for { <https://semopenalex.org/work/W4293243606> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W4293243606 endingPage "3885" @default.
- W4293243606 startingPage "3874" @default.
- W4293243606 abstract "Many modern real-time parallel applications can be modeled as a directed acyclic graph (DAG) task. Recent studies show that the worst-case response time (WCRT) bound of a DAG task can be significantly reduced when the execution order of the vertices is determined by the priority assigned to each vertex of the DAG. How to obtain the optimal vertex priority assignment, and how far from the best-known WCRT bound of a DAG task to the minimum WCRT bound are still open problems. In this article, we aim to construct the optimal vertex priority assignment and derive the minimum WCRT bound for the DAG task. We encode the priority assignment problem into an integer linear programming (ILP) formulation. To solve the ILP model efficiently, we do not involve all variables or constraints. Instead, we solve the ILP model iteratively, i.e., we initially solve the ILP model with only a few primary variables and constraints, and then at each iteration, we increment the ILP model with the variables and constraints which are more likely to derive the optimal priority assignment. Experimental work shows that our method is capable of solving the ILP model optimally without involving too many variables or constraints, e.g., for instances with 50 vertices, we find the optimal priority assignment by involving 12.67% variables on average and within several minutes on average." @default.
- W4293243606 created "2022-08-27" @default.
- W4293243606 creator A5001074845 @default.
- W4293243606 creator A5013131341 @default.
- W4293243606 creator A5018649644 @default.
- W4293243606 creator A5024672300 @default.
- W4293243606 creator A5029808393 @default.
- W4293243606 creator A5038598144 @default.
- W4293243606 creator A5078466440 @default.
- W4293243606 date "2022-11-01" @default.
- W4293243606 modified "2023-10-18" @default.
- W4293243606 title "Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling Algorithms" @default.
- W4293243606 doi "https://doi.org/10.1109/tcad.2022.3197532" @default.
- W4293243606 hasPublicationYear "2022" @default.
- W4293243606 type Work @default.
- W4293243606 citedByCount "0" @default.
- W4293243606 crossrefType "journal-article" @default.
- W4293243606 hasAuthorship W4293243606A5001074845 @default.
- W4293243606 hasAuthorship W4293243606A5013131341 @default.
- W4293243606 hasAuthorship W4293243606A5018649644 @default.
- W4293243606 hasAuthorship W4293243606A5024672300 @default.
- W4293243606 hasAuthorship W4293243606A5029808393 @default.
- W4293243606 hasAuthorship W4293243606A5038598144 @default.
- W4293243606 hasAuthorship W4293243606A5078466440 @default.
- W4293243606 hasConcept C11413529 @default.
- W4293243606 hasConcept C126255220 @default.
- W4293243606 hasConcept C132525143 @default.
- W4293243606 hasConcept C134306372 @default.
- W4293243606 hasConcept C146380142 @default.
- W4293243606 hasConcept C162324750 @default.
- W4293243606 hasConcept C187736073 @default.
- W4293243606 hasConcept C206729178 @default.
- W4293243606 hasConcept C2780451532 @default.
- W4293243606 hasConcept C33923547 @default.
- W4293243606 hasConcept C41008148 @default.
- W4293243606 hasConcept C41045048 @default.
- W4293243606 hasConcept C56086750 @default.
- W4293243606 hasConcept C74197172 @default.
- W4293243606 hasConcept C77553402 @default.
- W4293243606 hasConcept C80444323 @default.
- W4293243606 hasConcept C80899671 @default.
- W4293243606 hasConceptScore W4293243606C11413529 @default.
- W4293243606 hasConceptScore W4293243606C126255220 @default.
- W4293243606 hasConceptScore W4293243606C132525143 @default.
- W4293243606 hasConceptScore W4293243606C134306372 @default.
- W4293243606 hasConceptScore W4293243606C146380142 @default.
- W4293243606 hasConceptScore W4293243606C162324750 @default.
- W4293243606 hasConceptScore W4293243606C187736073 @default.
- W4293243606 hasConceptScore W4293243606C206729178 @default.
- W4293243606 hasConceptScore W4293243606C2780451532 @default.
- W4293243606 hasConceptScore W4293243606C33923547 @default.
- W4293243606 hasConceptScore W4293243606C41008148 @default.
- W4293243606 hasConceptScore W4293243606C41045048 @default.
- W4293243606 hasConceptScore W4293243606C56086750 @default.
- W4293243606 hasConceptScore W4293243606C74197172 @default.
- W4293243606 hasConceptScore W4293243606C77553402 @default.
- W4293243606 hasConceptScore W4293243606C80444323 @default.
- W4293243606 hasConceptScore W4293243606C80899671 @default.
- W4293243606 hasFunder F4320320766 @default.
- W4293243606 hasFunder F4320321001 @default.
- W4293243606 hasFunder F4320322725 @default.
- W4293243606 hasFunder F4320329895 @default.
- W4293243606 hasFunder F4320335777 @default.
- W4293243606 hasIssue "11" @default.
- W4293243606 hasLocation W42932436061 @default.
- W4293243606 hasOpenAccess W4293243606 @default.
- W4293243606 hasPrimaryLocation W42932436061 @default.
- W4293243606 hasRelatedWork W1555309241 @default.
- W4293243606 hasRelatedWork W2037750699 @default.
- W4293243606 hasRelatedWork W2110698131 @default.
- W4293243606 hasRelatedWork W2367260314 @default.
- W4293243606 hasRelatedWork W2480575007 @default.
- W4293243606 hasRelatedWork W2736069062 @default.
- W4293243606 hasRelatedWork W2917459334 @default.
- W4293243606 hasRelatedWork W2991146642 @default.
- W4293243606 hasRelatedWork W3092604888 @default.
- W4293243606 hasRelatedWork W2984187864 @default.
- W4293243606 hasVolume "41" @default.
- W4293243606 isParatext "false" @default.
- W4293243606 isRetracted "false" @default.
- W4293243606 workType "article" @default.