2021
DOI: 10.1007/s11277-021-08806-4
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Intelligent Time Slice Based Round Robin Scheduling Algorithm for ATM Using ISBP

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…The main idea of the CMPA algorithm is to obtain multiple sub-factor graphs (also called sub-graphs) by pruning the factor graph (also called the parent graph) (this can reduce the df value during the calculation of the sub-graph), and perform MPA on the sub-factor graph. Algorithm iterative calculation [6][7]. The branch here refers to the connection between two nodes.…”
Section: Distributed Processing Systemmentioning
confidence: 99%
“…The main idea of the CMPA algorithm is to obtain multiple sub-factor graphs (also called sub-graphs) by pruning the factor graph (also called the parent graph) (this can reduce the df value during the calculation of the sub-graph), and perform MPA on the sub-factor graph. Algorithm iterative calculation [6][7]. The branch here refers to the connection between two nodes.…”
Section: Distributed Processing Systemmentioning
confidence: 99%