A finite state machine based format model of software pipelined loops with conditions

  • Authors:
  • Dragan Milicev;Zoran Jovanovic

  • Affiliations:
  • Department of Computer Science, Faculty of Electrical Engineering, University of Belgrade ,POB 35-54, 11120 Belgrade, YUGOSLAVIA;Department of Computer Science, Faculty of Electrical Engineering, University of Belgrade ,POB 35-54, 11120 Belgrade, YUGOSLAVIA

  • Venue:
  • Progress in computer research
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the problem of parallelizing loops with conditional branches, in the context of software pipelining. A new formal approach to this problem is proposed, called the predicated Software Pipelining (PSP) model. The PSP model represents execution of a loop with conditional branches as trasitions of a finite state machine Each node of the state machine is composed of operations of one parallelized loop iteration. The rules of operation movements between nodes in the PSP model and discribed. The model represents a new theoritical framework for further investigation of inherent properties of these loops, as well as a basis for novel scheduling techniques.