In the following sections we explain some of the technical details regarding the CUDA implementation of the GLST algorithm. The steps of the algorithm are divided into two groups, geometry-independent and geometry-dependent tasks. Geometry-independent tasks can be done once during the initial setup and will only need to be updated if the box dimension changes. The geometry-dependent tasks need to be performed during each step of a MD simulation. The GLST algorithm requires minimum input of: 1) the number of atoms in the system, 2) a target error threshold value, 3) dimensions of the simulation unit cell, and 4) a pairwise interaction cutoff distance.