1022 search results - page 148 / 205 » Automatic data and computation decomposition on distributed ... |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams wher...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
HPDC
1999
IEEE
13 years 12 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...