Sciweavers

1316 search results - page 6 / 264
» Analytic performance models for bounded queueing systems
Sort
View
MASCOTS
2004
14 years 11 months ago
A Computational Complexity-Aware Model for Performance Analysis of Software Servers
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
Vipul Mathur, Varsha Apte
SIGMETRICS
1998
ACM
187views Hardware» more  SIGMETRICS 1998»
15 years 1 months ago
An Analytic Behavior Model for Disk Drives with Readahead Caches and Request Reordering
Modern disk drives read-ahead data and reorder incoming requests in a workload-dependent fashion. This improves their performance, but makes simple analytical models of them inade...
Elizabeth A. M. Shriver, Arif Merchant, John Wilke...
PODC
2006
ACM
15 years 3 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
ICC
2008
IEEE
15 years 4 months ago
Throughput Model of IEEE 802.11e EDCF with Consideration of Delay Bound Constraint
— In this paper, we present an accurate throughput model of the IEEE 802.11e enhanced distributed coordination function (EDCF). Compared to the previous models, we newly consider...
Jae-Han Lim, Ji-Hoon Yun, Seung-Woo Seo
INFOCOM
2005
IEEE
15 years 3 months ago
An analytic framework for modeling peer to peer networks
Abstract—This paper presents an analytic framework to evaluate the performance of peer to peer (P2P) networks. Using the time to download or replicate an arbitrary file as the m...
Krishna K. Ramachandran, Biplab Sikdar