Sentence examples for memory machines and from inspiring English sources

Its implementation is straightforward, especially in the case of shared memory machines, and produces significant speedup; about three times on a standard quad core desktop computer and about seven times on a octa core shared memory cluster.

This parallel code utilizes D3 with a message passing interface (MPI) in order to permit efficient implementation on clusters of distributed memory machines and may also simultaneously exploit threading for multiprocessing shared address space architectures.

They were a well-oiled Mongolian memory machine, and they meant business.

The initial implementation of FDTD on Cell BE with 8 SPEs is 2.9 times faster than an eight node shared memory machine and 1.45 times faster than an eight node distributed memory machine.

At the Rackspace website c we might select either a 1GB or 2GB memory machine, and we need to be able to map from "Moderate" to an average for the now separated Incoming and Outgoing bandwidth – difficult to do already if we don't have an available definition of Moderate with respect to I/O, and also if we're unclear about how this might meet our likely data requirements in either direction.

The implementation supports parallelization, scaling to any number of processors on a shared memory machine and memory mapping of intermediate files, allowing for efficient usage of memory and improved speed.

Taxonomic classification of the previously published 150 giga-base Tyrolean Iceman dataset was found to take <20 h on a single node 40 core large memory machine and provide new insights on the metagenomic contents of the sample.

We show significant speedups over existing parallel linear algebra libraries both on a 32-core shared-memory machine and on a distributed-memory supercomputer.

The fifth paper of this issue: Efficient Breadth-First Search on Massively Parallel and Distributed Memory Machines by Koji Ueno, Toyotaro Suzumura, Naoya Maruyama, Katsuki Fujisawa, and Satoshi Matsuoka, focuses on one of the most fundamental graph algorithm breadth-first search (BFS) and discusses new methods to compute BFS for graphs with one trillion vertices using supercomputers.

After addressing the memory machine design and characteristics analysis by using finite element method, this paper presents the detailed implementation and control principle of the constant-voltage power generation system.

SLI has funded research on a variety of topics including language, literacy, memory, machine learning, and rehabilitation.