Stealing Some Notation from Big O Notation to Develop a New Multithreading Priority Formula

Abstract

This work aims to develop the CPU industry by distributing its time between the threads efficiently. To do so, an unprecedentedly developed equation is suggested as a new powerful software to increase the CPU performance. This proposed equation dedicates to solve the problem of children inheriting their parents priorities equivalently without a thoughtful basis in multithreading by involving big O to give threads different values, whose importance is inversely proportional to their O(n)s. The second originality is breaking complexity rule, which considers loop iterations if the threads have the same O(n), since usually threads run on the same computer. Therefore, the ratio (No. of loop’s iterations to go/total iterations multiplied by O(n)) determines thread importance inversely. The third novelty is replacing Round Robin with Big O and iteration ratio. A parser is applied to seek “for” and “while” tokens for O(n) measuring purposes. Three threads, p1 O(n²), p2 O(n), and p3 O(n²), approved the equation with results of 32, 51, and 8 time slices, respectively, during the period 0-1000 ms. Meanwhile, Round Robin gives the children the same slice number.