Parallel physical optimization algorithms for allocating data to multicomputer nodes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 529792 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 218294 (Why is no real title available?)
- AN ANNEALING-BASED CIRCUIT PARTITIONER FOR HYPERCUBE ARCHITECTURE: DESIGN AND PERFORMANCE EVALUATION
- Collective Computation With Continuous Variables
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Simulated annealing: A tool for operational research
Cited in
(5)- Optimal allocation of requirements to parallel devices
- scientific article; zbMATH DE number 1751916 (Why is no real title available?)
- Evaluation of neural and genetic algorithms for synthesizing parallel storage schemes
- Bi-Objective Optimization of Data-Parallel Applications on Homogeneous Multicore Clusters for Performance and Energy
- Metaheuristics: A bibliography
This page was built for publication: Parallel physical optimization algorithms for allocating data to multicomputer nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329110)