Sciweavers

13752 search results - page 2331 / 2751
» Parallel and Distributed Haskells
Sort
View
DSL
1997
15 years 7 months ago
Experience with a Language for Writing Coherence Protocols
In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distrib...
Satish Chandra, James R. Larus, Michael Dahlin, Br...
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 6 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
ICIP
2005
IEEE
16 years 8 months ago
Asymmetric spread spectrum data-hiding for Laplacian host data
Spread spectrum (SS) or known-host-statistics technique has shown the best performance in terms of both rate of reliable communications and bit error probability at the low waterm...
José-Emilio Vila-Forcén, Oleksiy J. ...
HPCA
2009
IEEE
16 years 6 months ago
Elastic-buffer flow control for on-chip networks
This paper presents elastic buffers (EBs), an efficient flow-control scheme that uses the storage already present in pipelined channels in place of explicit input virtualchannel b...
George Michelogiannakis, James D. Balfour, William...
HPCA
2004
IEEE
16 years 6 months ago
Using Prime Numbers for Cache Indexing to Eliminate Conflict Misses
Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the ca...
Mazen Kharbutli, Keith Irwin, Yan Solihin, Jaejin ...
« Prev « First page 2331 / 2751 Last » Next »