Cluster partitioning approaches to mapping parallel programs onto a hypercube-Reference-Cited by-同舟云学术

Cluster partitioning approaches to mapping parallel programs onto a hypercube

Published:1990-01 Issue:1 Volume:13 Page:1-16
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Sadayappan P,Ercal F,Ramanujam J

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference20 articles.

1. Iterative algorithms for solution of large sparse systems of linear equations on hypercubes;Aykanat;IEEE Trans. Comput.,1988

2. A partitioning strategy for nonuniform problems on multiprocessors;Berger;IEEE Trans. Comput.,1987

3. Experience with an automatic solution to the mapping problem;Berman,1987

4. On the mapping problem;Bokhari;IEEE Trans. Comput.,1981

5. A linear-time heuristic for improving network partitions;Fiduccia,1982

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

1. Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation;PLOS ONE;2016-04-04

2. Mapping of time-consuming multitask applications on a cloud system by multiobjective Differential Evolution;Parallel Computing;2015-10

3. Two new fast heuristics for mapping parallel applications on cloud computing;Future Generation Computer Systems;2014-07

4. A distributed evolutionary approach for multisite mapping on grids;Concurrency and Computation: Practice and Experience;2011-01-14

5. A Parallel Task Assignment Using Heuristic Graph Matching;Advances in Parallel Distributed Computing;2011