1620 search results - page 97 / 324 » An Annotation-Based Framework for Parallel Computing |
153
click to vote
CCO
2001
Springer
15 years 9 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...
155
click to vote
HPDC
2006
IEEE
15 years 11 months ago
2006
IEEE
Through massive parallelism, distributed systems enable the multiplication of productivity. Unfortunately, increasing the scale of available machines to users will also multiply d...
147
click to vote
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
GRM was originally designed and implemented as part of the P-GRADE graphical parallel program development environment running on supercomputers and clusters. In the framework of th...
149
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...
127
click to vote
ICA3PP
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we propose a new parallelization scheme for Simulated Annealing — Hierarchical Parallel SA (HPSA). This new scheme features coarse-granularity in parallelization, d...