Dissertations / Theses on the topic 'Fault-tolerant computing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Fault-tolerant computing.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
潘忠強 and Chung-keung Poon. "Fault tolerant computing on hypercubes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1991. http://hub.hku.hk/bib/B31209944.
Full textNickerson, Naomi. "Practical fault-tolerant quantum computing." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/31475.
Full textKurt, Mehmet Can. "Fault-tolerant Programming Models and Computing Frameworks." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1437390499.
Full textSu, Xueyuan. "Efficient Fault-Tolerant Infrastructure for Cloud Computing." Thesis, Yale University, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3578459.
Full textCloud computing is playing a vital role for processing big data. The infrastructure is built on top of large-scale clusters of commodity machines. It is very challenging to properly manage the hardware resources in order to utilize them effectively and to cope with the inevitable failures that will arise with such a large collection of hardware. In this thesis, task assignment and checkpoint placement for cloud computing infrastructure are studied.
As data locality is critical in determining the cost of running a task on a specific machine, how tasks are assigned to machines has a big impact on job completion time. An idealized abstract model is presented for a popular cloud computing platform called Hadoop. Although Hadoop task assignment (HTA) is [special characters omitted]-hard, an algorithm is presented with only an additive approximation gap. Connection is established between the HTA problem and the minimum makespan scheduling problem under the restricted assignment model. A new competitive ratio bound for the online GREEDY algorithm is obtained.
Checkpoints allow recovery of long-running jobs from failures. Checkpoints themselves might fail. The effect of checkpoint failures on job completion time is investigated. The sum of task success probability and checkpoint reliability greatly affects job completion time. When possible checkpoint placements are constrained, retaining only the most recent Ω(log n) possible checkpoints has at most a constant factor penalty. When task failures follow the Poisson distribution, two symmetries for non-equidistant placements are proved and a first order approximation to optimum placement interval is generalized.
Deconda, Keerthi. "Fault tolerant pulse synchronization." Thesis, [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2331.
Full textGarnsworthy, Johnathan Randall. "Fundamental concepts for fault tolerant systems." Thesis, University of Newcastle Upon Tyne, 1990. http://hdl.handle.net/10443/2055.
Full textLeal, William. "A foundation for fault tolerant components /." The Ohio State University, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486402957194912.
Full textPrakash, Ravi. "Fault tolerant resource management in mobile computing systems /." The Ohio State University, 1996. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487940308431572.
Full textStainer, Julien. "Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing." Thesis, Rennes 1, 2015. http://www.theses.fr/2015REN1S054/document.
Full textThis thesis studies computability in systems composed of multiple computers exchanging messages or sharing memory. The considered models take into account the possible failure of some of these computers, as well as variations in time and heterogeneity of their execution speeds. The presented results essentially consider agreement problems, systems prone to partitioning and failure detectors. The document establishes relations between known iterated models and the concept of failure detector and presents a hierarchy of agreement problems spanning from k-set agreement to s-simultaneous consensus. It also introduces a new universal construction based on s-simultaneous consensus objects and a family of iterated models allowing several processes to run in isolation
Mohammadi, Shahram. "Distributed recovery in fault-tolerant interconnected networks." Thesis, University of Manchester, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304628.
Full text周繼鵬 and Jipeng Zhou. "Fault-tolerant wormhole routing for mesh computers." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31242789.
Full textZhou, Jipeng. "Fault-tolerant wormhole routing for mesh computers." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk:8888/cgi-bin/hkuto%5Ftoc%5Fpdf?B23000909.
Full textPierce, Evelyn Tumlin. "Self-adjusting quorum systems for Byzantine fault tolerance /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004357.
Full textO'Gorman, Joe. "Architectures for fault-tolerant quantum computation." Thesis, University of Oxford, 2017. http://ora.ox.ac.uk/objects/uuid:4219548d-798b-45f8-b376-91025bbe3ec4.
Full textAdam, Johan D. "Failure diagnostic expert systems : a case study in fault diagnosis /." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-01202010-020148/.
Full textBakken, David Edward. "Supporting fault-tolerant parallel programming in Linda." Diss., The University of Arizona, 1994. http://hdl.handle.net/10150/186872.
Full textGallagher, William Lynn. "Fault tolerant multipliers and dividers using time shared triple modular redundancy /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Full textVokkaarne, Vijay. "A Fault Tolerant Mobile IP based on Ring Protocol." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1001192.
Full textThavamani, Sudha. "Fault tolerant control of a ship propulsion system." Diss., Online access via UMI:, 2006.
Find full textGilbar, Thomas Christopher. "Fault tolerant and integrated token ring network." FIU Digital Commons, 1993. https://digitalcommons.fiu.edu/etd/3935.
Full textNixon, Ian Michael. "The automatic synthesis of fault tolerant and fault secure VLSI systems." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/6637.
Full textRalph, Scott K. "A constraint-based approach for computing fault tolerant robot programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0017/NQ46408.pdf.
Full textJackson, Alexander Huw. "Asynchronous embryonics : self-timed biologically-inspired fault-tolerant computing arrays." Thesis, University of York, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423748.
Full textFerreira, Ronaldo Rodrigues. "The transactional HW/SW stack for fault tolerant embedded computing." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/114607.
Full textFault tolerance implementation in embedded systems is challenging because the physical constraints of area occupation, power dissipation, and energy consumption of these systems. The need for optimizing these three physical constraints while doing computation within the available performance goals and real-time deadlines creates a conundrum that is hard to solve. Classical fault tolerance solutions such as triple and dual modular redundancy are not feasible due to their high power overhead or lack of efficient and deterministic error recovery. Existing techniques, although some of them reduce the power and area overhead, incur heavy perfor- mance penalties and most of the time do not assume a feasible fault model. This dissertation introduces the Transactional HW/SW Stack, or simply Stack, to effi- ciently manage the area, power, fault coverage, and performance conundrum. The Stack introduces a new compilation strategy that assembles programs into Transac- tional Basic Blocks, together with a novel microprocessor, the TransactiOnal Basic Block Architecture (ToBBA), which provides fine-grained error detection and deter- ministic error rollback and elimination using the Transactional Basic Blocks (TBBs) both as a container for errors and as a small unit of data checkpointing. Two so- lutions to sustain the TBB semantics in hardware are introduced: software- and hardware-based. Stack’s area, power, performance, and coverage were evaluated using ToBBA’s hardware implementation model. The Stack attains an error correc- tion coverage of 99.35% with 2.05 power overhead within an area overhead of 2.65. The Stack also presents a performance overhead of 1.33 or 1.54, depending on the hardware model adopted to support the TBB.
Hossack, C. J. "Fully interconnected fault tolerant transputer networks using global link adaptors." Thesis, University of Reading, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283238.
Full textGaughan, Patrick T. "Design and analysis of fault-tolerant pipelined multicomputer networks." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/15701.
Full textXue, Zhengyuan, and 薛正远. "Implementation of fault-tolerant quantum computation with superconducting device." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43085465.
Full textOsman, Taha Mohammed. "FADI : a fault-tolerant environment for distributed processing systems." Thesis, Nottingham Trent University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388867.
Full textXue, Zhengyuan. "Implementation of fault-tolerant quantum computation with superconducting device." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43085465.
Full textWebster, Paul Thomas. "Fault-Tolerant Logical Operators in Quantum Error-Correcting Codes." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/25112.
Full textMancini, Luigi Vincenzo. "Reliability issues in the design of distributed object-based architectures." Thesis, University of Newcastle Upon Tyne, 1989. http://hdl.handle.net/10443/2057.
Full textClements, N. Scott. "Fault tolerance control of complex dynamical systems." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15515.
Full textBatchu, Rajanikanth Reddy. "Incorporating fault-tolerant features into message-passing middleware." Master's thesis, Mississippi State : Mississippi State University, 2003. http://library.msstate.edu/etd/show.asp?etd=etd-04072003-215052.
Full textFayyaz, Muhammad. "Task oriented fault-tolerant distributed computing for use on board spacecraft." Thesis, University of Leicester, 2016. http://hdl.handle.net/2381/36268.
Full textBhaduri, Debayan. "Design and Analysis of Defect- and Fault-tolerant Nano-Computing Systems." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/26453.
Full textPh. D.
Mishra, Shivakant. "Consul: A communication substrate for fault-tolerant distributed programs." Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185824.
Full textParameswaran, Rupa. "Investigation of precision versus fault tolerance in voting algorithms." Thesis, Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13536.
Full textBlum, Daniel Ryan. "VLSI implementation of cross-parity and modified dice fault tolerant schemes." Online access for everyone, 2004. http://www.dissertations.wsu.edu/Thesis/Spring2004/d%5Fblum%5F043004.pdf.
Full textSubramaniyan, Rajagopal. "Gossip-based failure detection and consensus for terascale computing." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000799.
Full textTadepalli, Sriram Satish. "GEMS: A Fault Tolerant Grid Job Management System." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9661.
Full textMaster of Science
何偉康 and Wai-hong Ho. "Performance and fault-tolerance studies of wormhole routers in 2D meshes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31214125.
Full textHo, Wai-hong. "Performance and fault-tolerance studies of wormhole routers in 2D meshes /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19685737.
Full textChen, Changgui, and mikewood@deakin edu au. "A Reactive system model for building fault-tolerant distributed applications." Deakin University. School of Computing and Mathematics, 2001. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20050915.134208.
Full textEbert, Dean A. "Design and development of a configurable fault-tolerant processor (CFTP) for space applications." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Jun%5FEbert.pdf.
Full textThesis advisor(s): Herschel H. Loomis, Alan A. Ross. Includes bibliographical references (p. 219-224). Also available online.
Bakhshi, Valojerdi Zeinab. "Persistent Fault-Tolerant Storage at the Fog Layer." Licentiate thesis, Mälardalens högskola, Inbyggda system, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-55680.
Full textPayne, John C. "Fault tolerant computing testbed : a tool for the analysis of hardware and software fault handling techniques /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1998. http://handle.dtic.mil/100.2/ADA359579.
Full text"December 1998." Thesis advisor(s): Alan A. Ross. Includes bibliographical references (p. 169). Also available online.
Huang, Dijiang Medhi Deepankar. "Many-to-many secure group communication and its applications." Diss., UMK access, 2004.
Find full text"A dissertation in computer networking and telecommunication networking." Advisor: Deep Medhi. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Feb. 24, 2006. Includes bibliographical references (leaves 140-147). Online version of the print edition.
Crick, David Alan. "Measures of inexact diagnosability." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/9216.
Full textBharthipudi, Saraswati. "Comparison of numerical result checking mechanisms for FFT computations under faults." Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-12172003-171912/unrestricted/Saraswati%5FBharthipudi%5F2002%5F05.pdf.
Full textDr. Feodor Vainstein, Committee Member; Dr. Doug Blough, Committee Chair; Dr. David Schimmel, Committee Member. Includes bibliographical references (leaves 71-75).
Hay, Karen June. "A proof methodology for verification of real-time and fault-tolerance properties of distributed programs." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186261.
Full text