11 search results - page 2 / 3 » ispdc 2008 |
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Identifying and inferring performances of a network topology is a well known problem. Achieving this by using only end-to-end measurements at the application level is a method kno...
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
In this work we present the runtime architecture of the OMPi OpenMP compiler. OMPi is a source-to-source C translator featuring a portable, modular and extensible runtime system. ...