Sciweavers

489 search results - page 79 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
HPDC
2009
IEEE
15 years 5 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
HPCA
2007
IEEE
15 years 10 months ago
Extending Multicore Architectures to Exploit Hybrid Parallelism in Single-thread Applications
Chip multiprocessors with multiple simpler cores are gaining popularity because they have the potential to drive future performance gains without exacerbating the problems of powe...
Hongtao Zhong, Steven A. Lieberman, Scott A. Mahlk...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 4 months ago
Narrowband Interference Mitigation in Turbo-Coded OFDM Systems
— A method for the mitigation of the effect of narrowband interference (NBI) on the turbo decoder in OFDM systems is proposed. The presence of NBI leads to a contaminated Gaussia...
Sheetal Kalyani, Vimal Raj, Krishnamurthy Giridhar
HIPEAC
2007
Springer
15 years 4 months ago
A Throughput-Driven Task Creation and Mapping for Network Processors
Abstract. Network processors are programmable devices that can process packets at a high speed. A network processor is typified by multithreading and heterogeneous multiprocessing...
Lixia Liu, Xiao-Feng Li, Michael K. Chen, Roy Dz-C...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 5 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking