Using a queuing approach to describe a shared memory parallel computer system, it can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive models to evaluate the ...

Most approaches to formal protocol verification rely on an operational model based on traces of atomic actions. Modulo CSP, CCS, state-exploration, Higher Order Logic or strand spaces frills, authentication or secrecy are analyzed by looking at the existence or the absence of traces with a suitable property. We introduced an alternative operational approach based on parallel actions and an expl...

Introduction: Over recent years, various programs have been conducted to reduce noise, indicating the increasing concerns of society over noise pollution. This study has been performed to enhance the performance of parallel barriers on two sides of a highway considering the surrounding buildings. Material and Methods: The 2D boundary element simulation method was employed to predict the noise ...

Bandwidth-latency models are a group of performance models for parallel programs that focus on modeling the communication between the processes in terms of network bandwidth and latency, allowing quite precise performance estimations. While originally developed for distributed-memory architectures, these models also apply to machines with non-uniform memory access (NUMA), like the modern multi-...

A 2D analytical method for magnetic vector potential calculation in inner rotor surface mounted and surface inset permanent magnet machines considering slotting effects, magnetization orientation and winding layout has been proposed in this paper. The analytical method is based on the resolution of Laplace and Poisson equations as well as Maxwell equation in quasi- Cartesian coordinate by using...

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

Briefing: The rapid advancement of fundamental theories and computing capacity has brought artificial intelligence, internet things, extended reality, many other new intelligent technologies into our daily lives. Due to the lack interpretability reliability guarantees, it is extremely challenging apply these directly real-world industrial systems. Here we present a paradigm for establishing par...