116 search results - page 5 / 24 » A practical access to the theory of parallel algorithms |
PODC
2005
ACM
14 years 29 days ago
2005
ACM
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
TEC
2002
13 years 7 months ago
2002
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...
EUROPAR
2004
Springer
14 years 23 days ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Divisible load applications consist of a load, that is input data and associated computation, that can be divided arbitrarily into independent pieces. Such applications arise in m...