Open AccessProceedings Article
HARTS: A Distributed Real-Time Architecture.
Kang G. Shin
- pp 431-455
Reads0
Chats0
TLDR
The HARTS (hexagonal architecture for real-time systems) as mentioned in this paper is a distributed realtime architecture that supports fault-tolerant communication and I/O. HARTS consists of shared-memory multiprocessor nodes, interconnected by a wrapped hexagonal mesh.Abstract:
The design, implementation, and evaluation of a distributed real-time architecture called HARTS (hexagonal architecture for real-time systems) are discussed, emphasizing its support of time-constrained, fault-tolerant communications and I/O (input/output) requirements HARTS consists of shared-memory multiprocessor nodes, interconnected by a wrapped hexagonal mesh This architecture is intended to meet three main requirements of real-time computing: high performance, high reliability, and extensive I/O The high-level and low-level architecture is described The evaluation of HARTS, using modeling and simulation with actual parameters derived from its implementation, is reported Fault-tolerant routing, clock synchronization and the I/O architecture are examined >read more
Citations
More filters
Journal ArticleDOI
Real-time computing: a new discipline of computer science and engineering
TL;DR: This paper introduces basic concepts and identifies key issues in the design of real-time systems and solutions proposed in literature for tackling these issues are briefly discussed.
Journal ArticleDOI
Honeycomb networks: Topological properties and communication algorithms
TL;DR: The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network and honeycomb networks with rhombus and rectangle as the bounding polygons are considered.
Proceedings ArticleDOI
DOCTOR: an integrated software fault injection environment for distributed real-time systems
TL;DR: An integrated software fault injection environment (DOCTOR) which is capable of generating synthetic workloads under which system dependability is evaluated, injecting various types of faults with different options, and collecting performance and dependability data is presented.
Book
Distributed Systems for System Architects
Paulo Veríssimo,Luís Rodrigues +1 more
TL;DR: The distributed systems architect assembles pieces of hardware that are at least as large as a computer or a network router, and assigns pieces of software that are self-contained - such as Java applets - to those hardware components.
Proceedings ArticleDOI
The TickerTAIP parallel RAID architecture
TL;DR: TickerTAIP is described, a parallel architecture for disk arrays that distributed the controller functions across several loosely-coupled processors that is feasible, useful, and effective.
References
More filters
Book
Deadlock-free message routing in multiprocessor interconnection networks
TL;DR: A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels, which is used to develop deadlocked routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.
Journal ArticleDOI
Virtual cut-through: A new computer communication switching technique
Parviz Kermani,Leonard Kleinrock +1 more
TL;DR: The analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.
Journal ArticleDOI
Synchronizing clocks in the presence of faults
TL;DR: Three algorithms for maintaining clock synchrony in a distributed multiprocess system where each process has its own clock work in the presence of arbitrary clock or process failures, including “two-faced clocks” that present different values to different processes.
Journal ArticleDOI
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
TL;DR: Description d'une methode generale pour implementer un systeme reparti ayant n'importe quel degre desire de tolerance de panne, d'un solution au probleme «Bizantine Generals» sont assumes.
Journal ArticleDOI
Addressing, routing, and broadcasting in hexagonal mesh multiprocessors
TL;DR: An elegant, distributed routing scheme is developed for wrapped H-meshes so that each node in an H-mesh can compute shortest paths from itself to any other node with a straightforward algorithm of O(1) using the addresses of the source-destination pair only, independent of the network's size.