A Cost-Aware Parallel Workload Allocation Approach Based on Machine Learning Techniques

Parallelism is one of the main sources for performance improvement in modern computing environment, but the efficient exploitation of the available parallelism depends on a number of parameters. Determining the optimum number of threads for a given data parallel loop, for example, is a difficult problem and dependent on the specific parallel platform. This paper presents a learning-based approach to parallel workload allocation in a costaware manner. This approach uses static program features to classify programs, before deciding the best workload allocation scheme based on its prior experience with similar programs. Experimental results on 12 Java benchmarks (76 test cases with different workloads in total) show that it can efficiently allocate the parallel workload among Java threads and achieve an efficiency of 86% on average.

• Type: Conference
• Year: 2007
• Where: NPC
• Authors: Shun Long, Grigori Fursin, Björn Franke
• Keywords: Distributed And Parallel Computing, NPC 2007, Parallel Workload, Workload Allocation, Workload Allocation Scheme