In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible...In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit (ERMBF) based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.展开更多
In this paper, we consider the following noncooperative elliptic systems where Ω is a bounded domain in R<sup>N</sup> with smooth boundary ∂Ω, λ,δ,γ are real parameters, and . We assume that F is subq...In this paper, we consider the following noncooperative elliptic systems where Ω is a bounded domain in R<sup>N</sup> with smooth boundary ∂Ω, λ,δ,γ are real parameters, and . We assume that F is subquadratic at zero with respect to the variables u,v. By using a variant Clark’s theorem, we obtain infinitely many nontrivial solutions (u<sub>k</sub><sub></sub>,v<sub>k</sub>) with as k → ∞. Compared with the existing literature, we do not need to assume the behavior of the nonlinearity ∇F at infinity.展开更多
基金Supported by the National Basic Reseach Program of China (973 Program 2004 CB318200)
文摘In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit (ERMBF) based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.
文摘In this paper, we consider the following noncooperative elliptic systems where Ω is a bounded domain in R<sup>N</sup> with smooth boundary ∂Ω, λ,δ,γ are real parameters, and . We assume that F is subquadratic at zero with respect to the variables u,v. By using a variant Clark’s theorem, we obtain infinitely many nontrivial solutions (u<sub>k</sub><sub></sub>,v<sub>k</sub>) with as k → ∞. Compared with the existing literature, we do not need to assume the behavior of the nonlinearity ∇F at infinity.