• No results found

parallel computing and algorithms

Parallel Computing of Particle Filtering Algorithms for Target Tracking Applications

Parallel Computing of Particle Filtering Algorithms for Target Tracking Applications

... (P&D) computing is a promising way to deal with the computa- tional challenges of PF ...PF algorithms for target tracking, and thereby bring them closer to practical ...of parallel PF algo- ...

115

Types of Scheduling Algorithms in Parallel Computing

Types of Scheduling Algorithms in Parallel Computing

... Symmetric Multi-processing (SMP), Massively Parallel Processing (MPP) units, Cluster computing and Non Uniform Memory Access (NUMA) are the. Symmetric Multi-Processor is a computer architecture in which ...

6

Load Balancing & Task Scheduling Algorithms in Parallel Computing Environment: A Review

Load Balancing & Task Scheduling Algorithms in Parallel Computing Environment: A Review

... 1687 | P a g e response time is presented in this paper [12]. Three kinds of loads that are I/O, CPU, MEMORY are considered here. In this, Authors thought of a heterogeneous system with cluster computing platform ...

13

Structural optimization: an approach based on genetic algorithms and parallel computing

Structural optimization: an approach based on genetic algorithms and parallel computing

... which parallel computing has been considered a very im- portant computer research subject, the long awaited breakthrough towards mainstream computing has delayed and has not yet completely ...that ...

170

Energy  performance of parallel sort algorithms

Energy performance of parallel sort algorithms

... the parallel sor- ting methods, a classic fast sorting algorithm, a tri- geminal heap algorithm, and a non-recursive merge sorting algorithm were ...[3]. Parallel computing issues and their use are ...

12

Parallel Algorithms for Unsupervised Tagging

Parallel Algorithms for Unsupervised Tagging

... We extend the method and show how to ef- ficiently parallelize the algorithm on modern parallel computing platforms while preserving approximation guarantees. The new method easily scales to large data and ...

14

Decomposition Models of Parallel Algorithms

Decomposition Models of Parallel Algorithms

... chosen parallel algorithms (numerical integration, matrix multiplication) we have been demonstrated great influence of selection of decomposition model to their potential ...dominant parallel ...

15

Parallel Performance of Domain Decomposition Method on Distributed Computing Environment

Parallel Performance of Domain Decomposition Method on Distributed Computing Environment

... time. Parallel computing can meet requirements of high performance computation ...various parallel computing algorithms, Domain Decomposition Method (DDM) has become much popularity in ...

7

High Performance Parallel Computing in Residue Number System

High Performance Parallel Computing in Residue Number System

... One example of non-modular operations is magnitude comparison of numbers. Obviously, non-positional nature of RNS does not allow to determine which number is less or larger from its representation. Algorithms that ...

6

A Comparison and Feasible Solution for Security Issues on Cloud Computing Environment

A Comparison and Feasible Solution for Security Issues on Cloud Computing Environment

... these algorithms are implemented on the single processor system but because of the availability of the fast and parallel computing resources, the better encryption and decryption techniques can be ...

7

Parallel computing for passage retrieval

Parallel computing for passage retrieval

... With respect to retrieval effectiveness, the passage retrieval algorithms do bring benefits on web data over ordinary term weighting but such is not guaranteed. However it is clear from the above that the ...

16

Survey of Parallel Computing with MATLAB

Survey of Parallel Computing with MATLAB

... a parallel computing like use shared or distributed ...make parallel Matlab in ...available parallel computers from ...applied parallel Matlab on a shared memory ...in parallel ...

24

PARALLEL COMPUTING USE AND THEIR APPLICATION

PARALLEL COMPUTING USE AND THEIR APPLICATION

... It is expected to lead to other major changes in the industry. Major companies like INTEL Corp and Advanced Micro Devices Inc has already integrated four processors in a single chip. Parallel computing may ...

5

¿Es adecuada la fuente de información disponible para los estudiantes en computación y áreas afines en México?

¿Es adecuada la fuente de información disponible para los estudiantes en computación y áreas afines en México?

... The International Journal of Grid Computing: Theory, Methods and Applications 31.. Parallel Computing 32.[r] ...

14

Scalable Parallel Computing on Clouds

Scalable Parallel Computing on Clouds

... Broadcast Data • Loop invariant data static data – traditional MR key-value pairs – Comparatively larger sized data – Cached between iterations • Loop variant data dynamic data – broadca[r] ...

28

Scalable Parallel Computing on Clouds

Scalable Parallel Computing on Clouds

... Contributions • Highly available, scalable decentralized iterative MapReduce architecture on eventual consistent services • More natural Iterative programming model extensions to MapRedu[r] ...

62

Current Trends in Parallel Computing

Current Trends in Parallel Computing

... Shared Memory Parallel Computing Models In shared memory architecture a number of processors are connected to a common central memory.. Since all processors are sharing a single address [r] ...

7

 An Adjacent Analysis of the Parallel Programming Model Perspective: A Survey

 An Adjacent Analysis of the Parallel Programming Model Perspective: A Survey

... Every parallel computational techniques or models are built upon two major components such as deployed parallel programming framework or model and the associated cost ...the parallel programming ...

11

Round compression for parallel matching algorithms

Round compression for parallel matching algorithms

... ) parallel rounds in O(n) space per machine? The main result of this paper is an affirmative answer to that ...2 parallel MPC ...of parallel rounds increasing by a factor of O (log(1/ ϵ ...provide ...

15

Round compression for parallel matching algorithms

Round compression for parallel matching algorithms

... In particular, using this technique, they have obtained an algorithm that can compute a 2-approximation to maximum matching in O1/δ MPC rounds, provided S, the space per machine, is sign[r] ...

46

Show all 10000 documents...

Related subjects