Avoiding initialization misses to the heap

Avoiding Connict Misses Dynamically in Large Direct-mapped Caches

This paper describes a method for improving the performance of a large direct-mapped cache by reducing the number of connict misses. Our solution consists of two components: an inexpensive hardware device called a Cache Miss Lookaside (CML) buuer that detects connicts by recording and summarizing a history of cache misses, and a software policy within the operating system's virtual memory syste...

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

We show how to build a binary heap in-place in linear time by performing ∼1.625n element comparisons, at most ∼2.125n element moves, and ∼n/B cache misses, where n is the size of the input array, B the capacity of the cache line, and ∼f(n) approaches f(n) as n grows. The same bound for element comparisons was derived and conjectured to be optimal by Gonnet and Munro; however, their procedure re...

Unwillingly to the Scrap Heap

Learning to Verify the Heap

We present a data-driven verification framework to automatically prove memory safety and functional correctness of heap programs. For this, we introduce a novel statistical machine learning technique that maps observed program states to (possibly disjunctive) separation logic formulas describing the invariant shape of data structures at relevant program locations. We then attempt to verify thes...

The roles of conceptual device models and user goals in avoiding device initialization errors

While mistakes, and approaches to design and training that reduce them, have been studied extensively, relatively little work in HCI studies ‘slip’ errors, which occur when one intends to do a certain action during a skilled task but unintentionally does another. In this article we examine approaches to training that might reduce the occurrence of a slip error referred to as a ‘device initializ...