A popular approach to providing non-experts in parallel computing with an easy-to-use programming model, is to design a software library consisting of a set of pre-parallelized routines, and hide the intricacies of parallelization behind the library's API. However, for regular domain problems (such as simple matrix manipulations or low level image processing applications | in which all elements in a regular subset of a dense data eld are accessed in turn) speedup obtained with many such library-based parallelization tools is often sub-optimal. This is because inter-operation optimization (or: time-optimization of communication steps across library calls) is generally not incorporated in the library implementations.