Sciweavers

1316 search results - page 31 / 264
» Analytic performance models for bounded queueing systems
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 8 months ago
The Study State Analysis of Tandem Queue with Blocking and Feedback
-----------------------------------------------ABSTRACT----------------------------------------Computer system models provide detailed answer to system performance. In this paper a...
C. Chandra Sekhar Reddy, K. Ramakrishna Prasad, Ma...
ISCAPDCS
2003
14 years 11 months ago
Efficient Data Allocation for a Cluster of Workstations
The development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. The trend of moving away from sp...
Ahmed M. Mohamed, Reda A. Ammar, Lester Lipsky
DSN
2011
IEEE
13 years 9 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...
PRIMA
2004
Springer
15 years 3 months ago
Handling Emergent Resource Use Oscillations
— Distributed computing systems are increasingly being created as self-organizing collections of many autonomous (human or software) agents cooperating as peers. Peer-to-peer coo...
Mark Klein, Richard Metzler, Yaneer Bar-Yam
MOBIHOC
2009
ACM
15 years 10 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant