作者: 自負的人 時間: 2025-3-21 20:31 作者: insomnia 時間: 2025-3-22 03:52 作者: Repatriate 時間: 2025-3-22 06:27
Fabian Siekmann,Aseem Kinra,Herbert Kotzabalyze 6 months of error logs from nodes in the prototype. We found that the disks drives were among the most reliable components in the system. We were also able to divide errors into eleven categories, comprising disk errors, network errors and SCSI errors that appeared repeatedly across all nodes.作者: 繼承人 時間: 2025-3-22 12:05 作者: insurrection 時間: 2025-3-22 15:44 作者: insurrection 時間: 2025-3-22 19:24
Sina Willrodt,Stephan Krüger,Carlos Jahnsystem is made of a set of logical clocks (one per process) plus a protocol that manages their progress. A logical clock allows a process to timestamp its events. The fundamental property of a logical clock system (called .) is the following: if two events are causally related [13] (one being the po作者: Infiltrate 時間: 2025-3-22 22:39 作者: ALIBI 時間: 2025-3-23 04:29 作者: Repetitions 時間: 2025-3-23 07:27
Summary and Future Perspectivesurces, achieve fault-tolerance and obtain high extensibility and dependability. A new algorithm based on Binary Decision Diagrams (BDD) for dependability analysis of distributed computer systems (DCS) with imperfect coverage is proposed in this paper. Minimum file spanning trees (MFST) are generated作者: 案發(fā)地點 時間: 2025-3-23 10:23
Dynamics of Asymmetric Dissipative Systemsflooding of new information across the entire routing area after changes in any link state (e.g. link failures). As the routing area grows or the frequency of link-state changes increases, the overhead (in terms of bandwidth and processing cost) of flooding becomes prohibitive. Furthermore, such flo作者: Seizure 時間: 2025-3-23 16:39
Benno Hess,Dietrich Kuschmitz,Mario Markusnterface card (NIC). High speed LANs may change their topology due to switches and hosts being turned on/off, link remapping, and component failures. In these cases, a distributed reconfiguration algorithm analyzes the topology, computes the new routing tables, and downloads them to the correspondin作者: 群居男女 時間: 2025-3-23 18:09
Kinetics of Oxidative Decarboxylasese new high-performance computing trend, providing a low cost-performance ratio. Server Net (Compaq) and Myrinet are providing COTS (routers, PCI interface cards and software drivers) for building high-speed scalable SAN, based on wormhole routing techniques. Different regular topologies can be built作者: SPURN 時間: 2025-3-24 01:12 作者: 話 時間: 2025-3-24 06:20
Rat-Liver Glucokinase as a Mnemonical Enzyme which is a vector associated with each node to capture fault information in the neighborhood. In order to minimize the total number of traffic steps, three heuristic strategies are proposed. A simulation study is conducted to measure the total number of traffic steps under different strategies. Our作者: 過濾 時間: 2025-3-24 09:06
Dependable Network Computing978-1-4615-4549-1Series ISSN 0893-3405 作者: Allege 時間: 2025-3-24 13:22 作者: opinionated 時間: 2025-3-24 17:17 作者: Density 時間: 2025-3-24 19:29
On the Possibility of Group Membership Protocolsions required for their proof and show how to circumvent this impossibility result building a weaker, yet non trivial specification. We provide an algorithm that solves this specification and show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification.作者: 犬儒主義者 時間: 2025-3-25 00:43 作者: BULLY 時間: 2025-3-25 03:20
Failure Characteristics and Soft Error Behavior in a Large Storage Systemalyze 6 months of error logs from nodes in the prototype. We found that the disks drives were among the most reliable components in the system. We were also able to divide errors into eleven categories, comprising disk errors, network errors and SCSI errors that appeared repeatedly across all nodes.作者: Tempor 時間: 2025-3-25 10:20
Totally Ordered Broadcast in the Face of Network Partitionsservice as a building block. The algorithm always allows a majority (or quorum) of connected processes in the network to make progress (i.e., to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, the algorithm always allows processes to initiat作者: 數(shù)量 時間: 2025-3-25 12:26
On the Possibility of Group Membership Protocolsions required for their proof and show how to circumvent this impossibility result building a weaker, yet non trivial specification. We provide an algorithm that solves this specification and show that our solution is an improvement upon previous attempts to solve this problem using a weaker specifi作者: Banister 時間: 2025-3-25 17:44 作者: archenemy 時間: 2025-3-25 22:25 作者: endoscopy 時間: 2025-3-26 02:29
Automated Formal Analysis of Networks networks. A novel induction technique is described which can be used to verify end-to-end properties of certain arbitrarily configured networks. Additionally a formal model of an algorithm for regulating burstiness of network traffic is presented which incorporates discrete timing constraints. Our 作者: chalice 時間: 2025-3-26 08:20 作者: 枯萎將要 時間: 2025-3-26 09:03 作者: 過濾 時間: 2025-3-26 14:36 作者: 頂點 時間: 2025-3-26 20:04
Adaptive Minimal-Path Routing in 2-Dimensional Torus Servernet Sane new high-performance computing trend, providing a low cost-performance ratio. Server Net (Compaq) and Myrinet are providing COTS (routers, PCI interface cards and software drivers) for building high-speed scalable SAN, based on wormhole routing techniques. Different regular topologies can be built作者: impaction 時間: 2025-3-27 00:42 作者: Mettle 時間: 2025-3-27 01:45 作者: CULP 時間: 2025-3-27 06:26 作者: atopic 時間: 2025-3-27 11:28 作者: 責(zé)問 時間: 2025-3-27 15:49
Benno Hess,Dietrich Kuschmitz,Mario Markusm cell transfer delay) and CLR (cell loss ratio) parameters. Distributed multimedia applications have similar, although less strict, quality of service (QoS) requirements. Both stopping packet transmission and the massive packet discarding due to the reconfiguration process prevent the system from s作者: Offbeat 時間: 2025-3-27 21:22
Kinetics of Oxidative Decarboxylases the connected 2D torus all fault-free nodes are reachable. The algorithm is decentralized and does not require global knowledge about the status of the networks. The simulation results present the effect of the network size, the request generation rate, the number of faults, and the fault pattern o作者: GONG 時間: 2025-3-28 01:52 作者: G-spot 時間: 2025-3-28 05:58 作者: 肌肉 時間: 2025-3-28 09:34 作者: 和平主義者 時間: 2025-3-28 11:05 作者: 指派 時間: 2025-3-28 17:32
Adaptive Minimal-Path Routing in 2-Dimensional Torus Servernet San the connected 2D torus all fault-free nodes are reachable. The algorithm is decentralized and does not require global knowledge about the status of the networks. The simulation results present the effect of the network size, the request generation rate, the number of faults, and the fault pattern o作者: 無表情 時間: 2025-3-28 21:57 作者: opportune 時間: 2025-3-29 00:49 作者: 中止 時間: 2025-3-29 04:51
Dirk Sackmann,Abdulaziz Mardenliechanism. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within at most two communication rounds, if no failures occur during these rounds.作者: Supplement 時間: 2025-3-29 10:16
Sina Willrodt,Stephan Krüger,Carlos Jahnin types of logical clocks have been investigated. Scalar clocks are particularly interesting when one is interested in obtaining a system-wide total ordering of events. Vector clocks [6, 14] have been introduced to decide whether two events are causally related or are independent.作者: 紅潤 時間: 2025-3-29 14:24 作者: 商業(yè)上 時間: 2025-3-29 18:31
Reliable Logical Clocks For Unreliable Process Groupsin types of logical clocks have been investigated. Scalar clocks are particularly interesting when one is interested in obtaining a system-wide total ordering of events. Vector clocks [6, 14] have been introduced to decide whether two events are causally related or are independent.作者: prostate-gland 時間: 2025-3-29 21:50 作者: 有權(quán)威 時間: 2025-3-30 02:40 作者: impaction 時間: 2025-3-30 04:02
Implementing Protocols with Synchronous Objectsprecise directives to write sound concurrent/distributed applications. It also provides clues on how this approach can fill the gap between the program developments and the theories aimed at the analysis of concurrent/distributed applications. Support in the form of libraries (for C++ and Java) and a specific compiler (sC++) are freely available.作者: Sarcoma 時間: 2025-3-30 11:28 作者: REP 時間: 2025-3-30 15:54 作者: eczema 時間: 2025-3-30 17:12
Stephan Meisel,Uli Suppa,Dirk Mattfeldtionally a formal model of an algorithm for regulating burstiness of network traffic is presented which incorporates discrete timing constraints. Our models are presented in CSP with automatic verification by the FDR model checker.
