scispace - formally typeset
Search or ask a question
Topic

State (computer science)

About: State (computer science) is a research topic. Over the lifetime, 24436 publications have been published within this topic receiving 225733 citations.


Papers
More filters
Patent
23 Aug 2002
TL;DR: In this paper, an active termination circuit is used for terminating the memory device when it is put into an active state and for unterminating it when put into a inactive state.
Abstract: In a memory device which is used with the memory device connected to a data bus, the memory device includes an active termination circuit for terminating the memory device when the active termination circuit is electrically put into an active state and for unterminating the memory device when the active termination circuit is electrically put into an inactive state. The memory device further includes a control circuit for controlling the active termination circuit to electrically put the active termination circuit into the active state or the inactive state.

63 citations

Journal ArticleDOI
TL;DR: It is shown that in three or more dimensions cellular automata, where the state at each site is decided by a majority vote of the sites in its neighborhood, can simulate Boolean circuits of AND and OR gates, and are therefore P-complete.
Abstract: We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to nonzero probability transitions in single spin-flip dynamics of the Ising model at zero temperature. We show that in three or more dimensions these systems can simulate Boolean circuits of AND and OR gates, and are therefore P-complete. That is, predicting their state t time-steps in the future is at least as hard as any other problem that takes polynomial time on a serial computer. Therefore, unless a widely believed conjecture in computer science is false, it is impossible even with parallel computation to predict majority-vote cellular automata, or zero-temperature single spin-flip Ising dynamics, qualitatively faster than by explicit simulation.

63 citations

Patent
11 Dec 1997
TL;DR: In this paper, the authors describe a controller that can generate a request to transition to the first low power state (e.g., Suspend state defined in the Advanced Power Management or APM. Standard) in response to activation of predefined events (i.e., a time-out event or a user-initiated event).
Abstract: A computer system having first and second low power states includes a controller (such as a BIOS routine) that can generate a request to transition to the first low power state (e.g., Suspend state defined in the Advanced Power Management or APM. Standard) in response to activation of predefined events (e.g., a time-out event or a user-initiated event). A program receiving the request can deny the request and instead causes the system to transition to a second low power state (e.g., the APM Standby state).

62 citations

Patent
02 Sep 1997
TL;DR: In this article, a processor is disclosed comprising a front end circuit that fetches a series of instructions according to a program sequence determined by at least one branch prediction, a register renaming circuit that allocates execution resources to each instruction, and an execution circuit that executes each instruction in the instruction stream.
Abstract: A processor is disclosed comprising a front end circuit that fetches a series of instructions according to a program sequence determined by at least one branch prediction, a register renaming circuit that allocates execution resources to each instruction, and an execution circuit that executes each instruction in the instruction stream. The execution circuit causes the front end circuit to refetch the series of instructions if a branch misprediction is detected. A stall signal disables the register renaming circuit until the execution circuit commits the branch result to an architectural state according to the program sequence.

62 citations

Patent
03 Aug 2005
TL;DR: In this article, the authors present a scalable control tree state management/optimization, which compares the control's initial state with its current state and saves its state only if it is different from initial state.
Abstract: The present invention enables the scalable control tree state management/optimization, which compares the control's initial state with its current state and saves its state only if it is different from initial state. In addition, it can also reduce the size of the control tree's state by removing a control's state when it's current state is equal to its default state. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

62 citations


Network Information
Related Topics (5)
Formal specification
18.3K papers, 370.6K citations
76% related
Model checking
16.9K papers, 451.6K citations
74% related
Software development
73.8K papers, 1.4M citations
73% related
Software construction
36.2K papers, 743.8K citations
72% related
Concurrency
13K papers, 347.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
202426
202314,059
202232,515
2021467
2020690