Journal articles: 'Fault-tolerant computing'

1

Osborne, I. S. "Fault-tolerant quantum computing." Science 345, no. 6194 (July 17, 2014): 280. http://dx.doi.org/10.1126/science.345.6194.280-n.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Pant, Durgesh, and K. C. Joshi. "Software fault tolerant computing." Ubiquity 2007, April (April 2007): 1. http://dx.doi.org/10.1145/1241854.1247275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Saha, Goutam Kumar. "Fault Tolerant Computing Issues." International Journal of Applied Research on Information Technology and Computing 6, no. 3 (2015): 197. http://dx.doi.org/10.5958/0975-8089.2015.00025.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Saha, Goutam Kumar. "Software-Based Fault Tolerant Computing." Ubiquity 2005, November (November 2005): 1. http://dx.doi.org/10.1145/1103039.1103070.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Osborne, Ian S. "Coding fault-tolerant quantum computing." Science 364, no. 6447 (June 27, 2019): 1248.7–1249. http://dx.doi.org/10.1126/science.364.6447.1248-g.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Akers and Pradhan. "Fault-Tolerant Computing: An Introduction." IEEE Transactions on Computers C-35, no. 4 (April 1986): 285–87. http://dx.doi.org/10.1109/tc.1986.1676759.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chetan, S., A. Ranganathan, and R. Campbell. "Towards fault tolerant pervasive computing." IEEE Technology and Society Magazine 24, no. 1 (2005): 38–44. http://dx.doi.org/10.1109/mtas.2005.1407746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Steane, Andrew M. "Efficient fault-tolerant quantum computing." Nature 399, no. 6732 (May 1999): 124–26. http://dx.doi.org/10.1038/20127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Nelson, V. P. "Fault-tolerant computing: fundamental concepts." Computer 23, no. 7 (July 1990): 19–25. http://dx.doi.org/10.1109/2.56849.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Motus, L. "The evolution of fault-tolerant computing series: Dependable computing and fault-tolerant systems (vol. 1)." Engineering Applications of Artificial Intelligence 1, no. 2 (June 1988): 145–46. http://dx.doi.org/10.1016/0952-1976(88)90041-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Saha, Goutam Kumar. "Replicated instruction based fault tolerant computing." Ubiquity 2007, June (June 2007): 1. http://dx.doi.org/10.1145/1276162.1276165.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Bukowski, Julia V. "Fault-Tolerant Computing Guest Editor's Preface." IEEE Transactions on Reliability R-36, no. 2 (June 1987): 162–63. http://dx.doi.org/10.1109/tr.1987.5222332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Duggan, Dominic. "Abstractions for Fault-Tolerant Global Computing." Electronic Notes in Theoretical Computer Science 66, no. 3 (September 2002): 116–44. http://dx.doi.org/10.1016/s1571-0661(04)80419-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chothia, Tom, and Dominic Duggan. "Abstractions for fault-tolerant global computing." Theoretical Computer Science 322, no. 3 (September 2004): 567–613. http://dx.doi.org/10.1016/j.tcs.2003.09.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Min, Yinghua. "Guest editor’s introduction: Fault—Tolerant Computing." Journal of Computer Science and Technology 5, no. 2 (April 1990): 97–98. http://dx.doi.org/10.1007/bf02943415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Babaoğlu, Özalp. "Fault-tolerant computing based on Mach." ACM SIGOPS Operating Systems Review 24, no. 1 (January 3, 1990): 27–39. http://dx.doi.org/10.1145/90994.91005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Saha, Goutam Kumar. "RSVP – Software Implemented Fault Tolerant Computing." International Journal of Applied Research on Information Technology and Computing 7, no. 3 (2016): 222. http://dx.doi.org/10.5958/0975-8089.2016.00024.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Tokunaga, Yuuki. "Toward Early Fault-tolerant Quantum Computing." NTT Technical Review 21, no. 11 (November 2023): 43–48. http://dx.doi.org/10.53829/ntr202311fa5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Ahmad, Uzma, Sara Ahmed, Muhammad Javaid, and Md Nur Alam. "Computing Fault-Tolerant Metric Dimension of Connected Graphs." Journal of Mathematics 2022 (May 28, 2022): 1–6. http://dx.doi.org/10.1155/2022/9773089.

