Genetic algorithm based heuristics for the mapping problem
From MaRDI portal
Publication:1342316
DOI10.1016/0305-0548(94)P2435-7zbMath0813.90090MaRDI QIDQ1342316
S. Arun-Kumar, T. Chockalingam
Publication date: 13 February 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
genetic algorithmsmapping problemassigning parallel tasks onto a multiprocessorhybrid genetic mapping heuristic
Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Genetics and epigenetics (92D10)
Related Items
Metaheuristics: A bibliography, The maximum common edge subgraph problem: A polyhedral investigation, A heuristic-based genetic algorithm for workload smoothing in assembly lines
Cites Work
- Unnamed Item
- Hypercube embedding heuristics: An evaluation
- A randomized heuristics for the mapping problem: The genetic approach
- Cluster partitioning approaches to mapping parallel programs onto a hypercube
- A Heuristic Algorithm for Small Separators in Arbitrary Graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
