Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Mapping a chain task to chained processors
Information Processing Letters
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
Recursive Bipartitioning of Signal Flow Graphs for Programmable Video Signal Processors
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Optimal task assignment in heterogeneous computing systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Fast optimal load balancing algorithms for 1D partitioning
Journal of Parallel and Distributed Computing
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
Context aware body area networks for telemedicine
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Smart distribution of bio-signal processing tasks in m-health
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
| Hi-index | 0.00 |
We address the problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. We describe polynomial exact and approximate algorithms for this class that are better than any of the previously reported algorithms. Our approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic task can then be carried out using fast search techniques.Index Terms驴Approximation algorithms, assignments, chains, distributed computing, host-satellite systems, load balancing, partitioning, parallel processing, trees.