Sciweavers

1502 search results - page 139 / 301
» Node weighted scheduling
Sort
View
113
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
Paolo Giaccone, Balaji Prabhakar, Devavrat Shah
140
Voted
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
15 years 7 months ago
Bid based scheduler with backfilling for a multiprocessor system
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
Inbal Yahav, Louiqa Raschid, Henrique Andrade
TASE
2008
IEEE
15 years 3 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
125
Voted
TSP
2012
13 years 11 months ago
On the Rate Gap Between Multi- and Single-Cell Processing Under Opportunistic Scheduling
—Base station (BS) coordination is a key technique to handle intercell interference (ICI) in cellular networks. Nevertheless, recent work on scheduling indicates that the value o...
Hans Jørgen Bang, David Gesbert, Pål ...
152
Voted
ICC
2007
IEEE
15 years 10 months ago
Utility Maximization for OFDMA Systems Over Discrete Sets
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
Chan Zhou, Gerhard Wunder, Thomas Michel