1405 search results - page 178 / 281 » Popularity at Minimum Cost |
114
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
High-end supercomputers are increasingly built out of commodity components, and lack tight integration between the processor and network. This often results in inefficiencies in ...
154
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
150
click to vote
SC
2003
ACM
15 years 9 months ago
2003
ACM
This paper presents a compiler analysis for data communication for the purpose of transforming ordinary programs into ones that run on distributed systems. Such transformations ha...
127
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
135
click to vote
ACSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a l...