Redundancy + Reconfigurability = Recoverability

Abstract

An approach to consider computers and connected computer systems using structural, time, and information redundancies is proposed. An application of redundancy for reconfigurability and recoverability of computers and connected computer systems is discussed, gaining performance, reliability, and power-saving in operation. A paradigm of recoverability is introduced and, if followed, shifts connected computer systems toward real-time applications. Use of redundancy for connected computers is analysed in terms of recoverability, where two supportive algorithms of forward and backward tracing are proposed and explained. As an example, growth of mission reliability is formulated.

Micro‐LED pumped polymer laser: A discussion of future pump sources for organic lasers

“…Intersystem crossing rates have only been measured for a selected number of materials (e.g. R6G [17] and PFO [20]) and based on these it seems reasonable to assume τ ST ≈ 10 · τ S . Important parameters for the optical gain are the absorption cross sections of the groundand triplet-states at the laser line, σ 0 and σ T , (it is assumed that singlet state absorption is negligible compared to these two) and the cross section for stimulated emission, σ L .…”

Resilient computer system design

“…Our previous attempts to revise existing designs and find balanced developments of ICT hardware and software were presented in Schagaev et al (2013), Kaegi and Schagaev (2013), Plyaskota and Schagaev (1995), and Monkman and Schagaev (2013). This work summarizes our earlier concepts and developments.…”

“…None of these dependencies are studied together except in Monkman and Schagaev (2013). Nobody even set a goal to make a system that will be efficient and flexible along the lines previously mentioned.…”

Static Three-Dimensional Fuzzy Routing Based on the Receiving Probability in Wireless Sensor Networks

“…The work flow of SFRRP is shown in Figure 9. Note that the reconfiguring operation, applying a signal carrier, the realtime state of the network, and determination of the active or passive modes are considered based on the method presented in [41].…”

“…In this section, we simulate the Flooding and SFRRP routing protocols in MATLAB 7.10, to compare these protocols from the following points of view: data delivery ratio, data delivery delay, network life, total energy consumption of the nodes, number of live nodes, and percentage of filled node buffer. As there are variant factors [41] to evaluate the functionality of the connected wireless systems, we only used the above mentioned points to represent the performance of the SFRRP protocol compared to Flooding routing. Furthermore, we analyze the impacts of the experimental parameters on the mentioned protocols.…”