1998Systems and Computers in JapanRequires access

Software pipelining with path selection

Chikako Nakanishi, Hideki Ando, Tetsuya Hara, Masao Nakaya

Open publisher page 0 citations

Abstract

Software pipelining is an efficient scheduling technique for VLIW and superscalar processors. Performance improvement by using conventional algorithms has been restricted due to resource occupation by infrequently executed control paths and long data-dependent paths because all the control paths in a loop are pipelined. In this paper, we propose an algorithm that performs pipelining by selecting frequently executed paths in a loop. This algorithm provides for the possibility to optimally pipeline, not only frequently executed paths, but also non-innermost loops. This has been difficult in the past. We performed a comparative evaluation of this algorithm against conventional algorithms using benchmark programs for non-numerical application, and verified its high efficiency. © 1998 Scripta Technica, Syst Comp Jpn, 29(9): 74–86, 1998

About this research paper

What this paper is about

Software pipelining is an efficient scheduling technique for VLIW and superscalar processors. Performance improvement by using conventional algorithms has been restricted due to resource occupation by infrequently executed control paths and long data-dependent paths because all the control paths in a loop are pipelined. In this paper, we propose an algorithm that performs pipelining by selecting frequently executed paths in a loop. This algorithm provides for the possibility to optimally pipeline, not only frequently executed paths, but also non-innermost loops. This has been difficult in the past. We performed a comparative evaluation of this algorithm against conventional algorithms using benchmark programs for non-numerical application, and verified its high efficiency. © 1998 Scripta Technica, Syst Comp Jpn, 29(9): 74–86, 1998

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Software pipelining is an efficient scheduling technique for VLIW and superscalar processors. Performance improvement by using conventional algorithms has been restricted due to resource occupation by infrequently executed control paths and long data-dependent paths because all the control paths in a loop are pipelined. In this paper, we propose an algorithm that performs pipelining by selecting frequently executed paths in a loop. This algorithm provides for the possibility to optimally pipeline, not only frequently executed paths, but also non-innermost loops. This has been difficult in the past. We performed a comparative evaluation of this algorithm against conventional algorithms using benchmark programs for non-numerical application, and verified its high efficiency. © 1998 Scripta Technica, Syst Comp Jpn, 29(9): 74–86, 1998

Key concepts: Software pipelining, Computer science, Very long instruction word, Parallel computing, Superscalar, Benchmark (surveying), Pipeline (software), Critical path method

Related papers

Back to paper searchBrowse research topicsOriginal source
Software pipelining with path selection — Research Paper | ScholarLens