computational state
Recently Published Documents


TOTAL DOCUMENTS

9
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2018 ◽  
Vol 6 (2) ◽  
pp. 37-49 ◽  
Author(s):  
Kohei Fujisawa ◽  
Atsushi Nunome ◽  
Kiyoshi Shibayama ◽  
Hiroaki Hirata

To enlarge the opportunities for parallelizing a sequentially coded program, the authors have previously proposed speculative memory (SM). With SM, they can start the parallel execution of a program by assuming that it does not violate the data dependencies in the program. When the SM system detects a violation, it recovers the computational state of the program and restarts the execution. In this article, the authors explore the design space for implementing a software-based SM system. They compared the possible choices in the following three viewpoints: (1) which waiting system of suspending or busy-waiting should be used, (2) when a speculative thread should be committed, and (3) which version of data a speculative thread should read. Consequently, the performance of the busy-waiting system which makes speculative threads commit early and read non-speculative values is better than that of others.


PLoS ONE ◽  
2014 ◽  
Vol 9 (11) ◽  
pp. e109381 ◽  
Author(s):  
Frank Krüger ◽  
Martin Nyolt ◽  
Kristina Yordanova ◽  
Albert Hein ◽  
Thomas Kirste

2014 ◽  
Vol 1030-1032 ◽  
pp. 843-846 ◽  
Author(s):  
He An Wan

On the background of 318 highway bridge of the Yinjiang Jihan Navigation Project, it introduces the methods and contents of the construction control of long-span prestressed concrete continuous girder bridge, it adopts Midas/Civil softwares to have a simulation analysis and effective control for the construction process of whole bridge. The result indicates that safety of the bridge construction, linear and the variation of prestress are all in control. Finally, the condition of structure of bridge suits for computational state theoretically.


Author(s):  
Rati R. Sahoo ◽  
Girija S. Rath

This paper introduces an abstract model of reversible sequential machine in designing the cryptosystem based on the symmetric key approach. A reversible sequential machine is a one-to-one mapping old state and input to new state and output. Reversible computing machine is the mapping of old computational state to new computational state is oneto- one. The abstract model of the reversible sequential machine developed here for a cryptosystem is presented as a 4-tuple M(state, input, output, mapping-function) machine. In this machine, the mapping of present state and input to next state and output by residue number system.


Sign in / Sign up

Export Citation Format

Share Document