Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,776 papers from all fields of science
Search
Sign In
Create Free Account
Lockstep (computing)
Known as:
Lockstep memory
, Double Device Data Correction
, Lockstep (disambiguation)
Expand
Lockstep systems are fault-tolerant computer systems that run the same set of operations at the same time in parallel. The redundancy allows error…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
ARM Cortex-R
Chipkill
Cray-1
DIMM
Expand
Broader (1)
Classes of computers
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Housing and Employment Insecurity among the Working Poor
Matthew Desmond
,
C. Gershenson
2016
Corpus ID: 8693611
While social scientists have documented severe consequences of job loss, scant research investigates why workers lose their jobs…
Expand
Highly Cited
2015
Highly Cited
2015
Oxygen enrichment in carbon-rich planetary nebulae
G. Delgado-Inglada
,
M'onica Rodr'iguez
,
M. Peimbert
,
G. Stasi'nska
,
C. Morisset
2015
Corpus ID: 119108780
We study the relation between the chemical composition and the type of dust present in a group of 20 Galactic planetary nebulae…
Expand
2013
2013
Towards automotive virtualization
M. Strobl
,
M. Kucera
,
Andrei Foeldi
,
T. Waas
,
Norbert Balbierer
,
Carolin Hilbert
International Conference on Applied Electronics
2013
Corpus ID: 42847706
Virtualization has come a long way since its beginnings in the 1960s. Nowadays, Virtual Machine Monitor (VMM) - or hypervisor…
Expand
Review
2013
Review
2013
THE ASSEMBLY OF MILKY-WAY-LIKE GALAXIES SINCE z ∼ 2.5
P. V. van Dokkum
,
J. Leja
,
+16 authors
S. Wuyts
2013
Corpus ID: 119205455
Galaxies with the mass of the Milky Way dominate the stellar mass density of the universe but it is uncertain how and when they…
Expand
Highly Cited
2003
Highly Cited
2003
Leader election algorithms for wireless ad hoc networks
Sudarshan Vasudevan
,
B. DeCleene
,
N. Immerman
,
J. Kurose
,
D. Towsley
Proceedings DARPA Information Survivability…
2003
Corpus ID: 565538
We consider the problem of secure leader election and propose two cheat-proof election algorithms: Secure Extrema Finding…
Expand
Highly Cited
2002
Highly Cited
2002
Design Research for Sustained Innovation
C. Bereiter
2002
Corpus ID: 8661585
Although there is innovation in education it tends to be sporadic and discontinuous, with the result that innovative practices…
Expand
Highly Cited
2001
Highly Cited
2001
Cheat-proof playout for centralized and distributed online games
N. Baughman
,
B. Levine
Proceedings IEEE INFOCOM . Conference on Computer…
2001
Corpus ID: 1985413
We explore exploits possible for cheating in real-time, multiplayer games for both client-server and distributed, serverless…
Expand
Highly Cited
2000
Highly Cited
2000
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
Kavita Ravi
,
Roderick Bloem
,
F. Somenzi
Formal Methods in Computer-Aided Design
2000
Corpus ID: 16651546
Detection of fair cycles is an important task of many model checking algorithms. When the transition system is represented…
Expand
1999
1999
Do Cities and Suburbs Cluster?
W. Goetzmann
,
M. Spiegel
,
Susan M. Wachter
1999
Corpus ID: 2322909
This article addresses the issue of how closely the fortunes of suburbs are tied to the fortunes of the central city. We develop…
Expand
Highly Cited
1994
Highly Cited
1994
State-Space Abstraction for Anytime Evaluation of Probabilistic Networks
Michael P. Wellman
,
Chao-Lin Liu
Conference on Uncertainty in Artificial…
1994
Corpus ID: 8561458
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE