A Time-Stepping Algorithm for Parallel Computers

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

Time parallel kinetic-molecular interaction algorithm for CPU/GPU computers

A parallel-in-time, multiscale interaction procedure is introduced for systems described at molecular scales by time-dependent random variables that obey Langevin dynamics. At larger, kinetic scales, the system is described by a probability distribution function that obeys an associated Fokker-Planck equation. It is assumed that the main quantity of interest is the kinetic-scale probability dis...

Time Skewing for Parallel Computers

A parallel nearly implicit time-stepping scheme†

Across-the-space parallelism still remains the most mature, convenient and natural way to parallelize large scale problems. One of the major problems here is that implicit time stepping is often difficult to parallelize due to the structure of the system. Approximate implicit schemes have been suggested to circumvent the problem [5]. These schemes have attractive stability properties and they a...

A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers

In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be reco...