GPMB—software pipelining branch-intensive loops

Tang, Zhihong; Chen, Gang; Zhang, Chihong; Zhang, Yingwei; Su, Bogong; Habib, Stanley

doi:10.1109/micro.1993.282738

Cited by 23 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Modulo scheduling with if-conversion has been shown to perform better than GURPR* which under schedules its resources [24]. The most recent technique proposed by the GURPR* researchers, GPMB, allows multi-way branches but still uses a single I1 [22]. GPMB and modulo scheduling with predicated execution have the same 11; modulo scheduling with predicated execution has lower code expansion since it does not require code copying; and GPMB has better function unit utilization since only one path executes as opposed to all paths with predicated execution [22].…”

Section: Related Workmentioning

confidence: 99%

Modulo scheduling with multiple initiation intervals

Warter-Perez¹,

Partamian²

1995

Proceedings of the 28th Annual International Symposium on Microarchitecture

View full text Add to dashboard Cite

Modulo scheduling is a well defined local scheduling based software pipelining technique. One disadvantage of traditional modulo scheduling is that it has a single initiation interval (11) for loops with multiple execution paths. Thus, shorter or more frequently executed paths will be penalized by longer or less frequently executed paths. Furthermore, for architectures with predicated execution, this single I1 must be large enough to satish the resource and recurrence requirements of all operations from all execution paths rather than the requirements of the most constrained path.In this paper, a multiple-I1 modulo scheduling technique is proposed for architectures with predicated execution. This enhancement to modulo scheduling maintains the benefits of a local scheduling based approach while reducing the effective 11.

show abstract

Section: Related Workmentioning

confidence: 99%

Modulo scheduling with multiple initiation intervals

Warter-Perez¹,

Partamian²

1995

Proceedings of the 28th Annual International Symposium on Microarchitecture

View full text Add to dashboard Cite

show abstract

“…Loops that do not contain conditional branches (IF-THEN-ELSE constructs) have been both theoretically and practically analyzed in detail [2,5,9,11,20]. In contrast, there are few theoretical and empirical results for loops with conditional branches [10,12,22,27], and several effective methods for their optimization [6,7,14,16,17,23,24,25,26,28,30]. This work addresses the problem of parallelization of such loops.…”

Section: Introductionmentioning

confidence: 99%