Efficient solutions for mapping parallel programs-Reference-Cited by-同舟云学术

Efficient solutions for mapping parallel programs

Published:1995 Issue: Volume: Page:379-390
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bouvry P.,de Kergommeaux J. Chassin,Trystram D.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0020479

Reference11 articles.

1. J. Błażewicz, P. Bouvry, D. Trystram, and R. Walkowiak. A tabu search algorithm for solving the mapping problem. 1995. European Conference on Combinatorial Optimization, ECCO'95.

2. S. W. Bollinger and S. F. Midkiff. Processor and link assignment in multicomputers using simulated annealing. In ICPP, 1988.

3. P. Bouvry, J.-P. Kitajima, B. Plateau, and D. Trystram. Andes: A performance evaluation tool, application to the mapping problem. submitted for publication.

4. T.L. Casavant and J.G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 1988.

5. F. Glover and M. Laguna. Tabu Search, a chapter in Modern Heuristic Techniques for Combinatorial Problems. W.H. Freeman, N-Y, 1992.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Task Allocation Problem;Applications of Combinatorial Optimization;2014-08-08

2. Solving the three dimensional quadratic assignment problem on a computational grid;Cluster Computing;2013-10-12

3. The Task Allocation Problem;Applications of Combinatorial Optimization;2013-02-13

4. Genetic Algorithms for Task Scheduling Problem;Foundations of Computational Intelligence Volume 3;2009

5. Task Allocation for Minimizing Programs Completion Time in Multicomputer Systems;Computational Science and Its Applications – ICCSA 2004;2004