Sciweavers

13 search results - page 2 / 3
» A Cell Assembly Model of Sequential Memory
Sort
View
DFT
2005
IEEE
72views VLSI» more  DFT 2005»
13 years 11 months ago
Soft Error Modeling and Protection for Sequential Elements
Sequential elements, flip-flops, latches, and memory cells, are the most vulnerable components to soft errors. Since state-of-the-art designs contain millions of bistables, it i...
Hossein Asadi, Mehdi Baradaran Tahoori
ECOOP
2010
Springer
13 years 10 months ago
Reasoning about the Implementation of Concurrency Abstractions on x86-TSO
ncy Abstractions on x86-TSO Scott Owens University of Cambridge Abstract. With the rise of multi-core processors, shared-memory concurrency has become a widespread feature of compu...
Scott Owens
CSL
2006
Springer
13 years 9 months ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 5 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
BMCBI
2010
189views more  BMCBI 2010»
13 years 5 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...