Towards exascale computing with heterogeneous architectures

2017 ◽  
Author(s):  
Kenneth O'Brien ◽  
Lorenzo Di Tucci ◽  
Gianluca Durelli ◽  
Michaela Blott
Keyword(s):  
Exascale Computing ◽  
Heterogeneous Architectures

scholarly journals High-throughput fuzzy clustering on heterogeneous architectures

2020 ◽  
Vol 106 ◽  
pp. 401-411 ◽  
Author(s):  
Juan M. Cebrian ◽  
Baldomero Imbernón ◽  
Jesus Soto ◽  
José M. García ◽  
José M. Cecilia
Keyword(s):  
High Throughput ◽  
Fuzzy Clustering ◽  
Heterogeneous Architectures

scholarly journals DTHMM ExaLB: discrete-time hidden Markov model for load balancing in distributed exascale computing environment

2020 ◽  
Vol 7 (1) ◽  
pp. 1743404
Author(s):  
Ulphat Bakhishoff ◽  
Ehsan Mousavi Khaneghah ◽  
Araz R. Aliev ◽  
Amirhossein Reyhani Showkatabadi ◽  
Stefania Tomasiello
Keyword(s):  
Load Balancing ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Discrete Time ◽  
Hidden Markov ◽  
Computing Environment ◽  
Exascale Computing

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.

Sign in / Sign up

Export Citation Format

Share Document