An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures.
Nectarios KozirisMichael RomesisPanayotis TsanakasGeorge K. PapakonstantinouPublished in: PDP (2000)
Keyphrases
- objective function
- times faster
- cost function
- preprocessing
- computationally efficient
- clustering method
- detection algorithm
- experimental evaluation
- simulated annealing
- expectation maximization
- segmentation algorithm
- probabilistic model
- computational cost
- dynamic programming
- k means
- genetic algorithm
- significant improvement
- graph model
- parallel implementation
- undirected graph
- graph partitioning
- graph construction
- multiprocessor systems