We consider self-organizing data structures in the case where the sequence of accesses can be modeled by a first order Markov chain. For the simple-kand batched-k–move-to-front schemes, explicit formulae for the expected search costs are derived and compared. We use a new approach that employs the technique of expanding a Markov chain. This approach generalizes the results of Gonnet/Munro/Suwan...

Concurrent programs executing on NUMA architectures consist of concurrent entities (e.g. threads, actors) and data placed on different nodes. Execution of these concurrent entities often reads or updates states from remote nodes. The performance of such systems depends on the extent to which the concurrent entities can be executing in parallel, and on the amount of the remote reads and writes. ...

I/O performance remains a weakness of parallel computing systems today. While this weakness is partly attributed to rapid advances in other system components, I/O interfaces available to programmers and the I/O methods supported by file systems have traditionally not matched efficiently with the types of I/O operations that scientific applications perform, particularly noncontiguous accesses. T...

This paper introduces a new manufacturing process for vertical interconnect accesses (VIA). In contrast to industrially established VIA metallization technologies, the presented approach takes place without any chemical plating by combining copper ink and epoxy insulator coating with CO2 laser processing drilling sintering. The minimum resistances are less than 50 mΩ, fitting theoretically calc...

Deformable convolution networks (DCNs) proposed to address the image recognition with geometric or photometric variations typically involve deformable that convolves on arbitrary locations of input features. The change different inputs and induce considerable dynamic irregular memory accesses which cannot be handled by classic neural network accelerators (NNAs). Moreover, bilinear interpolation...