3958 search results - page 481 / 792 » Dynamic Graph Algorithms with Applications |
187
Voted
MICRO
2007
IEEE
16 years 28 days ago
2007
IEEE
Modern chip multiprocessors (CMPs) are designed to exploit both instruction-level parallelism (ILP) within processors and thread-level parallelism (TLP) within and across processo...
183
click to vote
ISCA
2005
IEEE
16 years 7 days ago
2005
IEEE
Instruction set customization is an effective way to improve processor performance. Critical portions of application dataflow graphs are collapsed for accelerated execution on s...
186
click to vote
HICSS
2000
IEEE
15 years 11 months ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
162
click to vote
HICSS
1997
IEEE
15 years 11 months ago
1997
IEEE
One model of multithreading gaining popularity on multiprocessor systems is the message-driven model of computation. The message-driven model is a reactive model in which an arriv...
174
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...