We propose a periodic diagnostic algorithm based on the testing model of computation for real-time systems. The diagnostic task runs on every processor of the system. When the task starts execution, all the processors are synchronized and will be doing the same operation at every step of the algorithm. Each processor performs a test of itself and generates a token which contains the test result...

Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is...

An algorithm to reconfigure a fault-tolerant double-loop token-ring local area network following topological changes is presented. The algorithm guarantees that at all operational times the network is organized to provide maximum possible connectivity among the nodes either one loop that encompasses all nodes in the network or several subloops each of which operates as a separate token ring net...

The present paper describes a MAC protocol for a high-speed ring with multiple tokens. The purpose of this protocol is to increase the throughput and to improve the delay-throughput characteristic of high-speed token-rings. The main concept of the new MAC protocol is to maintain several logical token-rings in the single physical ring. Each logical ring has its own token, and its operation is cl...

The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as automated warehouses, where agents are constantly engaged with new tasks. In this paper, we therefore study a lifelong version of the MAPF problem, called the multiagent pickup and delivery (MAPD) problem. In the MAPD pr...

A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure, is presented. The rooted tree introduced. named “open-cube“ , has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good perfotmances and high tolerance to node failures: the worst case message complexity per request is, in the absence of node fail...

This paper shows the current state of our research into a home network which provides both real-time and non-realtime capabilities for one coherent, distributed architecture. It is based on a new type of real-time token protocol that uses scheduling to achieve optimal token-routing in the network. Depending on the scheduling algorithm, bandwidth utilisations of 100% are possible. Token manageme...

A home router, or a home gateway, is the node that resides between a public network and a home network for computers to share Internet connections. To insert customized queuing and scheduling codes into the embedded Linux kernel is a way to make the Linux-based home routers support Quality of Service (QoS). It is desirable that the small Linux kernel adopts an efficient queuing and scheduling a...

In 1974, Dijkstra introduced the notion of self-stabilization and presented a token circulation distributed mutual exclusion (DMX) protocol as the first self-stabilizing (SS) algorithm. Since then, many variations of SS DMX algorithms have been presented. Most, if not all, of these algorithms impose stronger assumptions on their execution environments than those provided by common distributed s...

This paper proposes a novel token-passing search architecture for supporting subword unit based speech recognition and a corresponding algorithm based on the well-known LZW text compression method to determine a vocabulary of subword units in an unsupervised manner. We compare our subword unit selection algorithm to an existing approach based on Minimum Description Length (MDL) modeling and als...