The Divide-and-conquer (D&C) pattern appears in a large number of problems and is highly suitable to exploit parallelism. This has led to much research on its easy and efficient application both in shared and distributed memory parallel systems. One of the most successful approaches explored in this area consists of expressing this pattern by means of parallel skeletons which automate and hide the complexity of the parallelization from the user while trying to provide good performance. In this paper, we tackle the development of a skeleton oriented to the efficient parallel resolution of D&C problems with a high degree of imbalance among the subproblems generated and/or a deep level of recurrence. The skeleton achieves in our experiments average speedups between 11 and 18% higher than those of other solutions, reaching a maximum speedup of 78% in some tests. Nevertheless, the new proposal requires an average of between 13 and 29% less programming effort than the usual alternatives.

分而治之（D＆C）模式出现在许多问题中，非常适合利用并行性。这导致人们对其在共享和分布式内存并行系统中的简便有效的应用进行了大量研究。在该领域中探索的最成功的方法之一是通过并行框架来表达此模式，该框架可以自动地向用户隐藏并行化的复杂性，同时试图提供良好的性能。在本文中，我们解决了面向D＆C问题的有效并行解决方案的框架的开发，该框架在生成的子问题之间存在高度不平衡和/或深度重复出现。在我们的实验中，骨架比其他解决方案的平均速度提高了11％至18％，在某些测试中达到了78％的最大加速。不过，新提案要求的编程工作量比通常的方案平均少13％到29％。