Parallelization of sequential programs: distribution of arrays among processors and structurization of communications

DOI10.1007/s10559-012-9382-2zbMath1276.68047OpenAlexW2020691778MaRDI QIDQ380672

A. O. Sikorsky, E. V. Adutskevich, N. A. Likhoded

Publication date: 14 November 2013

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: http://elib.bsu.by/handle/123456789/10179

zbMATH Keywords

parallel computingaffine loop nestoptimization of communicationsparallel computer with distributed memoryparallelization of algorithms

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10) Data structures (68P05) Distributed systems (68M14)

Related Items

Sufficient conditions for the determination and use of data in the same granular parallel computation process, Unnamed Item

Cites Work

• Compiling affine nested loops: How to optimize the residual communications after the alignment phase
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Mapping affine loop nests
• Optimization of data exchange in parallel computers with distributed memory
• A consistent generation of pipeline parallelism and distribution of operations and data among processors
• Mapping of affine loop nests onto independent processors
• Resource-constrained scheduling of partitioned algorithms on processor arrays
• Information structure of sequential programs
• Finding and using directed cuts of real graphs of algorithms
• Unnamed Item
• Unnamed Item