Topic
Encoding (memory)
About: Encoding (memory) is a research topic. Over the lifetime, 7547 publications have been published within this topic receiving 120214 citations. The topic is also known as: memory encoding & encoding of memories.
Papers published on a yearly basis
Papers
More filters
••
12 Jan 2015TL;DR: A new abstraction of the memory model is presented that eliminates expensive shifting of store buffer contents and significantly improves the precision and scalability of program analysis and can automatically verify algorithms with fewer fences, faster and with lower memory consumption.
Abstract: We present a new abstract interpretation based approach for automatically verifying concurrent programs running on relaxed memory models.
Our approach is based on three key insights: i behaviors of relaxed models e.g. TSO and PSO are naturally captured using explicit encodings of store buffers. Directly using such encodings for program analysis is challenging due to shift operations on buffer contents that result in significant loss of analysis precision. We present a new abstraction of the memory model that eliminates expensive shifting of store buffer contents and significantly improves the precision and scalability of program analysis, ii an encoding of store buffer sizes that leverages knowledge of the abstract interpretation domain, further improving analysis precision, and iii a source-to-source transformation that realizes the above two techniques: given a program P and a relaxed memory model M, it produces a new program PM where the behaviors of P running on M are over-approximated by the behavior of PM running on sequential consistency SC. This step makes it possible to directly use state-of-the-art analyzers under SC.
We implemented our approach and evaluated it on a set of finite and infinite-state concurrent algorithms under two memory models: Intel's x86 TSO and PSO. Experimental results indicate that our technique achieves better precision and efficiency than prior work: we can automatically verify algorithms with fewer fences, faster and with lower memory consumption.
36 citations
••
TL;DR: There is no resource competition between working memory and perceptual selection except when the WM task requires encoding spatial properties.
Abstract: It is generally assumed that "perceptual object" is the basic unit for processing visual information and that only a small number of objects can be either perceptually selected or encoded in working memory (WM) at one time. This raises the question whether the same resource is used when objects are selected and tracked as when they are held in WM. In two experiments, we measured dual-task interference between a memory task and a Multiple Object Tracking task. The WM tasks involve explicit, implicit, or no spatial processing. Our results suggest there is no resource competition between working memory and perceptual selection except when the WM task requires encoding spatial properties.
36 citations
••
TL;DR: The results indicate that studies of transcriptional regulation, in conjunction with other experimental approaches, can provide complementary lines of evidence to further understanding of the extent to which multiple memory systems are independent or interactive.
36 citations
••
12 Jul 2004TL;DR: This paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with rate comparable to or even matching the rate achieved by the best constructions with polynomial encoding/decoding complexity.
Abstract: This paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with rate comparable to or even matching the rate achieved by the best constructions with polynomial encoding/decoding complexity. We achieve this for three basic settings of list decoding, and view these as the first promising steps in the above general program.
36 citations
••
TL;DR: Three experiments are reported that examine the relationship between short-term memory for time and order information, and the more specific claim that order memory is driven by a timing signal, and place constraints on models of serial recall that assume a timed signal generates positional representations.
Abstract: Three experiments are reported that examine the relationship between short-term memory for time and order information, and the more specific claim that order memory is driven by a timing signal Participants were presented with digits spaced irregularly in time and postcued (Experiments 1 and 2) or precued (Experiment 3) to recall the order or timing of the digits The primary results of interest were as follows: (a) Instructing participants to group lists had similar effects on serial and timing recall in inducing a pause in recall between suggested groups; (b) the timing of recall was predicted by the timing of the input lists in both serial recall and timing recall; and (c) when the recall task was precued, there was a tendency for temporally isolated items to be more accurately recalled than temporally crowded items The results place constraints on models of serial recall that assume a timing signal generates positional representations and suggest an additional role for information about individual durations in short-term memory
36 citations