Just-In-Time Scheduling for Loop-based Speculative Parallelization

Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’ before an acceptable chunk size is found. Other traditional scheduling methods were originally designed for loops with no dependences, so they are primarily focused in the problem of load balancing. In general, all these methods perform poorly when used for speculative parallelization, where loops may present unexpected dependences that adversely affect performance. In this work we address the problem of scheduling loops with and without dependences for speculative execution. We have found that a trade-off between minimizing the number of re-executions and reducing overheads can be found if the size of the scheduled block of iterations is calculated at runtime. We introduce here a scheduling method called Just-InTime (JIT) scheduling that uses the information available during the execution of the loop in ord...

• Type: Conference
• Year: 2008
• Where: PDP
• Authors: Diego R. Llanos Ferraris, David Orden, Belén Palop
• Keywords: Distributed And Parallel Computing, Other Traditional Scheduling, PDP 2008, Scheduling Method, Speculative Parallelization