Matches in SemOpenAlex for { <https://semopenalex.org/work/W2164548559> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2164548559 endingPage "586" @default.
- W2164548559 startingPage "575" @default.
- W2164548559 abstract "This paper considers the problem of finding an optimal and sub-optimal task-allocation (assign the processing node for each module of a task or program) in redundant distributed computing systems, with the goal of maximizing system-reliability (probability that the system completes the entire task successfully). Finding an optimal task-allocation is NP-hard in the strong sense. An efficient algorithm is presented for optimal task-allocation in a distributed computing system with level-2 redundancy. The algorithm, (a) uses branch and bound with underestimates for reducing the average time complexity of optimal task-allocation computations, and (b) reorders the list of modules to allow a subset of modules that does not intra-communicate to be assigned last, for further reduction in the computations of optimal task-allocation for maximizing reliability. An efficient heuristics algorithm is given which obtains sub-optimal solutions in a reasonable computation time. The performance of our algorithms is given over a wide range of parameters such as number of modules, number of processing nodes, ratio of average execution cost to average communication cost, and connectivity of modules. The effectiveness of the optimal task-allocation algorithm is demonstrated by comparing it to a competing optimal task-allocation algorithm, for maximizing reliability. The performance of our algorithm improves very much when the difference between the number of modules and the connectivity increases." @default.
- W2164548559 created "2016-06-24" @default.
- W2164548559 creator A5012659086 @default.
- W2164548559 creator A5012741921 @default.
- W2164548559 date "1995-01-01" @default.
- W2164548559 modified "2023-09-24" @default.
- W2164548559 title "Improved task-allocation algorithms to maximize reliability of redundant distributed computing systems" @default.
- W2164548559 cites W2067936976 @default.
- W2164548559 cites W2151297797 @default.
- W2164548559 doi "https://doi.org/10.1109/24.475976" @default.
- W2164548559 hasPublicationYear "1995" @default.
- W2164548559 type Work @default.
- W2164548559 sameAs 2164548559 @default.
- W2164548559 citedByCount "45" @default.
- W2164548559 countsByYear W21645485592012 @default.
- W2164548559 countsByYear W21645485592013 @default.
- W2164548559 countsByYear W21645485592014 @default.
- W2164548559 countsByYear W21645485592015 @default.
- W2164548559 countsByYear W21645485592016 @default.
- W2164548559 countsByYear W21645485592017 @default.
- W2164548559 countsByYear W21645485592018 @default.
- W2164548559 countsByYear W21645485592019 @default.
- W2164548559 countsByYear W21645485592020 @default.
- W2164548559 countsByYear W21645485592021 @default.
- W2164548559 crossrefType "journal-article" @default.
- W2164548559 hasAuthorship W2164548559A5012659086 @default.
- W2164548559 hasAuthorship W2164548559A5012741921 @default.
- W2164548559 hasConcept C111919701 @default.
- W2164548559 hasConcept C11413529 @default.
- W2164548559 hasConcept C120314980 @default.
- W2164548559 hasConcept C121332964 @default.
- W2164548559 hasConcept C126255220 @default.
- W2164548559 hasConcept C127705205 @default.
- W2164548559 hasConcept C152124472 @default.
- W2164548559 hasConcept C162324750 @default.
- W2164548559 hasConcept C163258240 @default.
- W2164548559 hasConcept C179799912 @default.
- W2164548559 hasConcept C187736073 @default.
- W2164548559 hasConcept C2780451532 @default.
- W2164548559 hasConcept C33923547 @default.
- W2164548559 hasConcept C41008148 @default.
- W2164548559 hasConcept C43214815 @default.
- W2164548559 hasConcept C45374587 @default.
- W2164548559 hasConcept C62520636 @default.
- W2164548559 hasConceptScore W2164548559C111919701 @default.
- W2164548559 hasConceptScore W2164548559C11413529 @default.
- W2164548559 hasConceptScore W2164548559C120314980 @default.
- W2164548559 hasConceptScore W2164548559C121332964 @default.
- W2164548559 hasConceptScore W2164548559C126255220 @default.
- W2164548559 hasConceptScore W2164548559C127705205 @default.
- W2164548559 hasConceptScore W2164548559C152124472 @default.
- W2164548559 hasConceptScore W2164548559C162324750 @default.
- W2164548559 hasConceptScore W2164548559C163258240 @default.
- W2164548559 hasConceptScore W2164548559C179799912 @default.
- W2164548559 hasConceptScore W2164548559C187736073 @default.
- W2164548559 hasConceptScore W2164548559C2780451532 @default.
- W2164548559 hasConceptScore W2164548559C33923547 @default.
- W2164548559 hasConceptScore W2164548559C41008148 @default.
- W2164548559 hasConceptScore W2164548559C43214815 @default.
- W2164548559 hasConceptScore W2164548559C45374587 @default.
- W2164548559 hasConceptScore W2164548559C62520636 @default.
- W2164548559 hasIssue "4" @default.
- W2164548559 hasLocation W21645485591 @default.
- W2164548559 hasOpenAccess W2164548559 @default.
- W2164548559 hasPrimaryLocation W21645485591 @default.
- W2164548559 hasRelatedWork W1522517976 @default.
- W2164548559 hasRelatedWork W175425379 @default.
- W2164548559 hasRelatedWork W1756885467 @default.
- W2164548559 hasRelatedWork W2034983601 @default.
- W2164548559 hasRelatedWork W2041508386 @default.
- W2164548559 hasRelatedWork W2074705589 @default.
- W2164548559 hasRelatedWork W2081647779 @default.
- W2164548559 hasRelatedWork W2884576438 @default.
- W2164548559 hasRelatedWork W2905364337 @default.
- W2164548559 hasRelatedWork W3042941765 @default.
- W2164548559 hasVolume "44" @default.
- W2164548559 isParatext "false" @default.
- W2164548559 isRetracted "false" @default.
- W2164548559 magId "2164548559" @default.
- W2164548559 workType "article" @default.