Sciweavers

4081 search results - page 390 / 817
» Scheduling in polling systems
Sort
View
ICC
2007
IEEE
123views Communications» more  ICC 2007»
16 years 1 months ago
Channel Access Statistics of Parallel Multiuser Scheduling
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
Yao Ma, Dongbo Zhang
ICC
2007
IEEE
141views Communications» more  ICC 2007»
16 years 1 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
IPPS
2007
IEEE
16 years 1 months ago
On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids
Abstract— We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to alloca...
Claris Castillo, George N. Rouskas, Khaled Harfous...
IPPS
2007
IEEE
16 years 1 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
IPSN
2007
Springer
16 years 29 days ago
Power scheduling for wireless sensor and actuator networks
We previously presented a model for some wireless sensor and actuator network (WSAN) applications based on the vector space tools of frame theory. In this WSAN model there is a we...
Christopher J. Rozell, Don H. Johnson