1185 search results - page 108 / 237 » An Improved Parallel Thinning Algorithm |
PARA
2000
Springer
15 years 1 months ago
2000
Springer
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
138
click to vote
ISCA
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
106
click to vote
CLUSTER
2001
IEEE
15 years 1 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
JCC
2008
14 years 10 months ago
2008
: Quantum Monte Carlo (QMC) calculations require the generation of random electronic configurations with respect to a desired probability density, usually the square of the magnitu...