A data structure within a block of allocable memory of a memory structure such as a heap is used to identify the function that is responsible for causing memory problems such as random overwrites, buffer overruns, double or multiple \u201cfrees,\u201d and the like. The tree is of large size and is vigorous. By utilizing a moving weighted average function to dynamically distribute the data packets in a balanced fashion, data packets are distributed more efficiently thereby increasing the overall efficiency of network operations. The entire process may be automated by including a screw hopper to temporarily store a plurality of screws, a bowl feeder receiving the screws and delivering the screws to a rotating disk, wherein the rotating disk passes the screws through a heating element and presents the heated screws to the powder application booth.