The balanced hypercube B H n, a variant of the hypercube, is a novel interconnection network topology for massive parallel systems. It is showed in [Theor. Comput. Sci. 947 (2023) 113708] that for any edge subset F of B H n there exists a fault-...

• The balanced hypercube admits a Hamiltonian cycle after the removal of any matching.
• The matching can be a perfect matching.
• The largest number of faulty edges in the matching is exponential to the dimension.

• The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.

The well-known randomized consensus algorithm by Aspnes and Herlihy (1990) for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption that the registers that it uses are atomic. ...

• Two new kinds of fault-tolerance, Qm-subcube connectivity k s (Qn; Q m) and Q m-...

Motivated by the famous Locke's Conjecture, we study the following special kind of fault-tolerance of hypercubes. Let Q m be a certain subcube of an n-dimensional hypercube Q n, i.e., 1 ≤ m ≤ n, and let F be a set of vertex-disjoint ...

• Variational networks of cube-connected cycles are new interconnection networks.

In this short note we show that the interconnection networks known as variational networks of cube-connected cycles form a sub-class of the recursive cubes of rings.

This paper identifies a problem in both the TLA + specification and the implementation of the Egalitarian Paxos protocol. It is related to how replicas switch from one ballot to another when computing the dependencies of a command. The ...

• There is a problem in the specification and implementation of Egalitarian Paxos.

In system-level diagnosis, we propose to further classify faulty nodes into two categories. One category is the “ordinary” faulty nodes – they are malfunctioning, but they still participate in the diagnosis, rendering unreliable test ...

• We propose to further classify faulty nodes into two categories: ordinary and broken-down.

Given a bipartite graph G with bipartition ( X , Y ), let F ⊂ E ( G ) be a set of faulty edges and let L be a linear forest in G − F such that | F | + | E ( L ) | ≤ k. Let u ∈ X and v ∈ Y be any two vertices such that none of the paths ...

• Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes was investigated.

The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. The first solution to this problem was given by ...

Crossed cubes are an important class of variants of hypercubes as interconnection topologies in parallel computing. In this paper, we study the embedding of a mesh of trees in the crossed cube. Let n be a multiple of 4 and N=2^(^n^-^2^)^/^2. We prove ...

In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized Petersen graphs, augmented cubes, crossed ...

The twisted cube is an important variant of the hypercube. Recently, Fan et al. proved that the n-dimensional twisted cube TQ"n is edge-pancyclic for every n>=3. They also asked if TQ"n is edge-pancyclic with (n-3) faults for n>=3. We find that TQ"n is ...

In this paper, we give a simple distributed algorithm for constructing a BFS spanning tree in an almost anonymous, asynchronous, rooted network. The proposed algorithm is an improved version of an algorithm by Aspnes. The time complexity of the ...

In the hot-standby replication system, the system cannot process its tasks anymore when all replicated nodes have failed. Thus, the remaining living nodes should be well-protected against failure when parts of replicated nodes have failed. Design faults ...

One of the most important abstractions for designing distributed programs is the broadcast facility. In this paper, we study the interconnection of distributed message passing systems. We have shown that totally ordered systems cannot be properly ...

We consider the problem of preemptively scheduling n imprecise computation tasks on m>=1 uniform processors, with each task T"i having two weights w"i and w"i^'. Three objectives are considered: (1) minimizing the maximum w^'-weighted error; (2) ...

In this paper we study the invertibility of one-dimensional cellular automata, determined by a local rule, acting on the space of all doubly-infinite sequences taking values in a finite Galois ring. We also compute the topological entropy of one-...

Assume that G=(V,E) is an undirected graph, and C@__ __V. For every v@__ __V, we denote I"r(v)={u@__ __C:d(u,v)= F^', then both F and F^' have size at least l+1. Such codes can be used in the maintenance of multiprocessor architectures. We consider the ...

Bloom filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori based on the number of elements to store and the desired false positive ...

In this paper, we consider multiple QoS based grid resource scheduling. Each of grid task agent's diverse requirements is modeled as a quality of service (QoS) dimension, associated with each QoS dimension is a utility function that defines the benefit ...

We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known as the period of the client. The periodicity of such schedules can be ...