Superword-Level Parallelism in the Presence of Control Flow

In this paper, we describe how to extend the concept of superword-level parallelization (SLP), used for multimedia extension architectures, so that it can be applied in the presence of control flow constructs. Superword-level parallelization involves identifying scalar instructions in a large basic...

Full description

Saved in:
Bibliographic Details
Published in:International Symposium on Code Generation and Optimization : CGO 2005 : 20-23 March, 2005 : San Jose, California pp. 165 - 175
Main Authors: Shin, Jaewook, Hall, Mary, Chame, Jacqueline
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 20.03.2005
IEEE
Series:ACM Conferences
Subjects:
Aggregates
Appropriate technology
Automatic control
Computer architecture
Computing methodologies > Parallel computing methodologies > Parallel programming languages
Concurrent computing
Hardware
Instruction sets
Microprocessors
Open loop systems
Parallel processing
Security and privacy > Systems security > Information flow control
Security and privacy > Systems security > Operating systems security
Software and its engineering > Software notations and tools > General programming languages > Language types > Parallel programming languages
Theory of computation > Models of computation > Concurrency
Theory of computation > Models of computation > Concurrency > Parallel computing models
ISBN:9780769522982, 076952298X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we describe how to extend the concept of superword-level parallelization (SLP), used for multimedia extension architectures, so that it can be applied in the presence of control flow constructs. Superword-level parallelization involves identifying scalar instructions in a large basic block that perform the same operation, and, if dependences do not prevent it, combining them into a superword operation on a multi-word object. A key insight is that we can use techniques related to optimizations for architectures supporting predicated execution, even for multimedia ISAs that do not provide hardware predication. We derive large basic blocks with predicated instructions to which SLP can be applied. We describe how to minimize overheads for superword predicates and re-introduce control flow for scalar operations. We discuss other extensions to SLP to address common features of real multimedia codes. We present automatically-generated performance results on 8 multimedia codes to demonstrate the power of this approach. We observe speedups ranging from 1.97X to 15.07X as compared to both sequential execution and SLP alone.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780769522982
076952298X
DOI:10.1109/CGO.2005.33