Sciweavers

1316 search results - page 111 / 264
» A New Scheduling Algorithm for Servers
Sort
View
IPPS
2009
IEEE
14 years 5 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...
ICMCS
2005
IEEE
94views Multimedia» more  ICMCS 2005»
14 years 4 months ago
Deadline-aware scheduling for wireless video streaming
We present a new algorithm for deadline-aware scheduling of video streams over a wireless shared channel, which only requires the computation of a single metric per user and trans...
Günther Liebl, Mark Kalman, Bernd Girod
SAC
2010
ACM
14 years 16 days ago
Energy-efficient scheduling on homogeneous multiprocessor platforms
Low-power and energy-efficient system implementations have become very important design issues to extend operation duration or cut power bills. To balance the energy consumption r...
Jian-Jia Chen, Lothar Thiele
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
JCO
2007
100views more  JCO 2007»
13 years 10 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye