DocumentCode
1614886
Title
Performance analysis of scheduling and replication algorithms on Grid Datafarm architecture for high-energy physics applications
Author
Takefusa, Atsuko ; Matsuoka, Satoshi ; Tatebe, Osmu ; Morita, Youhei
Author_Institution
Ochanomizu Univ., Tokyo, Japan
fYear
2003
Firstpage
34
Lastpage
43
Abstract
Data Grid is a Grid for ubiquitous access and analysis of large-scale data. Because Data Grid is in the early stages of development, the performance of its petabyte-scale models in a realistic data processing setting has not been well investigated. By enhancing our Bricks Grid simulator to accommodated Data Grid scenarios, we investigate and compare the performance of different Data Grid models. These are categorized mainly as either central or tier models; they employ various scheduling and replication strategies under realistic assumptions of job processing for CERN LHC experiments on the Grid Datafarm system. Our results show that the central model is efficient but that the tier model, with its greater resources and its speculative class of background replication policies, are quite effective and achieve higher performance, while each tier is smaller than the central model.
Keywords
algorithm theory; distributed algorithms; grid computing; middleware; physics computing; processor scheduling; replicated databases; Bricks Grid simulator; CERN LHC; Grid Datafarm architecture; Large Hadron Collider; central models; high-energy applications; large-scale data; performance analysis; petabyte-scale models; physics applications; realistic data processing; replication algorithm; scheduling algorithm; tier models; Computer architecture; Distributed computing; Performance analysis; Physics; Processor scheduling; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on
ISSN
1082-8907
Print_ISBN
0-7695-1965-2
Type
conf
DOI
10.1109/HPDC.2003.1210014
Filename
1210014
Link To Document