Sciweavers

472 search results - page 42 / 95
» Quick-release Fair Scheduling
Sort
View
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Cost sharing in a job scheduling problem using the Shapley value
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...
Debasis Mishra, Bharath Rangarajan
COMCOM
2002
79views more  COMCOM 2002»
13 years 8 months ago
A probabilistic priority scheduling discipline for multi-service networks
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is ...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
VTC
2010
IEEE
404views Communications» more  VTC 2010»
13 years 7 months ago
Power Efficient Dynamic Resource Scheduling Algorithms for LTE
: This paper presents a link level analysis of the rate and energy efficiency performance of the LTE downlink considering the unitary codebook based precoding scheme. In a multi-us...
Congzheng Han, Kian Chung Beh, Marios Nicolaou, Si...
IPPS
2010
IEEE
13 years 6 months ago
Dynamic Fractional Resource Scheduling for cluster platforms
We propose a novel approach, called Dynamic Fractional Resource Scheduling (DFRS), to share homogeneous cluster computing platforms among competing jobs. DFRS leverages virtual mac...
Mark Stillwell
SIGMETRICS
2002
ACM
110views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Understanding the slowdown of large jobs in an M/GI/1 system
We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the it slowdown experienced by largest jobs. We consider sche...
Mor Harchol-Balter, Karl Sigman, Adam Wierman