6897 search results - page 610 / 1380 » Parallelization of Modular Algorithms |
213
click to vote
SPAA
1996
ACM
15 years 10 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
156
Voted
PARA
2000
Springer
15 years 10 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...
154
click to vote
JNCA
2008
15 years 6 months ago
2008
Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the ef...
185
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
216
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...