In distributed database systems, an atomic commitment protocol ensures that transactions terminate consistently at all participating sites even in the presence of failures. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite failures of others. Protocols that have this property are desirable since they limit t...

Writing data to a page not present in the file-system page cache causes the operating system to synchronously fetch the page into memory first. Synchronous page fetch defines both policy (when) and mechanism (how), and always blocks the writing process. Non-blocking writes eliminate such blocking by buffering the written data elsewhere in memory and unblocking the writing process immediately. S...

Consider the ordinary diierential equation _ xt = F , x t ; x 0 = x 0 : 1 A solution 1 on 0; T , T T 0, to 1 is a continuously diierentiable function x : : 0 ; T !R n satisfying xt = x 0 + Z t 0 F , x s ds: We m a y ask for which functions F there exist a solution to 1 and, if so, if the solution is unique. Is it, for instance, suucient that F is a continuous function? The answer is no concerni...

We extend earlier work on detecting pornographic images. Our focus is on the classification stage and we give new results for a variety of classical and modern classifiers. We find the artificial neural network offers a statistically significant improvement. In all cases the error rate is too high unless deployed sensitively so we show how such a system may be built into a commercial environment.

This paper introduces new lock-free and wait-free unordered linked list algorithms. The composition of these algorithms according to the fast-pathslow-path methodology, a recently devised approach to creating fast wait-free data structures, is nontrivial, suggesting limitations to the applicability of the fast-path-slow-path methodology. The list algorithms introduced in this paper are shown to...

The generation of non-blocking Clos-networks from custom routing chips is studied. In particular we approach the question of how to construct non-blocking networks with P ports using as few routers as possible. Unlike previous attempts we study this problem for fixed size routers, and for any P , not only those values arising from straightforward recursion of the Clos scheme. We describe a prac...

Caching recently referenced IP addresses and their forwarding information is an effective strategy to increase routing lookup speed. This paper proposes a multizone non-blocking pipelined cache for IP routing lookup that achieves lower miss rates compared to previously reported IP caches. The twostage pipeline design provides a half-prefix half-full address cache and reduces the cache power con...

This report contains complementary definitions on sequential proximity [2]. Furthermore, in this report we motivate sequential proximity by using it to prove that two concurrent search data structures are sequentially proximal and show how sequentially proximity can help a developer create a highly-scalable linked list. In Section 2 we present related work. In Section 3 we give precise definiti...