Assignment of Tasks in a Distributed Processor System with Limited Memory
From MaRDI portal
Publication:4181258
DOI10.1109/TC.1979.1675348zbMath0397.68024MaRDI QIDQ4181258
No author found.
Publication date: 1979
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Deterministic network models in operations research (90B10) Theory of operating systems (68N25)
Related Items (15)
Optimal task assignment with precedence in distributed computing systems ⋮ On approximating the memory-constrained module allocation problem ⋮ A methodology for multicriteria network partitioning ⋮ Analysis of the module assignment problem in distributed computing systems with limited storage ⋮ Unnamed Item ⋮ Linear programming for the \(0-1\) quadratic knapsack problem ⋮ Optimal partitioning and granularity of uniform task graphs ⋮ Real-time task reallocation in fault-tolerant distributed computer systems ⋮ An LC branch-and-bound algorithm for the module assignment problem ⋮ Task allocation in fault-tolerant distributed systems ⋮ Assignment of program modules to processors: a simulated annealing approach. ⋮ Un algoritmo per il partizionamento ottimo di una nuova classe di grafi ⋮ A hybrid genetic/optimization algorithm for a task allocation problem ⋮ Optimal task allocation in hyercube multiprocessor ensembles ⋮ A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
This page was built for publication: Assignment of Tasks in a Distributed Processor System with Limited Memory
