2226 search results - page 365 / 446 » Fault-Tolerant Parallel Applications with Dynamic Parallel S... |
CLUSTER
2002
IEEE
14 years 9 months ago
2002
IEEE
Distributed systems based on cluster of workstation are more and more difficult to manage due to the increasing number of processors involved, and the complexity of associated appl...
SC
2004
ACM
15 years 3 months ago
2004
ACM
Programmers of message-passing codes for clusters of workstations face a daunting challenge in understanding the performance bottlenecks of their applications. This is largely due...
80
Voted
ASPLOS
2006
ACM
15 years 1 months ago
2006
ACM
Debugging data races in parallel applications is a difficult task. Error-causing data races may appear to vanish due to changes in an application's optimization level, thread...
118
click to vote
ICS
2005
Tsinghua U.
15 years 3 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
ICDCS
1991
IEEE
15 years 1 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...