SPAA
2003
ACM
14 years 1 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
Ï ×ØÙ Ý ÒØ Ö Ø ÔÖ Ø
Ò Ò
Ò Ò × Ò Ð Ò Ô Ö ÐÐ Ð × ×Ý×Ø Ñ׺ Ì Ö Ü ×Ø ØÛÓ Ú ÖÝ ÔÓÔÙÐ Ö ÔÔÖÓܹ Ñ Ø ÓÒ Ð ÓÖ Ø Ñ×
...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM