4463 search results - page 260 / 893 » computing 2000 |
141
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Lee distance Gray codes for -ary Ò-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamilto...
147
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
133
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...