multiprocessor systems
Recently Published Documents


TOTAL DOCUMENTS

1268
(FIVE YEARS 83)

H-INDEX

46
(FIVE YEARS 3)

Author(s):  
Hongbin Zhuang ◽  
Wenzhong Guo ◽  
Xiaoyan Li ◽  
Ximeng Liu ◽  
Cheng-Kuan Lin

The processor failures in a multiprocessor system have a negative impact on its distributed computing efficiency. Because of the rapid expansion of multiprocessor systems, the importance of fault diagnosis is becoming increasingly prominent. The [Formula: see text]-component diagnosability of [Formula: see text], denoted by [Formula: see text], is the maximum number of nodes of the faulty set [Formula: see text] that is correctly identified in a system, and the number of components in [Formula: see text] is at least [Formula: see text]. In this paper, we determine the [Formula: see text]-component diagnosability of general networks under the PMC model and MM[Formula: see text] model. As applications, the component diagnosability is explored for some well-known networks, including complete cubic networks, hierarchical cubic networks, generalized exchanged hypercubes, dual-cube-like networks, hierarchical hypercubes, Cayley graphs generated by transposition trees (except star graphs), and DQcube as well. Furthermore, we provide some comparison results between the component diagnosability and other fault diagnosabilities.


2021 ◽  
Vol 2131 (2) ◽  
pp. 022121
Author(s):  
V G Kobak ◽  
V M Porksheyan ◽  
A G Jukovskiy ◽  
R S Shkabriy

Abstract The relevance of the topic of this work is the strong growth of multiprocessor systems, for which it is important to solve a large volume of tasks in a minimum time. There are various algorithms for solving such a problem, which can be divided into classes of exact and approximate. The representative of approximate algorithms is the algorithm of the Goldberg model, which gives acceptable results, the modifications of the crossovers of which are studied in this paper.


Author(s):  
Jiafei Liu ◽  
Shuming Zhou ◽  
Eddie Cheng ◽  
Gaolin Chen ◽  
Min Li

Multiprocessor systems are commonly deployed for big data analysis because of evolution in technologies such as cloud computing, IoT, social network and so on. Reliability evaluation is of significant importance for maintenance and improvement of fault tolerance for multiprocessor systems, and system-level diagnosis is a primary strategy to identify the faulty processors in the systems. In this paper, we first determine the [Formula: see text]-good-neighbor connectivity of the [Formula: see text]-dimensional Bicube-based multiprocessor system [Formula: see text], a novel variant of hypercube. Besides, we establish the [Formula: see text]-good-neighbor diagnosability of the Bicube-based multiprocessor system [Formula: see text] under the PMC and MM* models.


Author(s):  
D. I. Kukushkin ◽  
V. A. Antonenko

The serverless computing model is becoming quite widespread. This model allows developers to create flexible and fault tolerant applications with an attractive billing model. The increasing complexity of serverless functions has led to the necessity to use serverless workflows – serverless functions invoking other serverless functions. However, such concept imposes certain requirements on the serverless functions that make distributed computations. The overhead of transferring data between serverless functions can significantly increase the execution time of a program using this approach. One way to reduce overhead is to improve serverless scheduling techniques. This paper discusses an approach to scheduling serverless computations based on data dependency analysis. We propose to divide the problem of planning of the computation of a composite serverless function into three stages. For each stage we provide a description by a mathematical model. We carried out a review of algorithms used to schedule resources by compilers and in parallel computing in multiprocessor systems to determine the best algorithm to implement in a prototype scheduler. For each algorithm, it was specified how it could be used for resource scheduling in serverless platforms. We provide a description of the developed prototype based on the Fission serverless platform. The prototype implements the critical path heuristic. It is shown that the improvements can significantly reduce the execution time up to two times for some types of serverless functions.


2021 ◽  
Author(s):  
Vijay Banerjee ◽  
Sena Hounsinou ◽  
Harrison Gerber ◽  
Gedare Bloom

2021 ◽  
pp. 2150015
Author(s):  
Wenjun Liu ◽  
Wenjun Li

Adaptive diagnosis is an approach in which tests can be scheduled dynamically during the diagnosis process based on the previous test outcomes. Naturally, reducing the number of test rounds as well as the total number of tests is a major goal of an efficient adaptive diagnosis algorithm. The adaptive diagnosis of multiprocessor systems under the PMC model has been widely investigated, while adaptive diagnosis using comparison model has been independently discussed only for three networks, including hypercube, torus, and completely connected networks. In addition, adaptive diagnosis of general Hamiltonian networks is more meaningful than that of special graph. In this paper, the problem of adaptive fault diagnosis in Hamiltonian networks under the comparison model is explored. First, we propose an adaptive diagnostic scheme which takes five to six test rounds. Second, we derive a dynamic upper bound of the number of fault nodes instead of setting a value like normal. Finally, we present an algorithm such that at least one sequence obtained from cycle partition can be picked out and all nodes in this sequence can be identified based on the previous upper bound.


Sign in / Sign up

Export Citation Format

Share Document