Maximizing parallelism and minimizing synchronization with affine partitions

DOI10.1016/S0167-8191(98)00021-0zbMath0904.68045OpenAlexW1969152955MaRDI QIDQ1128847

Amy W. Lim, Monica S. Lam

Publication date: 13 August 1998

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(98)00021-0

zbMATH Keywords

parallelismsynchronizationmultiprocessorsparallelizing compilersaffine transformsaffine partitionscoarse granularity

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computer system organization (68M99)

Related Items (6)

Sufficient conditions for the determination and use of data in the same granular parallel computation process ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations ⋮ A consistent generation of pipeline parallelism and distribution of operations and data among processors ⋮ Revisiting communication code generation algorithms for message-passing systems

This page was built for publication: Maximizing parallelism and minimizing synchronization with affine partitions