Sciweavers

3934 search results - page 18 / 787
» Approximate Schedulability Analysis
Sort
View
JCSS
2008
96views more  JCSS 2008»
13 years 8 months ago
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
Devdatta Gangal, Abhiram G. Ranade
GLOBECOM
2008
IEEE
14 years 2 months ago
Performance Metric Sensitivity Computation for Optimization and Trade-Off Analysis in Wireless Networks
Abstract—We develop and evaluate a new method for estimating and optimizing various performance metrics for multihop wireless networks, including MANETs. We introduce an approxim...
John S. Baras, Vahid Tabatabaee, George Papageorgi...
ANOR
2010
77views more  ANOR 2010»
13 years 8 months ago
Time-dependent analysis for refused admissions in clinical wards
For capacity planning issues in health care, such as the allocation of hospital beds, the admissions rate of patients is commonly assumed to be constant over time. In addition to ...
René Bekker, A. M. de Bruin
ASAP
2007
IEEE
150views Hardware» more  ASAP 2007»
14 years 13 days ago
Customizing Reconfigurable On-Chip Crossbar Scheduler
We present a design of a customized crossbar scheduler for on-chip networks. The proposed scheduler arbitrates on-demand interconnects, where physical topologies are identical to ...
Jae Young Hur, Todor Stefanov, Stephan Wong, Stama...
QUESTA
2010
107views more  QUESTA 2010»
13 years 6 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...