Skip to main content
Article thumbnail
Location of Repository

Limits of Task-based Parallelism in Irregular Applications

By Barbara Kreaseck, Dean Tullsen and Brad Calder

Abstract

Traditional parallel compilers do not effectively parallelize irregular applications because they contain little loop-level parallelism. We explore Speculative Task Parallelism (STP), where tasks are full procedures and entire natural loops. Through profiling and compiler analysis, we find tasks that are speculatively memory- and control-independent of their neighboring code. Via speculative futures, these tasks may be executed in parallel with preceding code when there is a high probability of independence

Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.7310
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.ucsd.edu/~calde... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.