Sciweavers

7065 search results - page 11 / 1413
» Iterative Scheduling Algorithms
Sort
View
EOR
2007
174views more  EOR 2007»
13 years 9 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
JPDC
2006
146views more  JPDC 2006»
13 years 9 months ago
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate mapping scheme for matching and scheduling...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
INFOCOM
2010
IEEE
13 years 8 months ago
Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
AINA
2005
IEEE
14 years 3 months ago
3D-VOQ Switch Design and Evaluation
Input Buffered Switches with Virtual Output Queues(VOQ) design to avoid Head-Of-Line problems, is a primary design of switches that can be scalable to very high speeds. However, t...
Ding-Jyh Tsaur, Xian-Yang Lu, Chin-Chi Wu, Woei Li...
TON
2010
162views more  TON 2010»
13 years 4 months ago
Fast Algorithms for Resource Allocation in Wireless Cellular Networks
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
Ritesh Madan, Stephen P. Boyd, Sanjay Lall