Assignment of Tasks in a Distributed Processor System with Limited Memory

DOI10.1109/TC.1979.1675348MaRDI QIDQ4181258zbMATH OpenFDO

Authors

Publication date 1979

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1979.1675348

zbMATH Keywords

ComplexityDistributed Processor SystemNp-Complete

Mathematics Subject Classification ID

Trees (05C05) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Cited in

(15)

• A methodology for multicriteria network partitioning
• Analysis of the module assignment problem in distributed computing systems with limited storage
• Linear programming for the \(0-1\) quadratic knapsack problem
• A hybrid genetic/optimization algorithm for a task allocation problem
• Optimal task allocation in hyercube multiprocessor ensembles
• Optimal task assignment with precedence in distributed computing systems
• Assignment of program modules to processors: a simulated annealing approach.
• 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
• A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
• On approximating the memory-constrained module allocation problem
• scientific article; zbMATH DE number 3770975 (Why is no real title available?)
• Optimal partitioning and granularity of uniform task graphs
• Un algoritmo per il partizionamento ottimo di una nuova classe di grafi

This page was built for publication: Assignment of Tasks in a Distributed Processor System with Limited Memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181258)