• No results found

global memory

An Efficient Global Memory Addressing Technique for Beowulf Clusters Applied to Meshless Solutions of Maxwell’s Equations in Time Domain

An Efficient Global Memory Addressing Technique for Beowulf Clusters Applied to Meshless Solutions of Maxwell’s Equations in Time Domain

... own memory, reducing the total time of ...extra memory in each host, aiming at cloning data of nodes close to the borders, which are originally stored in neighbor ...extra memory, named as cache, do ...

9

Investigating working memory and metamemory in old age : a thesis presented in partial fulfilment of the requirements for the degree of Master of Arts in Psychology at Massey University

Investigating working memory and metamemory in old age : a thesis presented in partial fulfilment of the requirements for the degree of Master of Arts in Psychology at Massey University

... Performance predictions are based on an individual's specific belief about his or her own memory ability in familiar situations and also on a global memory self-efficacy belief In making[r] ...

115

Optimal Execution Cost of Distributed System: Through Clustering

Optimal Execution Cost of Distributed System: Through Clustering

... goto Step-5.1.2.. The processors only have local memory and do not share any global memory. The processor connections graph is a depicted in figure-1 and tasks execution graph also pict[r] ...

9

GPU implementation of partial order reduction

GPU implementation of partial order reduction

... CADP is run on an Intel Core i5 3350P with 8GB of RAM. For reference, we also include the original results of GPUexplore from [42], that were obtained with a NVIDIA K20m (released in 2012). This GPU has 13 SMs and 5GB of ...

55

Presentation of a Parallel Algorithm for Nearest Neighbor Search on GPU Using CUDA
                 

Presentation of a Parallel Algorithm for Nearest Neighbor Search on GPU Using CUDA  

... As seen in figure 5, Suggested method for large amount of data in comparing to another methods has much higher efficient in terms of time complexity. Parallelism method by CUDA on the graphics processing unit, in the ...

5

GPU-Accelerated Hypothesis Cover Set Testing for Learning in Logic

GPU-Accelerated Hypothesis Cover Set Testing for Learning in Logic

... A GPU can manipulate matrices very efficiently. Here this is first used to show how to speed up the calculation of the cover set of propositional hypotheses. We adopt the terminology used in Description Logic, and talk ...

16

Learning Personalized End-to-End Goal-Oriented Dialog

Learning Personalized End-to-End Goal-Oriented Dialog

... the memory (at top-left) to find relevant history and produce attention ...is Global Memory: this component (at bottom-left) has an identical structure as the original M EM N2N, but it contains ...

8

Parallel Algorithm of IDCT with GPUs and CUDA for Large-scale Video Quality of 3G

Parallel Algorithm of IDCT with GPUs and CUDA for Large-scale Video Quality of 3G

... We have described our data-parallel algorithms and CUDA implementations of inverse discrete cosine transform in the video evaluating projection. The uberkernel algorithm is optimal solution for the medium- sized tasks. ...

7

Efficient Parallel CKY Parsing on GPUs

Efficient Parallel CKY Parsing on GPUs

... shared memory because there are only about 1000 unique symbols in our grammar and the sentence lengths are bounded, whereas the scores array can only reside in global mem- ...a global memory ...

11

Architectural Considerations for Compiler-guided Unroll-and-Jam of CUDA Kernels

Architectural Considerations for Compiler-guided Unroll-and-Jam of CUDA Kernels

... hide memory latency, and use local memory to alleviate pressure on global memory ...good memory performance over CPU-based ...different memory levels of GPU memory and ...

9

Two-fluid compressible simulations on GPU cluster

Two-fluid compressible simulations on GPU cluster

... a global memory (≈ 1 GB) and compute units (≈ ...cache memory (≈16 ...the global memory but have only access to the local memory of their compute ...the global ...

10

Parameter Identification Based on a Modified PSO Applied to Suspension System

Parameter Identification Based on a Modified PSO Applied to Suspension System

... In this paper, the MPSO is compared to GA and BPSO in offline parameter identification of suspension system. It can be shown that the MPSO has a better performance than the aforementioned algorithms in solving the pa- ...

9

FPGA-Based Acceleration of Expectation Maximization Algorithm using High Level Synthesis

FPGA-Based Acceleration of Expectation Maximization Algorithm using High Level Synthesis

... A sequential version of EM-GMM algorithm was implemented in CPU to ensure the accuracy of EM-GMM algorithm running on FPGA based accelerators. This implementation was done after FPGA implementation to generate reference ...

95

Distributed shared memory architectures and global performance state estimation

Distributed shared memory architectures and global performance state estimation

... buses. Memory references made by one of these nodes into its own PCI address space are translated into an SCI transaction and transported to the correct remote ...a memory access, thus providing a hardware ...

199

Global existence and blow up of solutions for a nonlinear wave equation with memory

Global existence and blow up of solutions for a nonlinear wave equation with memory

... with initial conditions and Dirichlet boundary conditions. We first prove a local existence theorem and show, for some appropriate assumption on g and the initial data, that this solution is global with energy ...

27

Strong global attractors for nonclassical diffusion equation with fading memory

Strong global attractors for nonclassical diffusion equation with fading memory

... The long-time dynamical behaviors of the solutions to Eq. (.) have received consid- erable attention and have been studied by many researchers for both autonomous and non-autonomous dynamical systems (see [–] and the ...

14

Cognitive function in the prefrailty and frailty syndrome

Cognitive function in the prefrailty and frailty syndrome

... Finally, the score for each cognitive domain was regressed on the five individual frailty indicators simulta- neously after adjusting for all covariates, with the cut off for statistical significance of P < .008 used ...

7

Diagnostic accuracy of the Eurotest for dementia: a naturalistic, multicenter phase II study

Diagnostic accuracy of the Eurotest for dementia: a naturalistic, multicenter phase II study

... the Memory Impairment Screen (MIS) [8], the Seven Minute Screen (7 MS) [9], the Clock-drawing Test (CDT) [10], the Time and Change test (T&C) [11], or the Short Test of Mental Status (STMS) [12] are the ...

10

International Journal of Emerging Technology and Advanced Engineering

International Journal of Emerging Technology and Advanced Engineering

... The end result is the swarm converging prematurely to a local optimum. If the new position of the particle is pretty far from global best and local best, then the velocity will be changing quickly turning into a ...

6

The Nonexistence of Global Solutions for a Time Fractional Schrödinger Equation with Nonlinear Memory

The Nonexistence of Global Solutions for a Time Fractional Schrödinger Equation with Nonlinear Memory

... In [13], Cazenave, Dickstein and Weissler considered a class of heat equation with nonlinear memory. They obtained that the solution blows up in finite time and under suitable conditions the solution exists ...

7

Show all 10000 documents...

Related subjects