Sciweavers

472 search results - page 39 / 95
» Quick-release Fair Scheduling
Sort
View
VTC
2008
IEEE
156views Communications» more  VTC 2008»
14 years 3 months ago
Channel Asymmetry and Random Time Slot Hopping in OFDMA-TDD Cellular Networks
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
Ellina Foutekova, Patrick Agyapong, Harald Haas
ICC
2009
IEEE
128views Communications» more  ICC 2009»
14 years 3 months ago
Approximate Flow-Aware Networking
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
Jerzy Domzal, Andrzej Jajszczyk
INFOCOM
2007
IEEE
14 years 3 months ago
Bandwidth Balancing in Multi-Channel IEEE 802.16 Wireless Mesh Networks
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
Claudio Cicconetti, Ian F. Akyildiz, Luciano Lenzi...
RTSS
2006
IEEE
14 years 2 months ago
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
HPDC
2005
IEEE
14 years 2 months ago
A new metric for robustness with application to job scheduling
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
Darin England, Jon B. Weissman, Jayashree Sadagopa...