This work evaluates the runtime performance of a single-mode biometric recognition system for fingerprint-based access control to secure premises. To speed up computation time in this system, we resorted parallel programming, targeting more loops verification module. Our approach would therefore be parallelize all that are computationally intensive during fingerprints database. On this, exploit...

In this paper the relationship between evolution and entropy is described for a model of self-reproducing parallel computation. As was recently shown [5], the performance of some types of parallel computation can be increased though a process analogous to evolution by natural selection. The work discussed in this paper explores the process by which evolution manipulates the entropy of instructi...

Parallel computation fortwo-dimensionat co)wective flows in cavities with adiabatic horizontal boundaries and driven by differential heating of the two vertical end walk, are investigated using the Intel Paragon, Intel Touchstone Delta, and Cray 13D. I’he numerical scheme, including a parallel multigrid solver, and domain decomposition techniques for parallel computing are discussed in detail. ...

Multicore processors are becoming increasingly prevalent, blurring the lines between traditional parallel programs, which use cooperative threading to reduce execution time, and interactive programs which use competitive threading to increase responsiveness. To assist programmers in developing this new class of responsive parallel programs which use threads for both of these purposes, I propose...

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD comput...

There are many variations of the basic parallel random access machine (PRAM), which includes an arbitrary number of processors sharing an arbitrary amount of random access memory. An exclusive-read, exclusive-write PRAM (EREW PRAM) does not allow any concurrent memory accesses (so all concurrent memory accesses must be explicitly serialized in the program). An EREW PRAM is useful because any al...

There is a growing interest in heterogeneous high performance computing environments. These systems are diicult to program owing to the complexity of choosing the appropriate resource allocations and the diiculties in expressing these choices in traditional parallel languages. In this paper we propose a methodology for structured parallel programming using functional skeletons to express these ...

We propose efficient parallel algorithms and implementations on shared memory architectures of LU factorization over a finite field. Compared to the corresponding numerical routines, we have identified three main difficulties specific to linear algebra over finite fields. First, the arithmetic complexity could be dominated by modular reductions. Therefore, it is mandatory to delay as much as po...

In this paper, we propose a method to compute, in parallel, the homology groups of closed meshes (i.e., orientable 2D manifolds without boundary) represented by combinatorial maps. Our experiments illustrate the interest of our approach which is really fast on big meshes and which obtains good speed-up when increasing the number of threads.