ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technolo...
ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
Isosurface generation algorithms usually need a vertex-identification process since most of polygon-vertices of an isosurface are shared by several polygons. In our observation the...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Executing parallel applications across distributed networks introduces the problem of fault tolerance. A viable solution for fault tolerance must keep overhead manageable and not c...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper studies the automation of fault management of wireless and mobile networks. A network management protocol similar to SNMP with an integrated architecture using mobile ag...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Performance analysis of high performance systems is a difficult task. Current tools have proven successful in analysis tasks but their implementation is limited in several respects...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-the- y t...