Sciweavers

814 search results - page 19 / 163
» Improving the execution time of global communication operati...
Sort
View
POPL
2004
ACM
14 years 8 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
IPPS
2000
IEEE
14 years 7 hour ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
LREC
2008
64views Education» more  LREC 2008»
13 years 9 months ago
The Linguistic Data Consortium Member Survey: Purpose, Execution and Results
The Linguistic Data Consortium (LDC) seeks to provide its members with quality linguistic resources and services. In order to pursue these ideals and to remain current, LDC monito...
Marian Reed, Denise DiPersio, Christopher Cieri
HPDC
1998
IEEE
13 years 12 months ago
WebOS: Operating System Services for Wide Area Applications
In this paper, we argue for the power of providing a common set of OS services to wide area applications, including mechanisms for resource discovery, a global namespace, remote p...
Amin Vahdat, Thomas E. Anderson, Michael Dahlin, E...
VLDB
1994
ACM
153views Database» more  VLDB 1994»
13 years 11 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani