To improve Last-Level Cache (LLC) management, numerous approaches have been proposed requiring additional hardware budget and increased overhead. A number of these approaches even change the organization of the existing cache design. In this letter, we propose Adaptive Insertion and Promotion (AIP) policies based on Least Recently Used (LRU) replacement. AIP dynamically inserts a missed line in the middle of the cache list and promotes a reused line several steps left, realizing the combination of LRU and LFU policies deliberately under a single unified scheme. As a result, it benefits workloads with high locality as well as with many frequently reused lines. Most importantly, AIP requires no additional hardware other than a typical LRU list, thus it can be easily integrated into the existing hardware with minimal changes. Other issues around LLC such as scans, thrashing and dead lines are all explored in our study. Experimental results on the gem5 simulator with SPEC CUP2006 benchmarks indicate that AIP outperforms LRU replacement policy by an average of 5.8% on the misses per thousand instructions metric.

Hovering unmanned aerial vehicles (UAVs) with mutual sense and communication capability form a new-fashioned airborne ad hoc network. Traditional routing protocols assume that there has already existed an end-to-end path before the message forwarding starts which, however, is not always available in the airborne network featuring randomly violent topological changes. Local heuristic information without complex computational cost should be considered to help route in this specific delay tolerant network (DTN). In this letter, we take Crowd Density (CD) and Relative Velocity Direction (RVD) as the fuzzy inputs, and use approximate reasoning to calculate priority of alternative candidates. Finally, the proposed mechanism is compared with some existing protocols.