208 search results - page 32 / 42 » ipps 1998 |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...