3616 search results - page 134 / 724 » Conditional Memory Ordering |
169
click to vote
HPCA
1998
IEEE
15 years 9 months ago
1998
IEEE
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
137
Voted
INFOCOM
1998
IEEE
15 years 9 months ago
1998
IEEE
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
127
click to vote
VISUALIZATION
1998
IEEE
15 years 9 months ago
1998
IEEE
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
134
click to vote
KDD
1998
ACM
15 years 9 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
163
click to vote
ISPAN
1997
IEEE
15 years 9 months ago
1997
IEEE
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...