2814 search results - page 309 / 563 » Competitive Analysis of Distributed Algorithms |
88
Voted
SPAA
2003
ACM
15 years 5 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...
102
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
113
Voted
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
104
Voted
AIPS
1994
15 years 1 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
94
Voted
JAL
2002
15 years 4 days ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...