2017
DOI: 10.1007/s11227-017-2081-z
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing web server RAM performance using birth–death process queuing system: scalable memory issue

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…Outrun. According to Little's law [78], under steady-state conditions, the average number of items in a queuing system equals the average rate at which items arrive multiplied by the average time that an item spends in the system. Let us consider a queuing process where L is number of users, transactions, processes, etc.…”
mentioning
confidence: 99%
“…Outrun. According to Little's law [78], under steady-state conditions, the average number of items in a queuing system equals the average rate at which items arrive multiplied by the average time that an item spends in the system. Let us consider a queuing process where L is number of users, transactions, processes, etc.…”
mentioning
confidence: 99%