Introduction: The aim of present study was to investigate the effects of royal jelly (RJ) on the number of Nissl-stained neurons in caudate putamen unit (CPU) and substantia nigra pars compacta (SNC) and the thickness of gray (TGm) and white matter (TWm) of cerebral and cerebellar cortex in male rats with Parkinson’s disease (PD). Methods: Seventy five Sprague-Dawley adults’ male ra...

Performance of a Java Virtual Machine (JVM) is quantified in terms of the JVM’s relative CPU availability at executing concurrent Java threads. The total CPU loading of a JVM is defined by the sum of the CPU utilization factors of all threads executing on the JVM. Sharp performance degradation has been observed while JVM executes concurrent threads with exactly same CPU load. An analytical mode...

In autonomous navigation technologies, the Multi-State Constraint Kalman Filter (MSCKF) is one of most accurate and robust tightly-coupled fusion frameworks for Visual-Inertial Navigation (VIN). However, adoption MSCKF VIN system in real-time embedded applications depends heavily on an efficient implementation its tangled pipeline. This work initially proposes a novel parallel multi-thread pipe...

Among several techniques available for solving Computational Electromagnetics (CEM) problems, the Finite Difference Time Domain (FDTD) method is one of the best suited approaches when a parallelized hardware platform is used. In this paper we investigate the feasibility of implementing the FDTD method using the NVIDIA® GT 520, a low cost Graphical Processing Unit (GPU), for solving the differen...

Extensive use of multi-threaded applications that run on SMP machines, justifies modifications in thread scheduling algorithms to consider threads’ characteristics in order to improve performance. Current schedulers (e.g. in Linux, AIX) avoid migrating tasks between CPUs unless absolutely necessary. Unwarranted data cache misses occur when tasks that share data run on different CPUs, or are far...

Accelerating Cardiac MRI Compressed Sensing Image Reconstruction using Graphics Processing Units by Majid Sabbagh Master of Science in Electrical and Computer Engineering Northeastern University, April 2016 Prof. Miriam Leeser, Advisor Prof. Mehdi H. Moghari, Co-Advisor Cardiac magnetic resonance imaging (MRI) has become a crucial part of monitoring patients with congenital heart diseases. An i...

With the continuous increase of processing power, the graphic hardware – also called Graphic Processor Unit (GPU) – is naturally assuming most part of the rendering pipeline, leaving the Central Processor Unit (CPU) with more idle time. In order to take advantage of this when rendering relief textures, the present work proposes two approaches for the mapping of relief textures. Both methods are...

719 the number of groups used is equal to 2°Rtn(tx. The time complexity of this algorithm is OCNlgN) because: Step 1 needs O(N1gN) time; Step 2 is a linear time labeling, and needs O(lg2N) time; Steps 3 and 4 need O(n) = O(lgN) to compute the group number for each row, and there are N rows. This time complexity is optimal when k = O(n) because there are kN = O(nN) = O(N1gN) binary variables to ...

In this paper we show that partitioning data cache into array and scalar caches can improve cache access pattern without having to remap data, while maintaining the constant access time of a direct-mapped cache and improving the performance of L-1 cache memories. By using 4 central moments (mean, standard-deviation, skewness and kurtosis) we report on the frequency of accesses to cache sets and...