Mô phỏng thuật toán lập lịch trong tính toán lưới

MƠ

H

SIMULATION OF SCHEDULING ALGORITHM IN GRID COMPUTING
ác giả:
,



óm tắt:
ác
t
i
i t
các m
i c t
t á
g
g
tá
g có ả
g t
các t i g
tá
giải
t các
t
i
g
t g

c
t t t ic
g các m i t
gt
t á
i
các t i g
t
g
tá
m t
t g các mi
i
ả t
c các t c c ác
i các c i
c ác
c t i
g
t
t
ả
các t i g
c các g
g t g các
tá t
i
g m t i m
ct
ải

cải ti m t các i
ả các
m i gi i t i g
các t t t á
c
i á gi i
t i t tt á
c m gt
i t t gt
t á
i
gc gc m
g i
i
i c
g i
i im M t c g c m
ó
m
gt i g
i các
các m
g
g
ừ

ó :

Mơ

ơ

Abstract:
Clusters, Grids, and peer-to-peer (P2P) networks have emerged as popular paradigms for next
generation parallel and distributed computing. They can aggregate distributed resources to solve
large-scale problems in science, engineering, and commerce. In Grid and P2P computing
environments, the resources are usually geographically distributed in multiple administrative
domains managed and owned by different organizations with different policies, and
interconnected by wide-area networks or the Internet. The management of resources and
scheduling of applications in such large-scale distributed systems is a complex undertaking. In
order to prove the effectiveness of resource brokers and associated scheduling algorithms, this
paper introduces Economic-based scheduling algorithms in Grid Computing by using a Javabased discrete-event Grid simulation toolkit called GridSim. The toolkit supports modeling and
simulation of heterogeneous Grid resource, users and application models.
Key words: Grid computing; GridSim; Resource; Resource broker; Processing elements.