Partitioning problems in parallel, pipeline, and distributed computing

Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows

“…We have also discussed the relationship with the chains-to-chains problem [10,14,16,17,22,23] in Sect. 1.…”

“…, a n , this problem is to partition the array into p intervals whose element sums are well balanced (technically, the aim is to minimize the largest sum of the elements of any interval). This problem has been extensively studied in the literature (see the pioneering papers [10,14,22] and the survey [23]). It amounts to load-balance n computations whose ordering must be preserved (hence the restriction to intervals) onto p identical processors.…”

A Survey on Parallel Multicore Computing: Performance & Improvement

“…5. The Pipeline or Producer-Consumer Model: in this model, the data is passed through a pipeline which consists of a set of stages where the output from one stage becomes an input to the next one to achieve overlapping [40]. 6.…”

Task distribution based adaptation in mobile patient monitoring systems

“…In various work, task assignment problem has been referred to as allocation [SWG92], partitioning [Bok88], matching [BSBB98,Ds02] or mapping 1 [Bok81]. It also appeared in literature on task scheduling and sometimes is regarded as a scheduling problem [CK88,KA99].…”

“…This means that they require two connected tasks to be assigned to either the same processor or two adjacent processors. This property is defined as the contiguity constraint in [Bok88]. Some work permit the existence of relaying processors in their resource models, e.g., [Fra96,LS97].…”