3616 search results - page 84 / 724 » Conditional Memory Ordering |
155
click to vote
ENTCS
2006
15 years 4 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
327
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
The long-running nature of continuous queries poses new scalability challenges for dataflow processing. CQ systems execute pipelined dataflows that may be shared across multiple q...
120
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
The path-delay fault simulation of functional tests on complex circuits such as current processor-based systems is a daunting task. The amount of computing power and memory needed...
158
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
The goal of this research is to develop performance profiles of parallel and distributed applications in order to predict their execution time under different network conditions....
166
click to vote
CIKM
1994
Springer
15 years 8 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...