Finding and using directed cuts of real graphs of algorithms
From MaRDI portal
Publication:5930916
zbMath0973.68513MaRDI QIDQ5930916
No author found.
Publication date: 27 November 2001
Published in: Programming and Computer Software (Search for Journal in Brave)
Related Items (3)
Optimization of data exchange in parallel computers with distributed memory ⋮ Sufficient conditions for the determination and use of data in the same granular parallel computation process ⋮ Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
This page was built for publication: Finding and using directed cuts of real graphs of algorithms
