FRINK Linked Data Fragments server

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

• W2030483977 endingPage "1425" @default.
• W2030483977 startingPage "1411" @default.
• W2030483977 abstract "With the emergence of multicore processors, the research on multiprocessor real-time scheduling has caught more researchers’ attention recently. Although the topic has been studied for decades, it is still an evolving research field with many open problems. In this work, focusing on periodic real-time tasks with quantum-based computation requirements and implicit deadlines, we propose a novel optimal scheduling algorithm, namely boundary fair (Bfair), which can achieve full system utilization as the well-known Pfair scheduling algorithms. However, different from Pfair algorithms that make scheduling decisions and enforce proportional progress (i.e., fairness) for all tasks at each and every time unit, Bfair makes scheduling decisions and enforces fairness to tasks only at tasks’ period boundaries (i.e., deadlines of periodic tasks). The correctness of the Bfair algorithm to meet the deadlines of all tasks’ instances is formally proved and its performance is evaluated through extensive simulations. The results show that, compared to that of Pfair algorithms, Bfair can significantly reduce the number of scheduling points (by up to 94%) and the overhead of Bfair at each scheduling point is comparable to that of the most efficient Pfair algorithm (i.e., PD2). Moreover, by aggregating the time allocation of tasks for the time interval between consecutive period boundaries, the resulting Bfair schedule can dramatically reduce the number of required context switches and task migrations (as much as 82% and 85%, respectively) when compared to those of Pfair schedules, which in turn reduces the run-time overhead of the system." @default.
• W2030483977 created "2016-06-24" @default.
• W2030483977 creator A5019236533 @default.
• W2030483977 creator A5038997010 @default.
• W2030483977 creator A5054264522 @default.
• W2030483977 creator A5088337929 @default.
• W2030483977 date "2011-10-01" @default.
• W2030483977 modified "2023-10-01" @default.
• W2030483977 title "An optimal boundary fair scheduling algorithm for multiprocessor real-time systems" @default.
• W2030483977 cites W1568809964 @default.
• W2030483977 cites W1602274988 @default.
• W2030483977 cites W1967109142 @default.
• W2030483977 cites W1996641400 @default.
• W2030483977 cites W2007233634 @default.
• W2030483977 cites W2012912569 @default.
• W2030483977 cites W2025225042 @default.
• W2030483977 cites W2029774333 @default.
• W2030483977 cites W2054998117 @default.
• W2030483977 cites W2056830486 @default.
• W2030483977 cites W2058817479 @default.
• W2030483977 cites W2066204478 @default.
• W2030483977 cites W2066995704 @default.
• W2030483977 cites W2074573349 @default.
• W2030483977 cites W2098642319 @default.
• W2030483977 cites W2101144036 @default.
• W2030483977 cites W2109488193 @default.
• W2030483977 cites W2112837133 @default.
• W2030483977 cites W2121607363 @default.
• W2030483977 cites W2122993732 @default.
• W2030483977 cites W2128085460 @default.
• W2030483977 cites W2141213307 @default.
• W2030483977 cites W2143608818 @default.
• W2030483977 cites W2146412113 @default.
• W2030483977 cites W2148070634 @default.
• W2030483977 cites W2148960429 @default.
• W2030483977 cites W2155237069 @default.
• W2030483977 cites W2159411888 @default.
• W2030483977 doi "https://doi.org/10.1016/j.jpdc.2011.06.003" @default.
• W2030483977 hasPublicationYear "2011" @default.
• W2030483977 type Work @default.
• W2030483977 sameAs 2030483977 @default.
• W2030483977 citedByCount "37" @default.
• W2030483977 countsByYear W20304839772012 @default.
• W2030483977 countsByYear W20304839772013 @default.
• W2030483977 countsByYear W20304839772014 @default.
• W2030483977 countsByYear W20304839772015 @default.
• W2030483977 countsByYear W20304839772016 @default.
• W2030483977 countsByYear W20304839772017 @default.
• W2030483977 countsByYear W20304839772018 @default.
• W2030483977 countsByYear W20304839772019 @default.
• W2030483977 countsByYear W20304839772020 @default.
• W2030483977 countsByYear W20304839772021 @default.
• W2030483977 countsByYear W20304839772022 @default.
• W2030483977 crossrefType "journal-article" @default.
• W2030483977 hasAuthorship W2030483977A5019236533 @default.
• W2030483977 hasAuthorship W2030483977A5038997010 @default.
• W2030483977 hasAuthorship W2030483977A5054264522 @default.
• W2030483977 hasAuthorship W2030483977A5088337929 @default.
• W2030483977 hasBestOaLocation W20304839772 @default.
• W2030483977 hasConcept C107568181 @default.
• W2030483977 hasConcept C111919701 @default.
• W2030483977 hasConcept C11413529 @default.
• W2030483977 hasConcept C119948110 @default.
• W2030483977 hasConcept C120314980 @default.
• W2030483977 hasConcept C122141398 @default.
• W2030483977 hasConcept C126255220 @default.
• W2030483977 hasConcept C127456818 @default.
• W2030483977 hasConcept C132439773 @default.
• W2030483977 hasConcept C149635348 @default.
• W2030483977 hasConcept C173608175 @default.
• W2030483977 hasConcept C175893541 @default.
• W2030483977 hasConcept C206729178 @default.
• W2030483977 hasConcept C31689143 @default.
• W2030483977 hasConcept C32310161 @default.
• W2030483977 hasConcept C33923547 @default.
• W2030483977 hasConcept C41008148 @default.
• W2030483977 hasConcept C4822641 @default.
• W2030483977 hasConcept C53833338 @default.
• W2030483977 hasConcept C55439883 @default.
• W2030483977 hasConcept C68387754 @default.
• W2030483977 hasConcept C85924588 @default.
• W2030483977 hasConceptScore W2030483977C107568181 @default.
• W2030483977 hasConceptScore W2030483977C111919701 @default.
• W2030483977 hasConceptScore W2030483977C11413529 @default.
• W2030483977 hasConceptScore W2030483977C119948110 @default.
• W2030483977 hasConceptScore W2030483977C120314980 @default.
• W2030483977 hasConceptScore W2030483977C122141398 @default.
• W2030483977 hasConceptScore W2030483977C126255220 @default.
• W2030483977 hasConceptScore W2030483977C127456818 @default.
• W2030483977 hasConceptScore W2030483977C132439773 @default.
• W2030483977 hasConceptScore W2030483977C149635348 @default.
• W2030483977 hasConceptScore W2030483977C173608175 @default.
• W2030483977 hasConceptScore W2030483977C175893541 @default.
• W2030483977 hasConceptScore W2030483977C206729178 @default.
• W2030483977 hasConceptScore W2030483977C31689143 @default.
• W2030483977 hasConceptScore W2030483977C32310161 @default.
• W2030483977 hasConceptScore W2030483977C33923547 @default.
• W2030483977 hasConceptScore W2030483977C41008148 @default.

• next