Journal ArticleDOI
Packet Routing in Fixed-Connection Networks
TLDR
This work focuses on (partial) permutation, k-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results.About:
This article is published in Journal of Parallel and Distributed Computing.The article was published on 1998-11-01. It has received 103 citations till now. The article focuses on the topics: Static routing & Dynamic Source Routing.read more
Citations
More filters
Journal ArticleDOI
Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks
TL;DR: The authors have proposed an integer linear programming formulation for the scheduling problem and a greedy randomised adaptive search procedure-based heuristic for the routing problem that have been evaluated using several test cases.
Journal ArticleDOI
Design optimization of TTEthernet-based distributed real-time systems
TL;DR: This paper focuses on the design optimization of TTEthernet protocol, a deterministic, synchronized and congestion-free network protocol based on the Ethernet standard and compliant with the ARINC 664 Specification Part 7, and proposes a Tabu Search-based metaheuristic for this optimization problem.
Journal ArticleDOI
Routing optimization of AVB streams in TSN networks
TL;DR: A search-space reduction technique and a Greedy Randomized Adaptive Search Procedure-based heuristic are proposed for this routing optimization problem of the AVB streams such that all frames are schedulable and their worst-case end-to-end delay is minimized.
Proceedings ArticleDOI
Optimal load-balancing
TL;DR: Whether this particular method of load-balancing is optimal in the sense that it achieves the highest throughput for a given capacity of interconnect is explored.
Proceedings ArticleDOI
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
TL;DR: This work describes and provides optimal routing algorithms whose rate per node is equal to this upper bound on the network capacity and proposes a particular combination of two routing algorithms, the first being optimal when there are no node failures at all and the second being appropriate when the probability of node failure is high.
References
More filters
Book ChapterDOI
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract)
TL;DR: Under the standard point-to-point assumption, this work proves a bandwidth-based lower bound on the slowdown of any deterministic PRAM simulation on an arbitrary network, formulated in terms of its decomposition tree.
Journal ArticleDOI
Integer sorting on a mesh-connected array of processors
TL;DR: Using a less restrictive, more realistic model, it is shown that the sorting N = n 2 integers in the range [1 ... N] can be performed in 2n + o(n) steps on a n X n mesh.
Journal Article
A guide to sorting on the mesh-connected processor array
Bogdon S. Chlebus,Maciej Kukawka +1 more
Journal ArticleDOI
Very Efficient Cyclic Shifts on Hypercubes
Pei Ouyang,Krishna V. Palem +1 more
TL;DR: It is proved that by using this algorithm, any cyclic shift can be realized by using at most 4/3nsteps, without using any local message buffers, on asynchronous hypercubes.
Book ChapterDOI
Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy
TL;DR: Lower and upper bounds for the deterministic emulation of a Parallel Random Access Machine (PRAM) with n processors and m variables on a Distributed Memory Machine (DMM), and become tight for any m polynomial in n and r=Θ(1).