Sciweavers

48 search results - page 8 / 10
» A Practical Nonblocking Queue Algorithm Using Compare-and-Sw...
Sort
View
CCR
2006
122views more  CCR 2006»
13 years 11 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
MOBIHOC
2008
ACM
14 years 10 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
INFOCOM
2009
IEEE
14 years 5 months ago
Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
Lei Ying, Sanjay Shakkottai
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 11 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
CIC
2003
150views Communications» more  CIC 2003»
14 years 7 days ago
Performance Modeling of a Cluster of Workstations
Using off-the-shelf commodity workstations to build a cluster for parallel computing has become a common practice. In studying or designing a cluster of workstations one should ha...
Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar