Sciweavers

31 search results - page 6 / 7
» On the Complexity of Scheduling Conditional Real-Time Code
Sort
View
TOG
2012
230views Communications» more  TOG 2012»
11 years 8 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
TCOM
2010
115views more  TCOM 2010»
13 years 4 months ago
QoS Analysis of a Scheduling Policy for Heterogeneous Users Employing AMC Jointly with ARQ
—This paper analyzes the quality of service (QoS) of scheduling algorithms for heterogeneous users in multiuser (MU) wireless systems that take advantage from a crosslayer design...
Mario Poggioni, Luca Rugini, Paolo Banelli
RTSS
1999
IEEE
13 years 10 months ago
Timing Anomalies in Dynamically Scheduled Microprocessors
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...
Thomas Lundqvist, Per Stenström
VTC
2006
IEEE
13 years 11 months ago
Transmitter-Based Pre-Processing for OFDM-CDMA Forward-Link Systems with Two-Dimensional Spreading
—Transmitter-based signal pre-processing is investigated for the two-dimensional (2-D) OFDM-CDMA (orthogonal frequency division multiplexing, code division multiple access) forwa...
Chih-Cheng Kuo, Wern-Ho Sheen, Chung-Ju Chang, Cha...
TWC
2008
133views more  TWC 2008»
13 years 5 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...