2019
DOI: 10.1016/j.jpdc.2019.05.002
|View full text |Cite
|
Sign up to set email alerts
|

A generic formal model for the comparison and analysis of distributed job-scheduling algorithms in grid environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…However, due to the shortcomings of MPI's own data storage and processing, which are independent and cannot deal with node failures, the parallel PSO algorithm implemented by MPI model is used. The practicality is much weaker [3]. Although DC makes full use of network computing power, distributed parallel computing needs to have good scalability to improve the performance of parallel computing.…”
Section: Introductionmentioning
confidence: 99%
“…However, due to the shortcomings of MPI's own data storage and processing, which are independent and cannot deal with node failures, the parallel PSO algorithm implemented by MPI model is used. The practicality is much weaker [3]. Although DC makes full use of network computing power, distributed parallel computing needs to have good scalability to improve the performance of parallel computing.…”
Section: Introductionmentioning
confidence: 99%