For many years, the accepted wisdom has been that the key to adoption of best-effort hardware transactions is to guarantee progress by combining them with an all software slow-path, to be taken if the hardware transactions fail repeatedly. However, all known generally applicable hybrid transactional memory solutions suffer from a major drawback: the coordination with the software slow-path intr...

Multicore computers pose a substantial challenge to infrastructure software such as operating systems or databases. Such software typically evolves slower than the underlying hardware, and with multicore it faces structural limitations that can be solved only with radical architectural changes. In this paper we argue that, as has been suggested for operating systems, databases could treat multi...

However, the use of the term parahemorheology has been criticized, because the prefix para implies that the rheology of fluids and structures in the perivascular spaces is secondary and less important than that of the vessel-blood organ. It is also imprecise, once it does not refer to the fluids and structures being considered. By contrast, the term perihemorheology implies the rheology of flui...

I’ve spent over 20 years implementing algorithms for Boolean minimization, with particular application to area optimization of large semiconductor circuits. This exploration has included almost all published algorithms, dozens of conventional and exotic data structures, over two dozen programming languages and styles, and almost every level of implementation, from reconfigurable silicon through...

Transactional memory has been proposed as a general and flexible way to allow programs to read and modify disparate primary-memory locations atomically as a single operation, much as a database transaction can atomically modify many records on disk. Hardware transactional memory supports atomicity through architectural means, whereas software transactional memory supports atomicity through lang...