Various types of CNNs are summarized and the taxonomy of CNN is given according to the different types of grids, processors, interactions, and modes of operation. Next, the CNN Universal Machine is introduced. The arc...
The problem of mapping a task that is composed of interacting modules onto a hypercube multicomputer is formulated and solved by minimizing an objective function called the communication traffic. The objective functio...
详细信息
The problem of mapping a task that is composed of interacting modules onto a hypercube multicomputer is formulated and solved by minimizing an objective function called the communication traffic. The objective function allows module assignments to be found with the usual straightforward combinatorial optimization techniques. The problem of finding an assignment that minimizes the communication traffic is proved to be NP-hard, so a standard state-space search algorithm as well as other heuristic algorithms are used to find optimal/suboptimal solutions. The relative performances of various algorithms are evaluated using simulations. The assignments obtained from these algorithms are evaluated using an event-driven simulator to learn how they perform in real-world execution environments.< >
The feasibility of using buffered transmission, which has the advantages of eliminating the token passing overhead and relieving the network interface from the complex token handling operations, is considered. The con...
详细信息
The feasibility of using buffered transmission, which has the advantages of eliminating the token passing overhead and relieving the network interface from the complex token handling operations, is considered. The concept of a real-time channel (RTC) and the RTC establishment procedures are reviewed. Its performance is then compared with the FDDI timed token protocol. Simulation results show that the buffered transmission in local area ring networks equipped with real-time channels enhances both the networks' throughput and the ability to support heterogeneous real-time traffic. The implementation of the network interface is also examined with an example design showing the feasibility of real-time channels in high-speed local area networks.< >
The authors address the problem of allocating (assigning and scheduling) periodic task modules to processing nodes (PNs) in distributed real-time systems subject to task precedence and timing constraints. Using the br...
详细信息
The authors address the problem of allocating (assigning and scheduling) periodic task modules to processing nodes (PNs) in distributed real-time systems subject to task precedence and timing constraints. Using the branch-and-bound technique, a module allocation algorithm (MAA) is proposed to find an optimal allocation that maximizes the probability of meeting task deadlines. To incorporate both timing and logical correctness into module allocation, the probability of meeting task deadlines is used as the objective function. The MAA is then applied to find an optimal allocation of task modules in a distributed system. The timing aspects embedded in the objective function drive the MAA not only to assign task modules to PNs, but also to use a module scheduling algorithm for scheduling all modules assigned to each PN so that all tasks may be completed in time. Several numerical examples are presented to demonstrate the effectiveness and practicality of the proposed algorithms.< >
The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. A dynamic failure is said to occur if this delay e...
详细信息
The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. A dynamic failure is said to occur if this delay exceeds a certain limit called a hard deadline. We present a method for calculating the hard deadlines in linear time-invariant control systems. To derive necessary conditions for (asymptotic) system stability, the state difference equation is modified based on an assumed maximum delay and the probability distribution of delays whose magnitudes are less than, or equal to, the assumed maximum delay. Moreover, the allowed state-space - which is derived from given input and state constraints - is used to calculate the hard deadline as a function of time and the system state. We also consider a one-shot delay model in which a single event causes a dynamic failure.
An increasing number of applications require packets to be delivered reliably within prespecified delay bounds. It is shown how this can be achieved by using real-time channels that make soft reservation of network re...
详细信息
An increasing number of applications require packets to be delivered reliably within prespecified delay bounds. It is shown how this can be achieved by using real-time channels that make soft reservation of network resources to ensure the timely delivery of real-time packets. Algorithms are presented for the establishment of real-time channels, and it is shown how the basic real-time channels can be enhanced to be fault tolerant using the multiple paths between a pair of communicating nodes. The contribution of the former is a tighter schedulability condition that makes more efficient use of network resources than other existing approaches, and the contribution of the latter is a significant improvement in fault tolerance over the basic real-time channel, which is inherently susceptible to component failures.< >
A strategy for handling real-time communications under the FieldBus protocol, which provides end-to-end delivery delay guarantees for time-critical messages, is proposed. This strategy provides a fast local mechanism ...
详细信息
A strategy for handling real-time communications under the FieldBus protocol, which provides end-to-end delivery delay guarantees for time-critical messages, is proposed. This strategy provides a fast local mechanism for establishing intraworkcell real-time connections, while supporting global interworkcell real-time connections. The proposed strategy is fully compatible with the current draft proposal of the FieldBus protocol and also provides flexibility for the choice of scheduling algorithms and adaptability for different traffic loads. Numerical examples are given based on a typical manufacturing network.< >
Various types of cellular neural networks (CNNs) are summarized, and a taxonomy of CNNs is given according to the different types of grids, processors, interactions, and modes of operation. The CNN universal machine i...
详细信息
Various types of cellular neural networks (CNNs) are summarized, and a taxonomy of CNNs is given according to the different types of grids, processors, interactions, and modes of operation. The CNN universal machine is introduced. The architecture and the key features of the CNN universal machine are outlined. An exhaustive list of references is given.< >
For pt.I, see ibid., p.1-10 (1992). The programmability (as a stored program) of the CNN universal machine is discussed. It is shown why and in which sense this machine is universal. The analogic type of algorithm is ...
详细信息
For pt.I, see ibid., p.1-10 (1992). The programmability (as a stored program) of the CNN universal machine is discussed. It is shown why and in which sense this machine is universal. The analogic type of algorithm is introduced. The application potential is reviewed and the biological relevance is analyzed. It is shown that the architecture is optimal not only for silicon implementations, but also for many biological information processing organs that have the same structure.< >
暂无评论