Sciweavers

620 search results - page 60 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
14 years 3 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
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 ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
ASAP
2008
IEEE
161views Hardware» more  ASAP 2008»
13 years 10 months ago
Configurable and scalable high throughput turbo decoder architecture for multiple 4G wireless standards
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...
Yang Sun, Yuming Zhu, Manish Goel, Joseph R. Caval...
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Robust traffic engineering: game theoretic perspective
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...
Vladimir Marbukh
JPDC
2006
85views more  JPDC 2006»
13 years 8 months ago
Provable algorithms for parallel generalized sweep scheduling
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...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
PDCN
2007
13 years 10 months ago
One-to-all personalized communication in torus networks
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 ...
Weizhen Mao, Jie Chen, William A. Watson III