返回
Multithreaded scheduling for program segments based on chemical reaction optimizer
DOI:10.1007/s00500-020-05334-4.png)
摘要
En 中文
Multicore processors that support multithreading techniques have many advantages, including processors' utilization, responsiveness, resource sharing, and economical usage of threads. Thus, to have these advantages, programming languages must support multithreading programming. Unfortunately, this technique is not compatible with old programs since most of the old program codes have been prepared sequentially. Inevitably, this posed a challenge when attempts were made to convert old sequential codes into multithreading codes. Despite the existence of several approaches of multithreading, differences do exist in their overhead, efficiency, and speedup, thereby underpinning the need for further optimization. Thus, a chemical reaction optimizer demonstrates the efficacy of its optimization in several problems. Against this backdrop, this paper presents a chemical reaction optimizer for the multithreading scheduling (CROTS) technique that generates multithreaded code while considering a sequential one. CROTS technique has been evaluated using several performance metrics, such as the number of steps, execution time, speedup, efficiency, cost, and percentage of error. Experimental results show that the maximum speedup achieved by CROTS is 11.98 upon the usage of 32 threads, with an average percentage of error being 14.56% in regard to the comparison between experimental and analytical cost results. Furthermore, after comparing CROTS with intermediate representation based on diKernel (KIR), it has been established that it can accommodate more threads and attain greater speedup. For example, the experiments show that when applying both approaches CROTS and KIR using 32 threads on dataset M7000, CROTS attains a speedup of 11.71, that is, about tripled the speedup achieved by KIR, which is 3.77.
Keyword:
Chemical reaction optimization
Metaheuristic algorithm
Scheduling
Multithreading technique
Program segments
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization一种新的基于协同进化分解的双层组合优化算法
APPLIED INTELLIGENCE
IF3.5
Chemical reaction optimization with unified tabu search for the vehicle routing problem
SOFT COMPUTING
IF2.5
Chemical reaction optimization for solving longest common subsequence problem for multiple string
SOFT COMPUTING
IF2.5

