Paper Info
Title
Derivation of Packing Instructions for Exploiting Sub-Word Parallelism
Abstract
Today the presence of sub-word parallelism (SWP) is quite general in several architectures such as in general purpose processors or in the functional units of connected processing elements of application specific architectures. A skillful utilization of sub-word parallelism, i.e. the parallel execution of operations on data with low word width (subwords), has a strong impact on the system performance. In this paper we derive a method for transforming an algorithm using single instructions on sub-words to an efficient I/O equivalent algorithm using SWP-instructions on full length words (FLWs) where the sub-words have to be packed to FLWs. The method allows a full automation of this process. For architectures with parallel processing on different levels the derived algorithm on FLWs can be distributed on further higher levels of parallelism such as on several functional units and several processing elements analogous to the approach presented.
Year
DOI
Venue
2006
10.1109/PARELEC.2006.28
PARELEC
Keywords
Field
DocType
sub-word parallelism,general purpose processor,functional unit,connected processing element,parallel execution,exploiting sub-word parallelism,full automation,parallel processing,packing instructions,o equivalent algorithm,full length word,processing element,instruction sets,parallel algorithms,system performance
Instruction-level parallelism,Application specific,General purpose,Instruction set,Parallel algorithm,Computer science,Task parallelism,Parallel computing,Automation,Data parallelism
Conference
ISBN
Citations 
PageRank 
0-7695-2554-7
2
0.38
References 
Authors
7
3
Name
Order
Citations
PageRank
Rainer Schaffer1295.30
Renate Merker215920.59
Francky Catthoor33932423.30