Profile-driven instruction level parallel scheduling with application to super blocks

A general paradigm for converting any profile-insensitive list to a profile-sensitive scheduler is proposed. This technique is developed via a theoretical analysis of a simplified abstract model of the general problem of profile-driven scheduling over any cyclic code region, yielding a scoring measu...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the annual International Symposium on Microarchitecture pp. 58 - 67
Main Authors Chekuri, C, Johnson, R, Motwani, R, Natarajan, B, Rau, B R, Schlansker, M
Format Journal Article
LanguageEnglish
Published 01.01.1996
Online AccessGet full text

Cover

More Information
Summary:A general paradigm for converting any profile-insensitive list to a profile-sensitive scheduler is proposed. This technique is developed via a theoretical analysis of a simplified abstract model of the general problem of profile-driven scheduling over any cyclic code region, yielding a scoring measure for ranking branch instructions. The ranking digests the profile information and has the useful property that scheduling with respect to rank is probably good for minimizing the expected completion time of the region, within the limits of abstraction. While the ranking scheme is computationally intractable in the most general case, this is practicable for super blocks.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:1072-4451