Satin is a system for running divide and conquer programs on distributed memory systems (and ultimately on wide-area metacomputing systems). Satin extends Java with three simple Cilk-like primitives for divide and conquer programming. The Satin compiler and runtime system cooperate to implement these primitives efficiently on a distributed system, using work stealing to distribute the jobs. Sat...

In the 1970’s and early 80’s most program derivations were special cases of divide-and-conquer (unfortunately, this is still too often true), probably because they are some of the easiest induction arguments to push through a prover. So it seemed interesting to try to capture divide-and-conquer more abstractly, rather than repeatedly discovering instances of it. From this effort came the notion...

In this paper, we present a low complexity bit-parallel Montgomery multiplier for GF(2m) generated with a special class of irreducible pentanomials xm + xm−1 + xk + x + 1. Based on a combination of generalized polynomial basis (GPB) squarer and a newly proposed square-based divide and conquer approach, we can partition field multiplications into a composition of sub-polynomial multiplications a...

We present a divide-and-conquer method that efficiently finds a near-optimal distribution of sensing locations for free-form surface digitization. We formulate a next-best-point problem and transform the uncertainty of a B-spline surface into a higher-dimensional B-spline surface. This technique allows the use of the convex hull and subdivision properties of B-spline surfaces in the divide-and-...

Out-of-memory problem was frequently encountered when processing thousands of CEL files using Bioconductor. We propose a divide-and-conquer strategy combined with randomised resampling to solve this problem. The CAMDA 2007 META-analysis data set which contains 5896 CEL files was used to test the approach on a typical commodity computer cluster by running established pre-processing algorithms fo...

We suggest that the components of the well known divide-and-conquer paradigm can be prootably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal in the context of a rendition of Batcher's bitonic sorting algorithm in which the nested parallel structure of the program is neatly abstracted from the low level detail of a at presentation. We s...

This paper discusses the uses of context in knowledge representation and reasoning (KRR). We propose to partition the theories of context brought forward in KRR into two main classes, which we call divide-and-conquer and compose-and-conquer. We argue that this partition provides a possible explanation of why in KRR context is used to solve different types of problems, or to address the same pro...