3637 search results - page 205 / 728 » On Dynamic Bit-Probe Complexity |
SRDS
2000
IEEE
15 years 3 months ago
2000
IEEE
Validation of distributed systems using fault injection is difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a gl...
RTSS
1999
IEEE
15 years 3 months ago
1999
IEEE
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...
111
click to vote
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
ICPP
1993
IEEE
15 years 2 months ago
1993
IEEE
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
105
click to vote
ICS
1993
Tsinghua U.
15 years 2 months ago
1993
Tsinghua U.
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...