Sciweavers

10805 search results - page 228 / 2161
» Mapping Computation with No Memory
Sort
View
IPPS
2010
IEEE
15 years 3 months ago
Efficient hardware support for the Partitioned Global Address Space
We present a novel architecture of a communication engine for non-coherent distributed shared memory systems. The shared memory is composed by a set of nodes exporting their memory...
Holger Fröning, Heiner Litz
VTC
2008
IEEE
236views Communications» more  VTC 2008»
16 years 29 days ago
Apriori-LLR-Threshold-Assisted K-Best Sphere Detection for MIMO Channels
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
ISSAC
2007
Springer
149views Mathematics» more  ISSAC 2007»
16 years 22 days ago
Computing numerically with functions instead of numbers
Symbolic computation with functions of a real variable suffers from combinatorial explosion of memory and computation time. The alternative chebfun system for such computations is...
Lloyd N. Trefethen
ENTCS
2002
92views more  ENTCS 2002»
15 years 6 months ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...
IPPS
1998
IEEE
15 years 11 months ago
Resource Reservation for Adaptive QOS Mapping in Real-Time Mach
In this paper, we describe an adaptive QOS mapping scheme where the QOS parameters of applications are mapped into resource requirements dynamically, and the resources for the appl...
Tatsuo Nakajima