FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2284204880> ?p ?o ?g. }

• W2284204880 abstract "This dissertation presents techniques for detecting and tolerating faults in distributed systems. Detecting faults in distributed or parallel systems is often very difficult. We look at the problem of determining if a property or assertion was true in the computation. We formally define a logic called BTL that can be used to define such properties. Our logic takes temporal properties in consideration as these are often necessary for expressing conditions like safety violations and deadlocks. We introduce the idea of a basis of a computation with respect to a property. A basis is a compact and exact representation of the states of the computation where the property was true. We exploit the lattice structure of the computation and the structure of different types of properties and avoid brute force approaches. We have shown that it is possible to efficiently detect all properties that can be expressed by using nested negations, disjunctions, conjunctions and the temporal operators possibly and always. Our algorithm is polynomial in the number of processes and events in the system, though it is exponential in the size of the property. After faults are detected, it is necessary to act on them and, whenever possible, continue operation with minimal impact. This dissertation also deals with designing systems that can recover from faults. We look at techniques for tolerating faults in data and the state of the program. Particularly, we look at the problem where multiple servers have different data and program state and all of these need to be backed up to tolerate failures. Most current approaches to this problem involve some sort of replication. Other approaches based on erasure coding have high computational and communication overheads. We introduce the idea of fusible data structures to back up data. This approach relies on the inherent structure of the data to determine techniques for combining multiple such structures on different servers into a single backup data structure. We show that most commonly used data structures like arrays, lists, stacks, queues, and so on are fusible and present algorithms for this. This approach requires less space than replication without increasing the time complexities for any updates. In case of failures, data from the back up and other non-failed servers is required to recover. To maintain program state in case of failures, we assume that programs can be represented by deterministic finite state machines. Though this approach may not yet be practical for large programs it is very useful for small concurrent programs like sensor networks or finite state machines in hardware designs. We present the theory of fusion of state machines. Given a set of such machines, we present a polynomial time algorithm to compute another set of machines which can tolerate the required number of faults in the system." @default.
• W2284204880 created "2016-06-24" @default.
• W2284204880 creator A5017858276 @default.
• W2284204880 creator A5061474994 @default.
• W2284204880 date "2008-01-01" @default.
• W2284204880 modified "2023-09-26" @default.
• W2284204880 title "Detecting and tolerating faults in distributed systems" @default.
• W2284204880 cites W1481985818 @default.
• W2284204880 cites W1491954656 @default.
• W2284204880 cites W1492839618 @default.
• W2284204880 cites W1501731334 @default.
• W2284204880 cites W1503170978 @default.
• W2284204880 cites W1503478887 @default.
• W2284204880 cites W1528441743 @default.
• W2284204880 cites W1529733775 @default.
• W2284204880 cites W1538683864 @default.
• W2284204880 cites W1539432158 @default.
• W2284204880 cites W1539816220 @default.
• W2284204880 cites W1571338961 @default.
• W2284204880 cites W1576238472 @default.
• W2284204880 cites W1578211237 @default.
• W2284204880 cites W1749490593 @default.
• W2284204880 cites W1934074768 @default.
• W2284204880 cites W1966988803 @default.
• W2284204880 cites W1974401809 @default.
• W2284204880 cites W1995875735 @default.
• W2284204880 cites W1998024670 @default.
• W2284204880 cites W2002089154 @default.
• W2284204880 cites W2029712200 @default.
• W2284204880 cites W2033269398 @default.
• W2284204880 cites W2037628724 @default.
• W2284204880 cites W2038026846 @default.
• W2284204880 cites W2047482026 @default.
• W2284204880 cites W2059677035 @default.
• W2284204880 cites W2059723463 @default.
• W2284204880 cites W20649036 @default.
• W2284204880 cites W2076492944 @default.
• W2284204880 cites W2077450865 @default.
• W2284204880 cites W2087409327 @default.
• W2284204880 cites W2089138728 @default.
• W2284204880 cites W2089904802 @default.
• W2284204880 cites W2093397547 @default.
• W2284204880 cites W2096225456 @default.
• W2284204880 cites W2100302143 @default.
• W2284204880 cites W2113142402 @default.
• W2284204880 cites W2115309705 @default.
• W2284204880 cites W2119965246 @default.
• W2284204880 cites W2121584042 @default.
• W2284204880 cites W2122493035 @default.
• W2284204880 cites W2126924915 @default.
• W2284204880 cites W2128553025 @default.
• W2284204880 cites W2131053137 @default.
• W2284204880 cites W2139640665 @default.
• W2284204880 cites W2147066648 @default.
• W2284204880 cites W2147504831 @default.
• W2284204880 cites W2147853062 @default.
• W2284204880 cites W2152465173 @default.
• W2284204880 cites W2161342511 @default.
• W2284204880 cites W2166842511 @default.
• W2284204880 cites W2539130632 @default.
• W2284204880 cites W2612150260 @default.
• W2284204880 cites W2912556876 @default.
• W2284204880 cites W3137092842 @default.
• W2284204880 cites W3137220996 @default.
• W2284204880 cites W3169000564 @default.
• W2284204880 cites W1980073965 @default.
• W2284204880 cites W2135697757 @default.
• W2284204880 cites W2499053525 @default.
• W2284204880 cites W2520930489 @default.
• W2284204880 hasPublicationYear "2008" @default.
• W2284204880 type Work @default.
• W2284204880 sameAs 2284204880 @default.
• W2284204880 citedByCount "0" @default.
• W2284204880 crossrefType "journal-article" @default.
• W2284204880 hasAuthorship W2284204880A5017858276 @default.
• W2284204880 hasAuthorship W2284204880A5061474994 @default.
• W2284204880 hasConcept C111472728 @default.
• W2284204880 hasConcept C11413529 @default.
• W2284204880 hasConcept C120314980 @default.
• W2284204880 hasConcept C138885662 @default.
• W2284204880 hasConcept C165696696 @default.
• W2284204880 hasConcept C189950617 @default.
• W2284204880 hasConcept C199360897 @default.
• W2284204880 hasConcept C2185349 @default.
• W2284204880 hasConcept C38652104 @default.
• W2284204880 hasConcept C40422974 @default.
• W2284204880 hasConcept C41008148 @default.
• W2284204880 hasConcept C45374587 @default.
• W2284204880 hasConcept C48103436 @default.
• W2284204880 hasConcept C80444323 @default.
• W2284204880 hasConceptScore W2284204880C111472728 @default.
• W2284204880 hasConceptScore W2284204880C11413529 @default.
• W2284204880 hasConceptScore W2284204880C120314980 @default.
• W2284204880 hasConceptScore W2284204880C138885662 @default.
• W2284204880 hasConceptScore W2284204880C165696696 @default.
• W2284204880 hasConceptScore W2284204880C189950617 @default.
• W2284204880 hasConceptScore W2284204880C199360897 @default.
• W2284204880 hasConceptScore W2284204880C2185349 @default.
• W2284204880 hasConceptScore W2284204880C38652104 @default.
• W2284204880 hasConceptScore W2284204880C40422974 @default.

• next