An object-oriented framework for the divide-and-conquer (D&C) paradigm is presented. The framework enables a D&C representation of a problem to be built up for subsequent evaluation. This evaluation can be delayed until the maximum amount of computation that can be performed in one D&C pass has been integrated into the representation. This framework does not require a parallelizing compiler and therefore provides an environment that is flexible and easily extensible. D&C thus provides a structure suitable for parallel implementation and object-oriented programming techniques provide a means to encapsulate the D&C semantics and provide a uniform interface to the end-user. Results are presented for an implementation of the back-propagation algorithm.<<ETX>>
[1]
M. Ronan Sleep,et al.
Transputer-Based Experiments with the ZAPP Architecture
,
1987,
PARLE.
[2]
Fethi A. Rabhi,et al.
Divide-and-conquer and parallel graph reduction
,
1991,
Parallel Comput..
[3]
A. S. Grimshaw,et al.
The Mentat Run-Time System: Support for Medium Grain Parallel Computation
,
1990,
Proceedings of the Fifth Distributed Memory Computing Conference, 1990..
[4]
Tom Axford.
An elementary language construct for parallel programming
,
1990,
SIGP.
[5]
Structures and Algorithms with Java — Fall 2017
,
.
[6]
H. Lipkin.
Where is the ?c?
,
1978
.