Heuristics for Mapping Parallel Computations to Parallel Architectures
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10661220,p. 36-41
- https://doi.org/10.1109/whp.1993.664363
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Multi-way graph partition by stochastic probeComputers & Operations Research, 1993
- An efficient algorithm for a task allocation problemJournal of the ACM, 1992
- Heuristic technique for processor and link assignment in multicomputersIEEE Transactions on Computers, 1991
- Improved algorithms for mapping pipelined and parallel computationsIEEE Transactions on Computers, 1991
- Task allocation onto a hypercube by recursive mincut bipartitioningJournal of Parallel and Distributed Computing, 1990
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Heuristic algorithms for task assignment in distributed systemsIEEE Transactions on Computers, 1988
- Partitioning problems in parallel, pipeline, and distributed computingIEEE Transactions on Computers, 1988
- On the Mapping ProblemIEEE Transactions on Computers, 1981