6939 search results - page 548 / 1388 » Algorithm Engineering for Parallel Computation |
193
click to vote
SPAA
1996
ACM
15 years 9 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 ...
147
click to vote
IPPS
2010
IEEE
15 years 3 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...
150
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
172
click to vote
ICPP
1998
IEEE
15 years 9 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
142
click to vote
ICDCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...