The performance of multi-core real-time operating system is greatly affected by the quality of tasks scheduling algorithm. Directed acyclic graph (DAG) task model can better represent the dependency between subtasks i...
详细信息
ISBN:
(纸本)9781728165790
The performance of multi-core real-time operating system is greatly affected by the quality of tasks scheduling algorithm. Directed acyclic graph (DAG) task model can better represent the dependency between subtasks in multi-core real-time system. However, the scheduling algorithm previously applied to independent sequential tasks is no longer suitable for this kind of tasks, the efficient DAG tasks scheduling algorithm has become the current research hotspot. This paper discusses the stretching algorithm with excellent performance, and on the basis of the stretching algorithm, an improved stretching algorithm is proposed to overcome its shortcoming of ignoring dependence between subtasks. The performance optimization is verified by simulation experiments.
In this study, we introduced a new method to address the limitations of the traditional spherical harmonic (SH) analysis when reconstructing the morphology of elongated/flattened particles. The proposed method combine...
详细信息
In this study, we introduced a new method to address the limitations of the traditional spherical harmonic (SH) analysis when reconstructing the morphology of elongated/flattened particles. The proposed method combines SH analysis with a stretching algorithm (SH-stretching) to enable the reconstruction of irregular particles with arbitrary values of elongation index (EI) and flatness index (FI). Based on reconstruction of real cobble particles, the SH-stretching algorithm demonstrates superior performance in reconstructing elongated/flattened particles, and can ensure convergence. The SH-stretching algorithm is further integrated with principal component analysis (PCA) and coefficient standardization to develop a particle generation technique. This technique can strictly control the EI and FI distributions of the generated particles and is verified to be efficient in generating virtual cobble particles with realistic shape characteristics. Furthermore, the proposed technique allows the generation of particle aggregates with specified wide range distributions of EI and FI, while preserving their polydisperse characteristics.
The distribution of waiting times between time-neighbouring events for a time series obeying the Omori law is examined theoretically and numerically with the aim of understanding the characteristics of these distribut...
详细信息
The distribution of waiting times between time-neighbouring events for a time series obeying the Omori law is examined theoretically and numerically with the aim of understanding the characteristics of these distributions, how these characteristics change (e.g. scale) with the parameters of the Omori series, and thus how empirical waiting time data may be correctly interpreted. It is found that the waiting time distribution, for a single Omori aftershock sequence, consists in general of two power law segments followed by a rapid decay at larger waiting times. The analyses are illustrated using real data from the SIL network on Iceland. This data often shows characteristics predominantly consistent with the Omori law, but there are significant exceptions. We conclude that waiting time distributions and related statistical analysis has meaningful potential for the analysis of earthquake data sets, as a step towards developing physical models of the earthquake process. (c) 2006 Elsevier B.V. All rights reserved.
暂无评论