Sciweavers

3398 search results - page 54 / 680
» Implementations of Grid-Based Distributed Parallel Computing
Sort
View
103
Voted
IPPS
2006
IEEE
15 years 6 months ago
Loosely-coupled loop scheduling in computational grids
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...
IPPS
2000
IEEE
15 years 5 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
86
Voted
PDP
2002
IEEE
15 years 5 months ago
On the Impossibility of Implementing Perpetual Failure Detectors in Partially Synchronous Systems
In this paper we study the implementability of different classes of failure detectors in several models of partial synchrony. We show that no failure detector with perpetual accur...
Mikel Larrea, Antonio Fernández, Sergio Ar&...
108
Voted
ISPDC
2008
IEEE
15 years 7 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
Jonathan Widger, Daniel Grosu
ICPP
2009
IEEE
15 years 7 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu