A thread partitioning approach for speculative multithreading

Speculative multithreading (SpMT) is a thread-level automatic parallelization technique, which partitions sequential programs into multithreads to be executed in parallel. This paper presents different thread partitioning strategies for nonloops and loops. For nonloops, we propose a cost estimation...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing 2014-03, Vol.67 (3), p.778-805
Main Authors: Liu, Bin, Zhao, Yinliang, Li, Yuxiang, Sun, Yanjun, Feng, Boqin
Format: Article
Language:English
Subjects:
Benchmarks
Boundaries
Compilers
Computer Science
Interpreters
Multilevel
Partitioning
Partitions
Processor Architectures
Programming Languages
Run time (computers)
Strategy
Wastes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Speculative multithreading (SpMT) is a thread-level automatic parallelization technique, which partitions sequential programs into multithreads to be executed in parallel. This paper presents different thread partitioning strategies for nonloops and loops. For nonloops, we propose a cost estimation based on combined run-time effects of various speculation factors to predict the resulting performance of candidate threads to guide the thread partitioning. For loops, we parallelize all the profitable loops that can potentially offer additional performance benefits by multilevel spawning in loop bodies, loop iterations, and inner loops. Then we select a proper thread boundary located in the front of loop branch instruction to reduce invalid spawning threads that waste core resources. Experimental results show that the proposed approach can obtain a significant increase in speedup and Olden benchmarks reach a performance improvement of 6.62 % on average.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-013-1000-1