Sciweavers

3934 search results - page 5 / 787
» Approximate Schedulability Analysis
Sort
View
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
13 years 2 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...
ICC
2007
IEEE
213views Communications» more  ICC 2007»
14 years 1 months ago
On the Achievable Throughput of MIMO Broadcast Channels with Finite Rate Feedback
Abstract— We consider multiuser scheduling with limited feedback of partial channel state information in MIMO broadcast channels. By using spatial multiplexing at the base statio...
Wei Zhang, Khaled Ben Letaief
ECRTS
2008
IEEE
14 years 1 months ago
Practical Schedulability Analysis for Generalized Sporadic Tasks in Distributed Real-Time Systems
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fi...
Yuanfang Zhang, Donald K. Krecker, Christopher D. ...
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...