2799 search results - page 392 / 560 » computing 1998 |
146
click to vote
IEEEPACT
1998
IEEE
15 years 9 months ago
1998
IEEE
Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However, certain branches are difficult to predic...
139
click to vote
IEEEPACT
1998
IEEE
15 years 9 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
111
Voted
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
127
click to vote
IPPS
1998
IEEE
15 years 9 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...
149
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
- Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use spacesharing processor s...