Sciweavers

1095 search results - page 45 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
DAC
1998
ACM
15 years 8 months ago
Efficient Analog Test Methodology Based on Adaptive Algorithms
This papers describes a new, fast and economical methodology to test linear analog circuits based on adaptive algorithms. To the authors knowledge, this is the first time such tec...
Luigi Carro, Marcelo Negreiros
CIKM
2001
Springer
15 years 8 months ago
A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data disse...
Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen
ECRTS
2005
IEEE
15 years 9 months ago
Energy Aware Non-Preemptive Scheduling for Hard Real-Time Systems
Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Non-preemptive scheduling becomes an integral part of syste...
Ravindra Jejurikar, Rajesh K. Gupta
IJHPCA
2006
96views more  IJHPCA 2006»
15 years 4 months ago
On the User - Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheduling outcome from both parties' perspectives. In a grid or sta...
Cynthia Bailey Lee, Allan Snavely
TON
2008
69views more  TON 2008»
15 years 4 months ago
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
Michael J. Neely