2021
DOI: 10.1134/s1064226921060176
|View full text |Cite
|
Sign up to set email alerts
|

New Policy for Routing Jobs to Unobservable Parallel Queues with FIFO Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Real software router and a simulation environment were constructed to test the performance of caching strategy of online education platform based on load and the effectiveness of teaching reform, as shown in Figure 1. Among them, cache replacement management adopts First In First Out (FIFO) mechanism 10 to improve processing speed, the chunk size is 4 MB, and content space is set to 1 × 10 6 , so the Bloom filter will consume 8 × 10 6 bit =1 MB memory. The simulation F I G U R E 2 QoE of teaching reform environment contained a network topology composed of multiple cache nodes, each of which had the same cache capacity of 10 GB.…”
Section: Online Education Platformmentioning
confidence: 99%
“…Real software router and a simulation environment were constructed to test the performance of caching strategy of online education platform based on load and the effectiveness of teaching reform, as shown in Figure 1. Among them, cache replacement management adopts First In First Out (FIFO) mechanism 10 to improve processing speed, the chunk size is 4 MB, and content space is set to 1 × 10 6 , so the Bloom filter will consume 8 × 10 6 bit =1 MB memory. The simulation F I G U R E 2 QoE of teaching reform environment contained a network topology composed of multiple cache nodes, each of which had the same cache capacity of 10 GB.…”
Section: Online Education Platformmentioning
confidence: 99%