Sciweavers

618 search results - page 121 / 124
» Reducibility and TT-Lifting for Computation Types
Sort
View
CCS
2008
ACM
13 years 10 months ago
Efficiently tracking application interactions using lightweight virtualization
In this paper, we propose a general-purpose framework that harnesses the power of lightweight virtualization to track applications interactions in a scalable an efficient manner. ...
Yih Huang, Angelos Stavrou, Anup K. Ghosh, Sushil ...
ISCA
2010
IEEE
222views Hardware» more  ISCA 2010»
13 years 10 months ago
Cohesion: a hybrid memory model for accelerators
Two broad classes of memory models are available today: models with hardware cache coherence, used in conventional chip multiprocessors, and models that rely upon software to mana...
John H. Kelm, Daniel R. Johnson, William Tuohy, St...
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
SIMVIS
2007
13 years 10 months ago
Chances and Limits of Progression in Visualization
The amount of data to be represented by visualization systems requires new ideas for data processing and representation. As proposed in this contribution, this might be solved by ...
René Rosenbaum, Heidrun Schumann
DSL
1997
13 years 10 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...