Matches in SemOpenAlex for { <https://semopenalex.org/work/W310480992> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W310480992 abstract "In the design of real-time computer systems, the scheduling problem is considered to be an important one and has been addressed by many researchers. However, most approaches have not dealt with tasks' resource requirements. In this dissertation, we will describe a heuristic algorithm to schedule hard real-time tasks, i.e. tasks that have deadlines, in a distributed system. Salient features of our algorithm are that it takes tasks' resource requirements into account, is dynamic, and is distributed. When a task arrives at a node, the scheduler component local to that node attempts to schedule the task on that node. If the attempt fails, the scheduling components on individual nodes cooperate to determine which node has sufficient resource surplus to finish the task before its deadline. This cooperation occurs through exchange of state information among nodes. Determination of a good destination node for a task is based on a technique that combines bidding and focused addressing. In the former, a good node is selected based on the bids that nodes send for the task; in the latter, a node that is estimated to have more than sufficient surplus to guarantee the task is said to be good. By properly combining these two schemes, we make use of their positive features while overcoming their shortcomings.Our heuristic algorithm is an attempt to overcome the exponential problem of scheduling. The algorithm for the local scheduler incorporates various factors that affect real-time scheduling to actively direct the scheduling process. The scheme for cooperation among nodes functions in spite of imprecise and incomplete global state information. Simulation studies show that our heuristic scheduling algorithm functions well in a wide range of application environments. The performance of our heuristic algorithm measured under various metrics is very close to that obtained via the algorithm though the optimal algorithm has been proved to be NP-hard." @default.
- W310480992 created "2016-06-24" @default.
- W310480992 creator A5054380581 @default.
- W310480992 date "1986-06-01" @default.
- W310480992 modified "2023-09-27" @default.
- W310480992 title "A heuristic approach to scheduling hard real-time tasks with resource requirements in distributed systems" @default.
- W310480992 hasPublicationYear "1986" @default.
- W310480992 type Work @default.
- W310480992 sameAs 310480992 @default.
- W310480992 citedByCount "9" @default.
- W310480992 crossrefType "journal-article" @default.
- W310480992 hasAuthorship W310480992A5054380581 @default.
- W310480992 hasConcept C107568181 @default.
- W310480992 hasConcept C111919701 @default.
- W310480992 hasConcept C119948110 @default.
- W310480992 hasConcept C120314980 @default.
- W310480992 hasConcept C122141398 @default.
- W310480992 hasConcept C126255220 @default.
- W310480992 hasConcept C127456818 @default.
- W310480992 hasConcept C144133560 @default.
- W310480992 hasConcept C162853370 @default.
- W310480992 hasConcept C175893541 @default.
- W310480992 hasConcept C206729178 @default.
- W310480992 hasConcept C31689143 @default.
- W310480992 hasConcept C33923547 @default.
- W310480992 hasConcept C41008148 @default.
- W310480992 hasConcept C68387754 @default.
- W310480992 hasConcept C79403827 @default.
- W310480992 hasConcept C9233905 @default.
- W310480992 hasConceptScore W310480992C107568181 @default.
- W310480992 hasConceptScore W310480992C111919701 @default.
- W310480992 hasConceptScore W310480992C119948110 @default.
- W310480992 hasConceptScore W310480992C120314980 @default.
- W310480992 hasConceptScore W310480992C122141398 @default.
- W310480992 hasConceptScore W310480992C126255220 @default.
- W310480992 hasConceptScore W310480992C127456818 @default.
- W310480992 hasConceptScore W310480992C144133560 @default.
- W310480992 hasConceptScore W310480992C162853370 @default.
- W310480992 hasConceptScore W310480992C175893541 @default.
- W310480992 hasConceptScore W310480992C206729178 @default.
- W310480992 hasConceptScore W310480992C31689143 @default.
- W310480992 hasConceptScore W310480992C33923547 @default.
- W310480992 hasConceptScore W310480992C41008148 @default.
- W310480992 hasConceptScore W310480992C68387754 @default.
- W310480992 hasConceptScore W310480992C79403827 @default.
- W310480992 hasConceptScore W310480992C9233905 @default.
- W310480992 hasLocation W3104809921 @default.
- W310480992 hasOpenAccess W310480992 @default.
- W310480992 hasPrimaryLocation W3104809921 @default.
- W310480992 hasRelatedWork W1502725285 @default.
- W310480992 hasRelatedWork W1705148050 @default.
- W310480992 hasRelatedWork W1971293054 @default.
- W310480992 hasRelatedWork W2001200190 @default.
- W310480992 hasRelatedWork W2088899347 @default.
- W310480992 hasRelatedWork W2123139831 @default.
- W310480992 hasRelatedWork W2409692677 @default.
- W310480992 hasRelatedWork W2430994543 @default.
- W310480992 hasRelatedWork W2784202640 @default.
- W310480992 hasRelatedWork W2809661854 @default.
- W310480992 hasRelatedWork W2906965376 @default.
- W310480992 hasRelatedWork W2944232467 @default.
- W310480992 hasRelatedWork W2968612130 @default.
- W310480992 hasRelatedWork W2970585064 @default.
- W310480992 hasRelatedWork W3008773625 @default.
- W310480992 hasRelatedWork W3016609305 @default.
- W310480992 hasRelatedWork W3091295699 @default.
- W310480992 hasRelatedWork W3110825344 @default.
- W310480992 hasRelatedWork W2242281095 @default.
- W310480992 hasRelatedWork W2548338557 @default.
- W310480992 isParatext "false" @default.
- W310480992 isRetracted "false" @default.
- W310480992 magId "310480992" @default.
- W310480992 workType "article" @default.