Full text

Abstract:

For a connected graph, the concept of metric dimension contributes an important role in computer networking and in the formation of chemical structures. Among the various types of the metric dimensions, the fault-tolerant metric dimension has attained much more attention by the researchers in the last decade. In this study, the mixed fault-tolerant dimension of rooted product of a graph with path graph with reference to a pendant vertex of path graph is determined. In general, the necessary and sufficient conditions for graphs of order at least 3 having mixed fault-tolerant generators are established. Moreover, the mixed fault-tolerant metric generator is determined for graphs having shortest cycle length at least 4.

APA, Harvard, Vancouver, ISO, and other styles

20

Sun, Yu, and Jun Liu. "Static Fault-Tolerant Strategy for High Performance Computing Platform." Advanced Materials Research 989-994 (July 2014): 1810–13. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1810.

Full text

Abstract:

It is an important research issue to ensure the computation correctness for parallel application and enhance the using rate of dynamic computing resource in distributed computing system. Based on the previous high performance distributing computing system, a fault-tolerant and task scheduler was developed, which combined the breathe mechanism, fault-discover mechanism and subtask reschedule mechanism. Experiments show that the fault-tolerant and task-scheduler has good performance and ensures the computation correctness even if when some computing resources fail.

APA, Harvard, Vancouver, ISO, and other styles

21

Barabanova, E. A., K. A. Vytovtov, V. M. Vishnevsky, and V. S. Podlazov. "The method for constructing fault-tolerant photonic switches for high-performance computing systems." Journal of Physics: Conference Series 2091, no. 1 (November 1, 2021): 012032. http://dx.doi.org/10.1088/1742-6596/2091/1/012032.

Full text

Abstract:

Abstract In this paper the new type of fault-tolerant non-blocking photonic switch is presented for the first time. The proposed switch architecture is based on quasi-complete graph topology which use provides non-blocking and fault-tolerant switching process. The new two-stage switch architecture uses the stage of dual photonic switches and pairs of photonic demultiplexers and multiplexers which have been described in detail by authors in their previous works. Depending on the number of different backup connections, the two types of fault-tolerant pho-tonic switches are considered in this paper: single-channel fault-tolerant photonic switch and dual-channel fault-tolerant photonic switch. The mathematical expressions for calculating the switching and fiber complexities of these two types of fault-tolerant photonic switches are also presented here for the first time. The numerical calculations shown that the increasing the reliability of the fault-tolerant photonic switches twice leads to an increasing their switching complexity in 1.4 times and fiber complexity in 1.8 times.

APA, Harvard, Vancouver, ISO, and other styles

22

Bhattacharjee, Pramode Ranjan. "A Novel Scheme for Fault Tolerant Computing." Journal of the Institute of Electronics and Computer 3, no. 1 (2021): 17–23. http://dx.doi.org/10.33969/jiec.2021.31002.

Full text

Abstract:

A novel scheme for ensuring reliability in the operation of a combinational digital network has been offered in this paper. This has been achieved by making use of three copies of the same digital network along with two additional sub-networks, one of which consists of three additional control inputs, which can also be used as additional observable outputs. If both the said two sub-networks are fault free, then the primary output of the network in the present scheme will always give fault-free responses even if a fault (single or multiple) occurs in one of the three copies of the digital network under consideration. Unlike the Triple Modular Redundancy (TMR) scheme, the present scheme does not require any majority voter circuit. Furthermore, unlike the TMR scheme, the additional sub-networks in the present scheme can be tested off-line by predefined test input patterns.

APA, Harvard, Vancouver, ISO, and other styles

23

