Transactional flash (TxFlash) is a novel solid-state drive (SSD) that uses flash memory and exports a transactional interface (WriteAtomic) to the higher-level software. The copy-on-write nature of the flash translation layer and the fast random access makes flash memory the right medium to support such an interface. We further develop a novel commit protocol called cyclic commit for TxFlash; t...

Working memory (WM) is a part of human memory, the ability to maintain and manipulate information. WM performance is impaired in some neurological and psychiatric disorders such as schizophrenia and ADHD. Neurofeedback training is a self-regulation method which can be used to improve WM performance by changing related EEG parameters. In this paper we used neurofeedback training to improve WM pe...

This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based on single-and multiple-writer versions of a lazy release consistent (LRC) protocol, and a single-writer sequentially consistent protocol, all implemented in the CVM software distributed shared memory system. We nd that...

| This paper presents the implementation of a Shared Virtual Memory (SVM) over a SCI cluster. We explain concepts of memory consistency and associated coherence protocols and we give a detailed overview the Lazy Release Consistency protocol. Then we describe our user level implementation of this protocol over SCI through a message-passing layer and the SVM itself. Finally, we analyze results of...

Scalable, hierarchical, all-optical, WDM networks for processor interconnection have been recently considered. This paper introduces an access protocol for this type of network which supports a distributed shared memory environment. The objectives of the protocol are reduced average latency per packet, support of broadcast/multicast, collisionless communication, and the exploitation of the inhe...

A protocol is presented which solves the randomized consensus problem9] for shared memory. The protocol uses a total of O(p 2 +n) worst-case expected increment, decrement and read operations on a set of three shared O(log n)-bit counters, where p is the number of active processors and n is the total number of processors. It requires less space than previous polynomial-time consensus protocolss6...

This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based on singleand multiple-writerversions of a lazy release consistent (LRC) protocol, and a single-writer sequentially consistent protocol, all implemented in the CVM software distributed shared memory system. We find that...

This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests, allowing to write the object locally, as well as lookup requests, providing a read-only copy of the object. They have been used in distributed shared memory implementations and in data-flow implementations of distributed softw...

Use of transactional multicore main-memory databases is growing due to dramatic increases in memory size and CPU cores available for a single machine. To leverage these resources, recent concurrency control protocols have been proposed for main-memory databases, but are largely optimized for specific workloads. Due to shifting and unknown access patterns, workloads may change and one specific a...