Existing offset assignments are near optimal for an industrial AFDX network
نویسندگان
چکیده
منابع مشابه
Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network
Recently a class of scalable multi-star optical networks is proposed. In this network class nodes are grouped into clusters. Each cluster employs a separate pair of broadcast and select couplers. The clusters are interconnected via fiber links according to a regular topology. This approach efficiently combines time and/or wavelength division with direct space division. One important issue for t...
متن کاملFeasible Offset an Optimal Offset for Single-Layer Channel Routing
This paper provides an eficient method t o find all feasible offsets f o r a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only f o r problenis with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Q(n) to C2(ii2), where 11 is the number of nets. But we show that if the number of co...
متن کاملGateway Optimization for an Heterogeneous avionics network AFDX-CAN
The gateway impact on the end to end system performances is a major challenge in the design process of heterogeneous embedded systems. In this paper, this problem is tackled for a specific avionics network AFDX with CAN to identify the main interconnection issues. The results herein show the possible enhancements of the system performances thanks to an optimized gateway based on a frames poolin...
متن کاملOptimal Link Assignments for All-Terminal Network Reliability
Probabilistic networks whose links are subject to failure have been extensively studied in the literature. Their reliability is regarded as the network’s ability to continue operation after failures have occurred. We consider the allterminal reliability measure, defined as the probability that the network remains connected after failures. Previous work on this model assumes uniform failures pro...
متن کاملNear-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems
In this paper, we study the problem of the fixed priority preemptive scheduling of hard real-time tasks. We consider independent tasks, which are characterized by a period, a hard deadline, a computation time, and an offset (the time at which the first request is issued) where the latter can be chosen by the scheduling algorithm. Considering only the synchronous case is very pessimistic for off...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGBED Review
سال: 2011
ISSN: 1551-3688,1551-3688
DOI: 10.1145/2095256.2095263