Sciweavers

36 search results - page 3 / 8
» Closed-form waiting time approximations for polling systems
Sort
View
QUESTA
2010
107views more  QUESTA 2010»
13 years 4 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
ICNS
2009
IEEE
14 years 28 days ago
Balancing Load of APs by Concurrent Association of Every Wireless Node with Many APs
Abstract— In this paper we propose a novel method for associating Wireless Mobile Nodes (WMNs) to Access Points (APs) in busy Wireless access networks. The proposed method associ...
Dilip Sarkar, Uttam K. Sarkar
IOR
2008
113views more  IOR 2008»
13 years 6 months ago
Service Competition with General Queueing Facilities
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A fi...
Gad Allon, Awi Federgruen
ICON
2007
IEEE
14 years 17 days ago
An Approximate Analysis of the Balance among Performance, Utilization and Power Estimation of Server Systems by Use of the Batch
- In this paper we analyze the performance, utilization, and power estimation of server systems by both adopting the batch service and adjusting the batch size. In addition to redu...
Ying-Wen Bai, Yung-Sen Cheng, Cheng-Hung Tsai
MOBICOM
1996
ACM
13 years 10 months ago
Reducing Processor Power Consumption by Improving Processor Time Management in a Single-user Operating System
The CPU is one of the major power consumers in a portable computer, and considerable power can be saved by turning off the CPU when it is not doing useful work. In Apple's Ma...
Jacob R. Lorch, Alan Jay Smith