Number and Classes of Rotations on Juggling Sequence Rotation
Joseph Agaroghenefuoma Erho, Bunakiye Richard Japheth, Juliana Iworikumo Consul, Prince O. Asagba · 2023
Juggling rotation of sequence or array requires very few element assignments. Yet, its performance is very poor on the average, especially as the sequence or array size increases. It is desirous that such optimal algorithm should perform better in execution. Hence, the intent of this research is to study the properties of the algorithm by defining crucial concepts and formulating equations that represent facts about the algorithm. The resulting definitions and formulations promise to foster the creation of an improved algorithmic performance, either by designing cache memory with locality reference that accommodates the behavioral pattern of the algorithm or modifying the algorithm to perform better. In the discussion, increased significance of the study was demonstrated using possible model of cache-sensitive juggling rotation pattern. Such outcome could be very useful for many systems especially embedded/real-time systems, which are usually constrained by execution time deadlines and limited memory availability.