Virtualization is an essential mechanism in fog computing that enables elasticity and isolation, which in turn helps achieve resource efficiency. To bring high flexibility in a fog environment, migration of virtual machines from one node to another is required. This can be achieved by live virtual machine migration to …
Network-on-chip (NoC) multi-core architectures with a large number of processing elements are becoming a reality with the recent developments in technology. In these modern systems the processing elements are interconnected with regular NoC topologies such as meshes and tori. In this paper we propose a parallel Gauss-S …
In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDS …
This paper is a review of Oman's major Health Information Systems (HISs) and their enabling technologies. The work assesses the scope, functionality, security, and interoperability of the used systems. The review aids in achieving the objectives of HIS systems of improving the global quality of health care, attaining i …
We obtain the conditional fault diameter of the k-ary n-cube interconnection network. It has been previously shown that under the condition of forbidden faulty sets (i.e. assuming each non-faulty node has at least one non-faulty neighbor), the k-ary n-cube, whose connectivity is 2n, can tolerate up to 4n-3 faulty nodes …
We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition, the square torus, whose connectivity is 4, can tolerate up to 5 faulty …
We propose Colored Petri Net (CPN) models for replicated and centralized database systems and conduct a comparative study of their performance. The designed CPN models capture the dynamics of the studied database systems and estimate their expected performance with an appropriate level of abstraction. A number of simul …
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths in the factor graphs. Then we apply the general result to build a comp …