Assignment of program modules to processors: a simulated annealing approach.
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- scientific article; zbMATH DE number 1482180 (Why is no real title available?)
- Simulated annealing algorithm in problems of multiprocessor scheduling
- scientific article; zbMATH DE number 553908 (Why is no real title available?)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- scientific article; zbMATH DE number 1417713 (Why is no real title available?)
- An adaptive partitioning algorithm for distributed discrete event simulation systems.
- Combinatorial optimisation algorithms for a CAD workstation
- Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
- An LC branch-and-bound algorithm for the module assignment problem
- Simulated annealing and the mapping problem: A computational study
- Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes
- An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal
- Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization
This page was built for publication: Assignment of program modules to processors: a simulated annealing approach.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582227)