Allocating data to distributed-memory multiprocessors by genetic algorithms
We present three genetic algorithms (GAs) for allocating irregular data sets to multiprocessors. These are a sequential hybrid GA, a coarse-grain GA and a fine-grain GA. The last two are based on models of natural evolution that are suitable for parallel implementation; they have been implemented on...
Saved in:
| Main Author: | Mansour, Nashat (author) |
|---|---|
| Other Authors: | Fox, Geoffrey C. (author) |
| Format: | article |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10725/2947 http://dx.doi.org/10.1002/cpe.4330060602 http://onlinelibrary.wiley.com/doi/10.1002/cpe.4330060602/full |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
by: Mansour, Nashat
Published: (1992) -
Allocation and re-allocation of data in a grid using an adaptive genetic algorithm
by: Mansour, N.
Published: (2006) -
A hybrid genetic algorithm for task allocation in multicomputers
by: Mansour, Nashat
Published: (2018) -
Parallel physical optimization algorithms for allocating data to multicomputer nodes
by: Mansour, Nashat
Published: (1994) -
Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations
by: Mansour, Nashat
Published: (1992)