Maxion, R. A., D. P. Siewiorek, and S. A. Elkind. "Techniques and Architectures for Fault-Tolerant Computing." Annual Review of Computer Science 2, no. 1 (June 1987): 469–520. http://dx.doi.org/10.1146/annurev.cs.02.060187.002345.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Saha, Goutam Kumar. "A software fix towards fault-tolerant computing." Ubiquity 2005, May (May 2005): 2. http://dx.doi.org/10.1145/1071928.1066336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Charron-Bost, Bernadette, and André Schiper. "Harmful dogmas in fault tolerant distributed computing." ACM SIGACT News 38, no. 1 (March 2007): 53–61. http://dx.doi.org/10.1145/1233481.1233496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Degro, Atis, and Rainald Löhner. "Simple Fault-tolerant Computing for Field Solvers." International Journal of Computational Fluid Dynamics 34, no. 7-8 (June 9, 2020): 583–96. http://dx.doi.org/10.1080/10618562.2020.1773448.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bruno, John, and E. G. Coffman Jr. "Optimal fault-tolerant computing on multiprocessor systems." Acta Informatica 34, no. 12 (November 1, 1997): 881–904. http://dx.doi.org/10.1007/s002360050110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Guerraoui, Rachid, and Eric Ruppert. "Anonymous and fault-tolerant shared-memory computing." Distributed Computing 20, no. 3 (September 4, 2007): 165–77. http://dx.doi.org/10.1007/s00446-007-0042-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Barborak, Michael, Anton Dahbura, and Miroslaw Malek. "The consensus problem in fault-tolerant computing." ACM Computing Surveys 25, no. 2 (June 1993): 171–220. http://dx.doi.org/10.1145/152610.152612.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Morganti, M. "Communications in distributed fault-tolerant computing systems." Journal of Systems and Software 6, no. 1-2 (May 1986): 213–16. http://dx.doi.org/10.1016/0164-1212(86)90042-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

GORAYA, MAJOR SINGH, and LAKHWINDER KAUR. "FAULT TOLERANCE TASK EXECUTION THROUGH COOPERATIVE COMPUTING IN GRID." Parallel Processing Letters 23, no. 01 (March 2013): 1350003. http://dx.doi.org/10.1142/s0129626413500035.

Full text

Abstract:

To achieve fault tolerant task execution in grid, cooperative computing system (CCS) is proposed in this paper. Grid resources with similar statistical characteristics constitute the computing nodes in CCS. CCS executes the allocated task, considered as its primary task, by organizing the computing nodes as active and active-standby. At a moment of time, one of the node acts as active node to execute the task whereas rest of the nodes act as active-standby to provide execution backup to the task. Computing nodes in CCS may fail during task execution due to the failure/exit of their corresponding resources. To maintain the fault tolerant ability of CCS, a failed node is repaired dynamically by replacing its corresponding resource with alternative matching resource from grid. The number of computing nodes in CCS is decided by optimizing the service reliability with respect to the execution overhead of the primary task. Resource usage is optimized in CCS by overloading the primary task at each active-standby node with a low priority secondary task. Active-standby nodes execute their low priority secondary tasks concurrently to providing execution backup to the primary task. Service reliability, system throughput and task delay is observed in the simulation experiments to explore the fault tolerant ability of CCS. A task set of 500 grid tasks is repeatedly executed by varying task duration and rate of resource failure. Simulation results show that CCS outperforms the existing fault tolerant approaches being used in grid. In CCS, fault tolerant task execution is achieved without compromising on account of resource utilization as well.

APA, Harvard, Vancouver, ISO, and other styles

32

Sun, Dongxu, Wei Niu, and Zhiqiang Zhu. "Modeling and Simulation of Imperfect Fault Coverage of Airborne Computing Platform." Journal of Physics: Conference Series 2456, no. 1 (March 1, 2023): 012016. http://dx.doi.org/10.1088/1742-6596/2456/1/012016.

Full text

Abstract:

Abstract Ignoring the problem of imperfect fault coverage of fault-tolerant systems will lead to reliability evaluation errors. In order to accurately assess the reliability of the fault-tolerant design of airborne computing platform, the fault-coverage process and failure factors were analyzed, and a discrete event simulation model for the problem of imperfect fault coverage is constructed. In the discrete event simulation model, the fault, detection, isolation and recovery behaviours event are generated by random sampling according to specific distribution, and each discrete event is used to drive the system behaviours and result analysis sequentially along the time axis. Based on the simulation model, reliability analysis of a typical airborne computing platform is completed; the simulation results show that the problem of imperfect fault coverage has a significant impact on the reliability of the computing platform, and the simulation model in this paper is more comprehensive and accurate than the traditional ideal model.

