Sciweavers

548 search results - page 49 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
POPL
1998
ACM
15 years 6 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
ASAP
2006
IEEE
97views Hardware» more  ASAP 2006»
15 years 8 months ago
Dynamic-SIMD for lens distortion compensation
An increasing computational demand is placed on the image processing capacity of current and future smart cameras. SIMD processor architectures provide an efficient solution becau...
Bart Mesman, Hamed Fatemi, Henk Corporaal, Twan Ba...
114
Voted
SCCC
2005
IEEE
15 years 7 months ago
Balancing active objects on a peer to peer infrastructure
We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target on peer to peer systems and its capability to di...
Javier Bustos-Jiménez, Denis Caromel, Alexa...
IPPS
1999
IEEE
15 years 6 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
HPDC
2005
IEEE
15 years 7 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...