Distributed control of computer systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Task Allocation and Precedence Relations for Distributed Real-Time Systems
IEEE Transactions on Computers
SOS: synthesis of application-specific heterogeneous multiprocessor systems
Readings in hardware/software co-design
Multiple-Read Single-Write Memory and Its Applications
IEEE Transactions on Computers
Future Generation Computer Systems
The assignment of computational tasks among processors in a distributed system
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
| Hi-index | 14.99 |
A recently published algorithm shows how to assign modules to a two-processor computer system with distributed execution so as to minimize the total of execution costs and interprocessor communication costs. In this paper we consider the same problem except that one processor has limited memory capacity. Although this problem is NP-complete, techniques based on the Gomory-Hu tree from network flow theory can be applied to instances of the problem to obtain a reduction in complexity. A new technique based on a graph called the inclusive cut graph is shown to be an even more powerful tool. These two techniques can solve some instances of the problem completely; still others are reduced sufficiently to be susceptible to enumerative techniques. In the worst case, the techniques yield no reduction in problem size.