APA, Harvard, Vancouver, ISO, and other styles

33

David, Beaulah, and Dr R. Santhosh. "Fault Tolerance and QoS based Pervasive Computing using Markov State Transition Model." International Journal of Engineering & Technology 7, no. 4 (September 17, 2018): 2403. http://dx.doi.org/10.14419/ijet.v7i4.12664.

Full text

Abstract:

Fault-tolerance is significant in pervasive computing environments. Recently, few research works has been developed for reducing the fault, occurring in pervasive computing. However, there is a need for a fault tolerance mechanism to reduce the link failures and unwanted mobile node access (in pervasive computing environment). In order to overcome these limitations, Markov State Transition Based Fault Tolerance (MST-FT) Model is proposed. The main objective of MST-FT Model is to achieve resource efficient QoS in pervasive computing environment by avoiding the link failures and unwanted mobile node usages. Initially, the optimization of link failures is achieved by maintaining Markov chain of high energy mobile nodes on the wireless network communication path. The mobile nodes with higher energy and minimal drain rate are combined to form a chain in its corresponding path of communication in order to minimize the link failures in pervasive computing. Next, the inappropriate mobile node usage is avoided by selecting only the authorized mobile nodes for Markov chain construction to effective network communication, which resulting in improved fault tolerant rate. Therefore, MST-FT Model provides higher resource efficient QoS as compared to existing works. The performance of MST-FT Model is measured in terms of fault tolerant rate, execution time, energy consumption rate and quality of service level. The simulation results show that the MST-FT Model is able to improve the fault tolerant rate by 13% and also reduces the energy consumption rate of resource efficient QoS by 25%, when compared to previous works.

APA, Harvard, Vancouver, ISO, and other styles

34

Krasnobayev, Victor, Alexandr Kuznetsov, and Anastasiia Kiian. "Designing of fault-tolerant computer system structures using residue number systems." Open Computer Science 12, no. 1 (January 1, 2022): 66–74. http://dx.doi.org/10.1515/comp-2020-0171.

Full text

Abstract:

Abstract This article discusses computing systems that operate in residue number systems (RNSs). The main direction of improving computer systems (CSs) is increasing the speed of implementation of arithmetic operations and the reliability of their functioning. Encoding data in RNS solves the problem of optimal redundancy, i.e., the creation of such computing systems provides maximum reliability with restrictions on weight and size characteristics. This article proposes new structures of fault-tolerant CSs operating in RNS in the case of the application with an active fault-tolerant method. The use of the active fault-tolerant method (dynamic redundancy) in the RNSs provides higher reliability. In addition, with an increase in the digits of CSs, the efficiency of using the proposed structures increases.

APA, Harvard, Vancouver, ISO, and other styles

35

Singh Kushwah, Virendra, Sandip K. Goyal, and Avinash Sharma. "Measuring Throughput for Fault Tolerant Based ACO Algorithm under Cloud Computing: A Comparison Study." International Journal of Engineering & Technology 7, no. 4.12 (October 4, 2018): 39. http://dx.doi.org/10.14419/ijet.v7i4.12.20989.

Full text

Abstract:

Any technical problem can be main cause for any fault. Due to any fault, system would be suffered the work and enhance the system cost in term of money and others. There are many algorithms for fault tolerant in cloud computing and make comparison with fault tolerant based ant colony optimization and which is used to minimize fault during load balancing. In this paper, throughput is measured by such kind of fault tolerant based algorithms and determines that which algorithm is better. It has been compared with ACO. After such comparison, it is clearly determined that ACO has good functionalities to have better throughput. Comparative study is shown by the graphically and finally described that ACO is better than others in context of throughput calculation are. ACO is itself a meta-heuristic algorithm and better optimization technique.

APA, Harvard, Vancouver, ISO, and other styles

36

