620 search results - page 60 / 124 » Optimizing the BSD routing system for parallel processing |
137
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
145
click to vote
ASAP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose a novel multi-code turbo decoder architecture for 4G wireless systems. To support various 4G standards, a configurable multi-mode MAP (maximum a posterio...
150
click to vote
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
113
click to vote
JPDC
2006
15 years 4 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
117
click to vote
PDCN
2007
15 years 5 months ago
2007
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...