Improving Multithreaded Performance Algorithmically in VIPLE

Abstract

Flowchart-based programming languages are useful because they are easy to interpret on the user end, and have recently become more popular in implementation in certain fields. In this framework, a program is recognized as a flowchart. In this flowchart, different parts of the program can be executed concurrently or in an optimized order using scheduling algorithms. However, more complex equations, such as large heuristic algorithms for path finding, tend to result in huge slowdowns in execution time due to execution delays in the pipeline. The solution of this paper is to create an algorithm that uses multithreading to maximize the speedup of a given program, while taking into account both theoretical limits as well as implementation limits (due to thread creation and destruction, synchronization, and load balancing). This algorithm also incorporates a new form of branch prediction, which will limit the number of calculations and threads needed in these workflows. Implementation and analysis of the results of this algorithm's use are explored at the end of this paper.