El-Sayed, Gamal, and Aref Abdullah. "Fault-tolerant scalable hierarchical scheduling in grid computing." International Conference on Electrical Engineering 8, no. 8 (May 1, 2012): 1–27. http://dx.doi.org/10.21608/iceeng.2012.32716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Prashar, Tanya, Nancy Nancy, and Dinesh Kumar. "Fault Tolerant ACO using Checkpoint in Grid Computing." International Journal of Computer Applications 98, no. 10 (July 18, 2014): 44–49. http://dx.doi.org/10.5120/17223-7465.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Rebbah, Mohammed, Yahya Slimani, Abdelkader Benyettou, and Lionel Brunie. "Reliable fault tolerant model for grid computing environments." Multiagent and Grid Systems 10, no. 4 (January 27, 2015): 213–32. http://dx.doi.org/10.3233/mgs-140224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Plestrak, Stanislaw J. "Report on the 20th Fault-Tolerant Computing Symposium." ACM SIGDA Newsletter 21, no. 1 (June 1991): 95. http://dx.doi.org/10.1145/126990.127011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Mani, Deepa, and Anand Mahendran. "Availability Modelling of Fault Tolerant Cloud Computing System." International Journal of Intelligent Engineering and Systems 10, no. 1 (February 28, 2017): 154–65. http://dx.doi.org/10.22266/ijies2017.0228.17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Patnaik, Lalit M., and Kailasam Viswanathan Iyer. "Load-leveling in fault-tolerant distributed computing systems." IEEE Transactions on Software Engineering SE-12, no. 4 (April 1986): 554–60. http://dx.doi.org/10.1109/tse.1986.6312903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Benhelm, Jan, Gerhard Kirchmair, Christian F. Roos, and Rainer Blatt. "Towards fault-tolerant quantum computing with trapped ions." Nature Physics 4, no. 6 (April 27, 2008): 463–66. http://dx.doi.org/10.1038/nphys961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Yellampalle, Balakishore. "Redundant interconnections for fault-tolerant digital optical computing." Optical Engineering 38, no. 3 (March 1, 1999): 494. http://dx.doi.org/10.1117/1.602096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Sivilotti, Paolo A. G., and Murat Demirbas. "Introducing middle school girls to fault tolerant computing." ACM SIGCSE Bulletin 35, no. 1 (January 11, 2003): 327–31. http://dx.doi.org/10.1145/792548.611999.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Enokido, Tomoya, Makoto Takizawa, Shigenari Nakamura, Dilawaer Duolikun, and Ryuji Oma. "A fault-tolerant tree-based fog computing model." International Journal of Web and Grid Services 15, no. 3 (2019): 219. http://dx.doi.org/10.1504/ijwgs.2019.10022420.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Daniels, Dean, Roger Haskin, Jon Reinke, and Wayne Sawdon. "Shared logging services for fault-tolerant distributed computing." ACM SIGOPS Operating Systems Review 25, no. 1 (January 2, 1991): 65–68. http://dx.doi.org/10.1145/122140.122147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Fu, X., L. Lao, K. Bertels, and C. G. Almudever. "A control microarchitecture for fault-tolerant quantum computing." Microprocessors and Microsystems 70 (October 2019): 21–30. http://dx.doi.org/10.1016/j.micpro.2019.06.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jarwala, Najmi. "The seveteenth international symposium on fault tolerant computing." ACM SIGDA Newsletter 17, no. 3 (September 1987): 48. http://dx.doi.org/10.1145/378916.378949.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Mei, Jing, Kenli Li, Xu Zhou, and Keqin Li. "Fault-Tolerant Dynamic Rescheduling for Heterogeneous Computing Systems." Journal of Grid Computing 13, no. 4 (April 14, 2015): 507–25. http://dx.doi.org/10.1007/s10723-015-9331-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Klonowska, Kamilla, H�kan Lennerstad, Lars Lundberg, and Charlie Svahnberg. "Optimal recovery schemes in fault tolerant distributed computing." Acta Informatica 41, no. 6 (May 2005): 341–65. http://dx.doi.org/10.1007/s00236-005-0161-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Fault-tolerant computing'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles