2183 search results - page 292 / 437 » Generating Parallel Algorithms for Cluster and Grid Computin... |
ICDCN
2009
Springer
15 years 2 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
TPDS
2002
14 years 9 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
EUROPAR
2003
Springer
15 years 3 months ago
2003
Springer
We consider the use of a cluster of PC servers for Application Service Providers where applications and databases must remain autonomous. We use data replication to improve data av...
103
click to vote
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...