Sciweavers

554 search results - page 94 / 111
» Approximability of OFDMA Scheduling
Sort
View
INFOCOM
1998
IEEE
15 years 1 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
DAC
1998
ACM
15 years 1 months ago
A Tool for Performance Estimation of Networked Embedded End-systems
Networked embedded systems are expected to support adaptive streaming audio/video applications with soft real-time constraints. These systems can be designed in a cost efficient ...
Asawaree Kalavade, Pratyush Moghé
CF
2005
ACM
14 years 11 months ago
An efficient wakeup design for energy reduction in high-performance superscalar processors
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
Kuo-Su Hsiao, Chung-Ho Chen
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 9 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
TC
2008
14 years 9 months ago
An Energy-Delay Tunable Task Allocation Strategy for Collaborative Applications in Networked Embedded Systems
Collaborative applications with energy and low-delay constraints are emerging in various networked embedded systems like wireless sensor networks and multimedia terminals. Conventi...
Tao Xie 0004, Xiao Qin