Possibility and complexity of probabilistic reliable communication in directed networks

2006 ◽  
Author(s):  
Kannan Srinathan ◽  
C. Pandu Rangan
Keyword(s):  
Directed Networks ◽  
Reliable Communication

scholarly journals Distributed support vector machines over dynamic balanced directed networks

2021 ◽  
pp. 1-1
Author(s):  
Mohammadreza Doostmohammadian ◽  
Alireza Aghasi ◽  
Themistoklis Charalambous ◽  
Usman A. Khan
Keyword(s):  
Support Vector Machines ◽  
Support Vector ◽  
Directed Networks ◽  
Vector Machines

scholarly journals Rational Krylov methods for fractional diffusion problems on graphs

2021 ◽  
Author(s):  
Michele Benzi ◽  
Igor Simunec
Keyword(s):  
Analytic Function ◽  
Diffusion Equation ◽  
Graph Laplacian ◽  
Fractional Diffusion ◽  
Singular Matrix ◽  
Krylov Methods ◽  
Fractional Powers ◽  
Directed Networks ◽  
Rank One ◽  
Diffusion Problems

AbstractIn this paper we propose a method to compute the solution to the fractional diffusion equation on directed networks, which can be expressed in terms of the graph Laplacian L as a product $$f(L^T) \varvec{b}$$ f ( L T ) b , where f is a non-analytic function involving fractional powers and $$\varvec{b}$$ b is a given vector. The graph Laplacian is a singular matrix, causing Krylov methods for $$f(L^T) \varvec{b}$$ f ( L T ) b to converge more slowly. In order to overcome this difficulty and achieve faster convergence, we use rational Krylov methods applied to a desingularized version of the graph Laplacian, obtained with either a rank-one shift or a projection on a subspace.

Hybrid Software Redundancy Approach for Building Reliable Communication in Multi-BUS Heterogeneous Systems

2016 ◽  
Vol 23 (04) ◽  
pp. 1650013
Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine
Keyword(s):  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Heterogeneous Systems ◽  
Reliable Communication ◽  
Data Dependencies ◽  
Data Scheduling ◽  
Static Scheduling ◽  
Heterogeneous Architectures ◽  
Multiple Processors ◽  
Hardware Faults

The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed algorithm is based on static scheduling that allows to include the dependencies and the execution cost of tasks and data dependencies in its scheduling decisions. Our scheduling algorithm is dedicated to multi-bus heterogeneous architectures with multiple processors linked by several shared buses. This scheduling algorithm is considering only one bus fault caused by hardware faults and compensated by software redundancy solutions. The proposed algorithm is based on both active and passive backup copies to minimize the scheduling length of data on buses. In the experiments, the proposed methods are evaluated in terms of data scheduling length for a set of DSP benchmarks. The experimental results show the effectiveness of our technique.

scholarly journals Patterns of Link Reciprocity in Directed Networks

2004 ◽  
Vol 93 (26) ◽  
Author(s):  
Diego Garlaschelli ◽  
Maria I. Loffredo
Keyword(s):  
Directed Networks
Sign in / Sign up

Export Citation Format

Share Document