Sciweavers

794 search results - page 37 / 159
» Stackelberg scheduling strategies
Sort
View
ICC
2007
IEEE
192views Communications» more  ICC 2007»
15 years 4 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
INFOCOM
2003
IEEE
15 years 3 months ago
Dynamic Load Balancing Through Coordinated Scheduling in Packet Data Systems
— Third generation code-division multiple access (CDMA) systems propose to provide packet data service through a high speed shared channel with intelligent and fast scheduling at...
Suman Das, Harish Viswanathan, Gee Rittenhouse
IPPS
2000
IEEE
15 years 2 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg
DATE
2003
IEEE
137views Hardware» more  DATE 2003»
15 years 3 months ago
Dynamic Conditional Branch Balancing during the High-Level Synthesis of Control-Intensive Designs
We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps dynamically during scheduling to conditional branche...
Sumit Gupta, Nikil D. Dutt, Rajesh K. Gupta, Alexa...
MASCOTS
2003
14 years 11 months ago
Quantifying the Properties of SRPT Scheduling
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...
Mingwei Gong, Carey L. Williamson