(1) Background: Structuring is important in parallel programming order to master its complexity, and this structuring could be achieved through patterns skeletons. Divide-and-conquer computation essentially defined by a recurrence relation that links the solution of problem solutions subproblems same type, but smaller sizes. This pattern allows specification different types computations, so it ...

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

The NAS Parallel Benchmarks (NPB), originally implemented mostly in Fortran, is a consolidated suite containing several benchmarks extracted from Computational Fluid Dynamics (CFD) models. benchmark has important characteristics such as intensive memory communications, complex data dependencies, different access patterns, and hardware components/sub-systems overload. programming APIs, libraries...