Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
Stencils and problem partitionings: their influence on the performance of multiple processor systems
IEEE Transactions on Computers
IEEE Transactions on Computers
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Optimal parallel sorting scheme by order statistics
SIAM Journal on Computing
SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
Nearest-neighbor mapping of finite element graphs onto processor meshes
IEEE Transactions on Computers
The warp computer: Architecture, implementation, and performance
IEEE Transactions on Computers
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
A multistage linear array assignment problem
Operations Research
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Optimal Sequential Partitions of Graphs
Journal of the ACM (JACM)
Efficient Algorithms for a Class of Partitioning Problems
IEEE Transactions on Parallel and Distributed Systems
Optimal Task Assignment in Homogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
Run-time and compile-time support for adaptive irregular problems
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Communication and memory requirements as the basis for mapping task and data parallel programs
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Optimal Processor Assignment for a Class of Pipelined Computations
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Fast optimal load balancing algorithms for 1D partitioning
Journal of Parallel and Distributed Computing
Optimal partitioning of nodes to space-sharing parallel tasks
Parallel Computing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
Context aware body area networks for telemedicine
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
| Hi-index | 14.98 |
Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The improved algorithms have significantly lower time and space complexities than the more general algorithms: in one case, an O(nm/sup 3/) time algorithm for mapping m modules onto n processors is replaced with an O(nm log m) time algorithm, and the space requirements are reduced from O(nm/sup 2/) to O(m). Run-time complexity is reduced further with parallel mapping algorithms based on these improvements, which run on the architectures for which they create mappings.