Formation of Plans for Organizing Parallel Computing on Processors with Very Long Instruction Word

The article examines the issues of developing rational methods for developing schedules (execution plans) of programs for processors with a very long machine word (VLIW-architecture). The implementation of the task is carried out on the basis of an approach based on the analysis of the information structure of algorithms and targeted equivalent transformations of the tiered-parallel form of algorithm graphs. The developed software system allows implementing various (heuristic) methods for constructing a parallel program execution schedule and quantitatively evaluating and comparing the computational complexity of these methods. Quantitative results of applying some methods for constructing rational plans for parallel execution of classical data processing algorithms on processors with an extra-long machine word are presented.

Authors

Publication Details

Journal
PROGRAMMNAYA INGENERIA
Published
2025-03-24
DOI
https://doi.org/10.17587/prin.16.115-121
Primary Topic
Advanced Data Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Formation of Plans for Organizing Parallel Computing on Processors with Very Long Instruction Word

Valery Bakanov
PROGRAMMNAYA INGENERIA
Advanced Data Processing Techniques
article

Formation of Plans for Organizing Parallel Computing on Processors with Very Long Instruction Word

Valery Bakanov
article en

Abstract

The article examines the issues of developing rational methods for developing schedules (execution plans) of programs for processors with a very long machine word (VLIW-architecture). The implementation of the task is carried out on the basis of an approach based on the analysis of the information structure of algorithms and targeted equivalent transformations of the tiered-parallel form of algorithm graphs. The developed software system allows implementing various (heuristic) methods for constructing a parallel program execution schedule and quantitatively evaluating and comparing the computational complexity of these methods. Quantitative results of applying some methods for constructing rational plans for parallel execution of classical data processing algorithms on processors with an extra-long machine word are presented.

PROGRAMMNAYA INGENERIAVol. 16(3)
Openalex Percentile: Top 94%
Advanced Data Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.