Computational Analysis of Greedy and Hash-Based Order Matching Algorithms for High-Frequency Trading

Fast and reliable trading is crucial in the world of High Frequency Trading (HFT) where automated systems make multiple trades in mere milliseconds. Order-matching techniques may perform differently when applied to different sets of data and different algorithms that process the data. In this study a Data Science based HFT Order Matching Engine is developed in MATLAB which is able to numerically process and compare two approaches (Greedy and Hash Based) for order matching on the same trading dataset. Based on price and quantity of buy and sell order, 3,000 order records were selected and preprocessed. Both algorithms were tried with the same matching conditions: an order is compatible if its buy price is no less than the price of the sell order, and the quantity of the matched order is the smallest available for the buy order and/or the sell order. Performance metrics of the algorithms included execution time, memory consumption, throughput, average matching time, number of matches and efficiency . A mathematical modelling based performance dashboard has also been created for the presentation of the experimental results in graphical and tabular form. Both algorithms generated 1420 matches and an equal number of matchable items 5207.978 and efficiency 49.26%. The Greedy algorithm took 0.256752 seconds to run, performing 11684.2 orders per second and an average matching time of 0.00018081 seconds per match. The Hash Based algorithm took 2.751413 seconds, 1090.32 orders/s, and had an average matching time of 0.00193761 seconds. Based on these results, in the experimental environment and the tested data set, the Greedy approach took less execution time, memory, and average matching time, and had greater throughput. The study emphasizes the key role of computational performance analysis for assessing order matching methods for HFT applications.