Task assignment using a problem‐space genetic algorithm
- 1 August 1995
- journal article
- research article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 7 (5) , 411-428
- https://doi.org/10.1002/cpe.4330070506
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An efficient heuristic algorithm for mapping parallel programs onto multicomputersMicroprocessing and Microprogramming, 1993
- A generalized scheme for mapping parallel algorithmsIEEE Transactions on Parallel and Distributed Systems, 1993
- Fast allocation of processes in distributed and parallel systemsIEEE Transactions on Parallel and Distributed Systems, 1993
- A new mapping heuristic based on mean field annealingJournal of Parallel and Distributed Computing, 1992
- New Search Spaces for Sequencing Problems with Application to Job Shop SchedulingManagement Science, 1992
- A randomized heuristics for the mapping problem: The genetic approachParallel Computing, 1992
- Chaos prediction in nonlinear feedback systemsIEE Proceedings D Control Theory and Applications, 1991
- Task allocation onto a hypercube by recursive mincut bipartitioningJournal of Parallel and Distributed Computing, 1990
- Efficient computation of optimal assignments for distributed tasksJournal of Parallel and Distributed Computing, 1987
- Optimal static load balancing in distributed computer systemsJournal of the ACM, 1985