2432 search results - page 230 / 487 » Using simple abstraction to reinvent computing for paralleli... |
150
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put em...
145
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
162
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Optimistic replication is a fundamental technique for supporting collaborative work practices in mobile environments. However, eventual consistency, in contrast to immedi...
186
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
130
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Multicore shared-memory architectures are becoming prevalent but bring many programming challenges. Among the biggest is non-determinism: the output of the program does n...