| 1. |
- Asplund, Mikael, 1981-, et al.
(author)
-
Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination
- 2017
-
In: Dependable Computing (PRDC), 2017 IEEE 22nd Pacific Rim International Symposium on. - : IEEE. - 9781509056521 - 9781509056538 ; , s. 321-328
-
Conference paper (peer-reviewed)abstract
- New advanced traffic management solutions with fully or semi-autonomous vehicles that communicate over a wireless interface to coordinate their driving decisions create new challenges in distributed computing. In this paper we address the problem of dynamic group membership in three stages. First, we propose three criteria to specify correctness and performance of the group views created by such algorithms in terms of soundness, completeness and freshness. Second, we develop a group membership protocol tailored for vehicular coordination. Finally, we show through simulation and model-based verification that the protocol does indeed meet the criteria and provide at least 95% perfect group membership views under as adverse conditions as 70% packet loss or very high churn rate.
|
|
| 2. |
- Fathollah Nejad Asl, Negin, 1982, et al.
(author)
-
A Probabilistic Analysis of a Leader Election Protocol for Virtual Traffic Lights
- 2017
-
In: Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC. - 1541-0110. - 9781509056521 ; , s. 311-320
-
Conference paper (peer-reviewed)abstract
- Vehicle-to-vehicle communication systems support diverse cooperative applications such as virtual traffic lights. However, in order to harness the potential benefits of those applications, one must address the challenges faced by distributed algorithms in environments based on unreliable wireless communications. In this paper we address the problem of leader election among the nodes of a cooperative system, under the assumption that the network is unreliable and any number of messages may be lost, and that the number of participating nodes is initially unknown. It is known from the literature that a deterministic solution to this problem does not exist. Nevertheless, one may devise probabilistic solutions that provide arbitrarily high probability of success. In the proposed solution, nodes are enhanced with a local oracle that provides minimal information on the state of the system. Such local oracles, even if unreliable, are shown to increase the probability of success in reaching consensus on the result of the leader election.
|
|
| 3. |
- Sangchoolie, Behrooz, et al.
(author)
-
Light-weight techniques for improving the controllability and efficiency of ISA-level fault injection tools
- 2017
-
In: Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC. - : IEEE Computer Society. - 1541-0110. - 9781509056514 - 9781509056521 ; , s. 68-77
-
Conference paper (peer-reviewed)abstract
- ISA-level fault injection, i.e. the injection of bitflip faults in Instruction Set Architecture (ISA) registers and main memory words, is widely used for studying the impact of transient and intermittent hardware faults. ISA-level fault injection tools can be characterized by different properties such as repeatability, observability, reachability, intrusiveness, efficiency and controllability. This paper presents two preinjection analysis techniques that improve controllability and efficiency using object code analysis. To improve controllability, we propose a technique for identifying the type of data that is stored in a potential target location. This allows the user to selectively direct fault injections to addresses, data and/or control information. Experimental results show that the data type of 84-100% of the targets locations in 8 programs were successfully identified by this technique. The second technique improves efficiency by fault pruning, i.e., by avoiding injection of faults that is known a priori to be detected by the tested system. This technique leverage the fact that faults in certain bits in the program counter and the stack pointer are always detected by machine exceptions. We show that exclusion of these bits from the fault space could significantly prune the fault space and reduce the time it takes to conduct a fault injection campaign.
|
|
