Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction

Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelising loops. Recursive procedures, which are also frequently used in real-world applications, have attracted much less attention. Moreover, the parallel threads in prior work are statically predicted and spawned. In this paper, we introduce a new compiler technique, called Speculative Parallelisation of Recursive Procedures (SPRP), to exploit speculative TLP (thread-level parallelism) in recursive procedures. SPRP combines a dynamic thread-spawning policy and a live-in prediction mechanism in a single helper thread that executes a distilled version of a procedure on a dedicated core. It serves to predict both the invocation order of recursive calls and their live-ins in concert and dispatches these calls to the other cores in a multicore system for parallel execution. To our knowledge, SPRP is the first compiler...

• Type: Conference
• Year: 2009
• Where: CC
• Authors: Lin Gao 0002, Lian Li 0002, Jingling Xue, Tin-Fook Ngai
• Keywords: CC 2009, Certain Recursive Benchmarks, Programming Languages, Recursive Calls, Recursive Procedures