A prediction-based dynamic replication strategy for data-intensive applications

•Intelligent Replica Manager – a new strategy for prediction-based dynamic replication is proposed.•Multi-criteria based replication algorithm is proposed for replica placement.•Modified apriori algorithm is designed for frequent datasets prediction.•Comparison with existing prediction-based dynamic...

Full description

Saved in:
Bibliographic Details
Published inComputers & electrical engineering Vol. 57; pp. 281 - 293
Main Authors Nagarajan, Vijaya, Maluk Mohamed, Mulk Abdul
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier Ltd 01.01.2017
Elsevier BV
Subjects
Online AccessGet full text
ISSN0045-7906
1879-0755
DOI10.1016/j.compeleceng.2016.11.036

Cover

Loading…
Abstract •Intelligent Replica Manager – a new strategy for prediction-based dynamic replication is proposed.•Multi-criteria based replication algorithm is proposed for replica placement.•Modified apriori algorithm is designed for frequent datasets prediction.•Comparison with existing prediction-based dynamic replication methods.•Comparison and testing of the proposed strategy with other strategies for different job size. Data-intensive applications produce huge amount of data sets which need to be analyzed among geographically distributed nodes in grid computing environment. Data replication is essential in this environment to reduce the data access latency and to improve the data availability across several grid sites. In this work, an Intelligent Replica Manager (IRM) is designed and incorporated in the middleware of the grid for scheduling data-intensive applications. IRM uses a Multi-criteria based replication algorithm which considers multiple parameters like storage capacity, bandwidth and communication cost of the neighboring sites before taking decisions for the selection and placement of replica. Additionally, future needs of the grid site are predicted in advance using modified apriori algorithm, which is an association rule based mining technique. This IRM based strategy reduces the data availability time, data access time and make span. The simulation results prove that the proposed strategy outperforms the existing strategies.
AbstractList •Intelligent Replica Manager – a new strategy for prediction-based dynamic replication is proposed.•Multi-criteria based replication algorithm is proposed for replica placement.•Modified apriori algorithm is designed for frequent datasets prediction.•Comparison with existing prediction-based dynamic replication methods.•Comparison and testing of the proposed strategy with other strategies for different job size. Data-intensive applications produce huge amount of data sets which need to be analyzed among geographically distributed nodes in grid computing environment. Data replication is essential in this environment to reduce the data access latency and to improve the data availability across several grid sites. In this work, an Intelligent Replica Manager (IRM) is designed and incorporated in the middleware of the grid for scheduling data-intensive applications. IRM uses a Multi-criteria based replication algorithm which considers multiple parameters like storage capacity, bandwidth and communication cost of the neighboring sites before taking decisions for the selection and placement of replica. Additionally, future needs of the grid site are predicted in advance using modified apriori algorithm, which is an association rule based mining technique. This IRM based strategy reduces the data availability time, data access time and make span. The simulation results prove that the proposed strategy outperforms the existing strategies.
Data-intensive applications produce huge amount of data sets which need to be analyzed among geographically distributed nodes in grid computing environment. Data replication is essential in this environment to reduce the data access latency and to improve the data availability across several grid sites. In this work, an Intelligent Replica Manager (IRM) is designed and incorporated in the middleware of the grid for scheduling data-intensive applications. IRM uses a Multi-criteria based replication algorithm which considers multiple parameters like storage capacity, bandwidth and communication cost of the neighboring sites before taking decisions for the selection and placement of replica. Additionally, future needs of the grid site are predicted in advance using modified apriori algorithm, which is an association rule based mining technique. This IRM based strategy reduces the data availability time, data access time and make span. The simulation results prove that the proposed strategy outperforms the existing strategies.
Author Maluk Mohamed, Mulk Abdul
Nagarajan, Vijaya
Author_xml – sequence: 1
  givenname: Vijaya
  surname: Nagarajan
  fullname: Nagarajan, Vijaya
  email: ssg_vijaya@mamce.org
– sequence: 2
  givenname: Mulk Abdul
  surname: Maluk Mohamed
  fullname: Maluk Mohamed, Mulk Abdul
  email: ssg_malukmd@mamce.org
BookMark eNqNkE1LAzEQhoNUsK3-hxXPu2bS_TxJKX5BoRc9h2wyW7JskzVJC_33plZEPHkaZuZ932GeGZkYa5CQW6AZUCjv-0za3YgDSjTbjMVRBpDRRXlBplBXTUqropiQKaV5kVYNLa_IzPuexr6Eeko2y2R0qLQM2pq0FR5Voo5G7LRMHI6DluK0SXxwIuD2mHTWJUoEkWoT0Hh9wESMPzp_TS47MXi8-a5z8v70-LZ6Sdeb59fVcp3KRd6ElHUsp3VeC8la1eRtoSjrkEkBNasoVNgxFKAkYypv2pbKokUsKatEVSItisWc3J1zR2c_9ugD7-3emXiSQ8NoBWUOdVQ1Z5V01nuHHR-d3gl35ED5iR_v-S9-_MSPA_DIL3of_nilDl9PRhR6-FfC6pyAEcRBo-NeajQy4nYoA1dW_yPlE1Ezl-k
CitedBy_id crossref_primary_10_1109_TII_2019_2919268
crossref_primary_10_1109_TC_2019_2954089
crossref_primary_10_3390_s18010222
crossref_primary_10_1155_2018_2724692
crossref_primary_10_1016_j_jss_2018_05_027
crossref_primary_10_4018_IJCAC_2018070105
Cites_doi 10.1006/jpdc.1999.1578
10.1016/j.future.2011.10.011
10.1016/j.jnca.2012.12.021
10.1109/TPDS.2015.2388449
10.1016/j.future.2010.08.013
10.1016/j.future.2007.02.008
10.3233/MGS-140218
10.1016/j.future.2011.06.009
10.1155/2014/767016
10.1002/cpe.1307
10.1177/109434200101500302
10.1016/j.future.2004.08.001
10.1007/s11227-008-0172-6
ContentType Journal Article
Copyright 2016
Copyright Elsevier BV Jan 2017
Copyright_xml – notice: 2016
– notice: Copyright Elsevier BV Jan 2017
DBID AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.compeleceng.2016.11.036
DatabaseName CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1879-0755
EndPage 293
ExternalDocumentID 10_1016_j_compeleceng_2016_11_036
S0045790616309405
GroupedDBID --K
--M
.DC
.~1
0R~
1B1
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TAE
TN5
UHS
VOH
WH7
WUQ
XPP
ZMT
~G-
~S-
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGQPQ
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
BNPGV
CITATION
SSH
7SC
7SP
8FD
EFKBS
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c349t-2f240848ac2bd94b5d02fe2ca1827017ef2ea1dc22d49bb0c5bee6027a76e0553
IEDL.DBID .~1
ISSN 0045-7906
IngestDate Fri Jul 25 02:30:40 EDT 2025
Thu Apr 24 23:12:24 EDT 2025
Tue Jul 01 01:45:48 EDT 2025
Fri Feb 23 02:26:01 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Replication
Association rules
Modified apriori algorithm
Prediction
Intelligent Replica Manager
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c349t-2f240848ac2bd94b5d02fe2ca1827017ef2ea1dc22d49bb0c5bee6027a76e0553
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1920716418
PQPubID 2045266
PageCount 13
ParticipantIDs proquest_journals_1920716418
crossref_primary_10_1016_j_compeleceng_2016_11_036
crossref_citationtrail_10_1016_j_compeleceng_2016_11_036
elsevier_sciencedirect_doi_10_1016_j_compeleceng_2016_11_036
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate January 2017
2017-01-00
20170101
PublicationDateYYYYMMDD 2017-01-01
PublicationDate_xml – month: 01
  year: 2017
  text: January 2017
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Computers & electrical engineering
PublicationYear 2017
Publisher Elsevier Ltd
Elsevier BV
Publisher_xml – name: Elsevier Ltd
– name: Elsevier BV
References Mohamed, Epema (bib0007) 2004
Tang, Lee, Yeo, Tang (bib0021) 2005; 21
Han, Kamber, Pei (bib0026) 2006
Foster, Kesselman, Tuecke (bib0001) 2001; 15
Bsoul, Alsarhan, Otoom, Hammad, Al-Khasawneh (bib0024) 2014; 10
Saadat, Rahmani (bib0015) 2012; 28
Vashisht, Kumar, Sharma (bib0014) 2014; 2014
Beermann, Stewart, Maettig (bib0016) 2014
Kwok, Ahmad (bib0012) 1999; 59
Sulistio, Cibej, Venugopal, Robic, Buyya (bib0028) 2008; 20
Bsoul, Abdallah, Almakadmeh, Tahat (bib0023) 2016; 27
Kwok, Ahmad (bib0003) 1999; 59
Schopf (bib0004) 2004
Rehn, Barrass, Bonacorsi, Hernandez, Semeniouk, Tuura, Wu (bib0006) 2006
Chettaoui, Charrada (bib0025) 2014; 15
Ranganathan, Foster (bib0005) 2002
Chang, Chang, Lin (bib0019) 2007; 23
Ranganathan, Foster (bib0010) November 12, 2001
Khanli, Isazadeh, Shishavan (bib0017) 2011; 27
Park, Kim, Go, Yoon (bib0020) 2003; 1001
Chang, Chang (bib0022) 2008; 45
Cameron, Schiaffino, Millar, Nicholson, Stockinger, Zini (bib0008) 2003
Agrawal, Srikant (bib0027) September 1994
Lin, Liu, Wu (bib0013) July 2006
Amjad, Sher, Ali (bib0011) 2012; 28
Mansouri, Dastghaibyfard, Mansouri (bib0009) 2013; 36
Ranganathan, Foster (bib0018) 2001
Moore, Baru, Marciano, Rajasekar, Wan (bib0002) 1999
Khanli (10.1016/j.compeleceng.2016.11.036_bib0017) 2011; 27
Kwok (10.1016/j.compeleceng.2016.11.036_bib0012) 1999; 59
Bsoul (10.1016/j.compeleceng.2016.11.036_bib0023) 2016; 27
Foster (10.1016/j.compeleceng.2016.11.036_bib0001) 2001; 15
Chang (10.1016/j.compeleceng.2016.11.036_bib0019) 2007; 23
Mohamed (10.1016/j.compeleceng.2016.11.036_bib0007) 2004
Vashisht (10.1016/j.compeleceng.2016.11.036_bib0014) 2014; 2014
Agrawal (10.1016/j.compeleceng.2016.11.036_bib0027) 1994
Park (10.1016/j.compeleceng.2016.11.036_bib0020) 2003; 1001
Moore (10.1016/j.compeleceng.2016.11.036_bib0002) 1999
Sulistio (10.1016/j.compeleceng.2016.11.036_bib0028) 2008; 20
Kwok (10.1016/j.compeleceng.2016.11.036_bib0003) 1999; 59
Tang (10.1016/j.compeleceng.2016.11.036_bib0021) 2005; 21
Chettaoui (10.1016/j.compeleceng.2016.11.036_bib0025) 2014; 15
Beermann (10.1016/j.compeleceng.2016.11.036_bib0016) 2014
Amjad (10.1016/j.compeleceng.2016.11.036_bib0011) 2012; 28
Schopf (10.1016/j.compeleceng.2016.11.036_bib0004) 2004
Saadat (10.1016/j.compeleceng.2016.11.036_bib0015) 2012; 28
Cameron (10.1016/j.compeleceng.2016.11.036_bib0008) 2003
Mansouri (10.1016/j.compeleceng.2016.11.036_bib0009) 2013; 36
Ranganathan (10.1016/j.compeleceng.2016.11.036_bib0005) 2002
Chang (10.1016/j.compeleceng.2016.11.036_bib0022) 2008; 45
Ranganathan (10.1016/j.compeleceng.2016.11.036_bib0010) 2001
Lin (10.1016/j.compeleceng.2016.11.036_bib0013) 2006
Bsoul (10.1016/j.compeleceng.2016.11.036_bib0024) 2014; 10
Rehn (10.1016/j.compeleceng.2016.11.036_bib0006) 2006
Han (10.1016/j.compeleceng.2016.11.036_bib0026) 2006
Ranganathan (10.1016/j.compeleceng.2016.11.036_bib0018) 2001
References_xml – year: 2001
  ident: bib0018
  article-title: Design and evaluation of dynamic replication strategies for a high performance data grid
  publication-title: Proceedings of international conference on computing in high energy and nuclear physics
– year: 2006
  ident: bib0006
  article-title: PhEDEx high-throughput data transfer management system
  publication-title: Proceedings of computing in high energy and nuclear physics (CHEP)
– volume: 27
  start-page: 233
  year: 2011
  end-page: 244
  ident: bib0017
  article-title: PHFS: A dynamic replication method, to decrease access latency in the multi-tier data grid
  publication-title: Future Gener Comput Syst
– start-page: 75
  year: November 12, 2001
  end-page: 86
  ident: bib0010
  article-title: Identifying dynamic replication strategies for a high performance data grid
  publication-title: Proceedings of the second international workshop on grid computing
– volume: 1001
  start-page: 1324
  year: 2003
  end-page: 1331
  ident: bib0020
  article-title: Dynamic Grid replication strategy based on internet hierarchy
  publication-title: Proceedings of International workshop on grid and cooperative computing
– volume: 28
  start-page: 337
  year: 2012
  end-page: 349
  ident: bib0011
  article-title: A survey of dynamic replication strategies for improving data availability in data grids
  publication-title: Future Gener Comput Syst
– start-page: 15
  year: 2004
  end-page: 23
  ident: bib0004
  article-title: Ten actions when grid scheduling
  publication-title: Grid resource management
– start-page: 487
  year: September 1994
  end-page: 499
  ident: bib0027
  article-title: Fast algorithms for mining association rules in large databases
  publication-title: Proceedings of the 20th international conference on very large data bases, VLDB, Santiago, Chile
– volume: 15
  start-page: 200
  year: 2001
  end-page: 222
  ident: bib0001
  article-title: The anatomy of the grid: enabling scalable virtual organizations
  publication-title: Int J Supercomput Appl
– volume: 20
  start-page: 1591
  year: 2008
  end-page: 1609
  ident: bib0028
  article-title: A toolkit for modelling and simulating data Grids: an extension to GridSim
  publication-title: Concurr Comput: Pract Exp
– start-page: 105
  year: 1999
  end-page: 129
  ident: bib0002
  article-title: Data-intensive computing
  publication-title: The grid: blueprint for a new computing infrastructure
– start-page: 004
  year: 2014
  end-page: 019
  ident: bib0016
  article-title: A popularity based prediction and data redistribution tool for ATLAS distributed data management
  publication-title: PoS
– start-page: 352
  year: 2002
  end-page: 358
  ident: bib0005
  article-title: Decoupling computation and data scheduling in distributed data intensive applications
  publication-title: Proceedings of the 11th IEEE international symposium on high performance distributed computing, HPDC'02
– volume: 27
  start-page: 31
  year: 2016
  end-page: 39
  ident: bib0023
  article-title: A round-based data replication strategy
  publication-title: IEEE Trans Parallel Distrib Syst
– volume: 10
  start-page: 109
  year: 2014
  end-page: 118
  ident: bib0024
  article-title: A dynamic replication strategy based on categorization for data grid
  publication-title: Multiagent Grid Syst
– volume: 23
  start-page: 846
  year: 2007
  end-page: 860
  ident: bib0019
  article-title: Job scheduling and data replication on data grids
  publication-title: Future Gener Comput Syst
– start-page: 287
  year: 2004
  end-page: 298
  ident: bib0007
  article-title: An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
  publication-title: Proceedings of IEEE international conference on cluster computing
– year: July 2006
  ident: bib0013
  article-title: Optimal placement of replicas in data grid environments with locality assurance
  publication-title: Proceedings of the 12th international conference on parallel and distributed systems (ICPADS’06), Minneapolis, Minn, USA
– volume: 59
  start-page: 381
  year: 1999
  end-page: 422
  ident: bib0003
  article-title: Benchmarking and comparison of the task graph scheduling algorithms
  publication-title: J Parallel Distrib Comput
– volume: 2014
  start-page: 10
  year: 2014
  ident: bib0014
  article-title: Efficient dynamic replication algorithm using agent for data grid
  publication-title: Sci World J
– year: 2006
  ident: bib0026
  article-title: Data mining, southeast asia edition: concepts and techniques
– start-page: 52
  year: 2003
  end-page: 60
  ident: bib0008
  article-title: Evaluating scheduling and replica optimisation strategies in OptorSim
  publication-title: Proceedings of the 4th international workshop on grid computing
– volume: 28
  start-page: 666
  year: 2012
  end-page: 681
  ident: bib0015
  article-title: PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids
  publication-title: Future Gener Comput Syst
– volume: 21
  start-page: 775
  year: 2005
  end-page: 790
  ident: bib0021
  article-title: Dynamic replication algorithms for the multi-tier data grid
  publication-title: Future Gener Comput Syst
– volume: 59
  start-page: 381
  year: 1999
  end-page: 422
  ident: bib0012
  article-title: Benchmarking and comparison of the task graph scheduling algorithms
  publication-title: J Parallel Distrib Comput
– volume: 15
  start-page: 101
  year: 2014
  end-page: 119
  ident: bib0025
  article-title: A new decentralized periodic replication strategy for dynamic data grids
  publication-title: Scalable Comput: Pract Exp
– volume: 45
  start-page: 277
  year: 2008
  end-page: 295
  ident: bib0022
  article-title: A dynamic data replication strategy using access-weights in data grids
  publication-title: J Supercomput
– volume: 36
  start-page: 711
  year: 2013
  end-page: 722
  ident: bib0009
  article-title: Combination of data replication and scheduling algorithm for improving data availability in data grids
  publication-title: J Netw Comput Appl
– volume: 59
  start-page: 381
  issue: 3
  year: 1999
  ident: 10.1016/j.compeleceng.2016.11.036_bib0003
  article-title: Benchmarking and comparison of the task graph scheduling algorithms
  publication-title: J Parallel Distrib Comput
  doi: 10.1006/jpdc.1999.1578
– volume: 28
  start-page: 666
  issue: 4
  year: 2012
  ident: 10.1016/j.compeleceng.2016.11.036_bib0015
  article-title: PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids
  publication-title: Future Gener Comput Syst
  doi: 10.1016/j.future.2011.10.011
– year: 2006
  ident: 10.1016/j.compeleceng.2016.11.036_bib0013
  article-title: Optimal placement of replicas in data grid environments with locality assurance
– volume: 59
  start-page: 381
  issue: 3
  year: 1999
  ident: 10.1016/j.compeleceng.2016.11.036_bib0012
  article-title: Benchmarking and comparison of the task graph scheduling algorithms
  publication-title: J Parallel Distrib Comput
  doi: 10.1006/jpdc.1999.1578
– start-page: 352
  year: 2002
  ident: 10.1016/j.compeleceng.2016.11.036_bib0005
  article-title: Decoupling computation and data scheduling in distributed data intensive applications
– volume: 36
  start-page: 711
  issue: 2
  year: 2013
  ident: 10.1016/j.compeleceng.2016.11.036_bib0009
  article-title: Combination of data replication and scheduling algorithm for improving data availability in data grids
  publication-title: J Netw Comput Appl
  doi: 10.1016/j.jnca.2012.12.021
– volume: 27
  start-page: 31
  issue: 1
  year: 2016
  ident: 10.1016/j.compeleceng.2016.11.036_bib0023
  article-title: A round-based data replication strategy
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2015.2388449
– start-page: 004
  year: 2014
  ident: 10.1016/j.compeleceng.2016.11.036_bib0016
  article-title: A popularity based prediction and data redistribution tool for ATLAS distributed data management
  publication-title: PoS
– year: 2006
  ident: 10.1016/j.compeleceng.2016.11.036_bib0026
– volume: 1001
  start-page: 1324
  year: 2003
  ident: 10.1016/j.compeleceng.2016.11.036_bib0020
  article-title: Dynamic Grid replication strategy based on internet hierarchy
– start-page: 287
  year: 2004
  ident: 10.1016/j.compeleceng.2016.11.036_bib0007
  article-title: An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
– volume: 27
  start-page: 233
  issue: 3
  year: 2011
  ident: 10.1016/j.compeleceng.2016.11.036_bib0017
  article-title: PHFS: A dynamic replication method, to decrease access latency in the multi-tier data grid
  publication-title: Future Gener Comput Syst
  doi: 10.1016/j.future.2010.08.013
– start-page: 105
  year: 1999
  ident: 10.1016/j.compeleceng.2016.11.036_bib0002
  article-title: Data-intensive computing
– volume: 23
  start-page: 846
  issue: 7
  year: 2007
  ident: 10.1016/j.compeleceng.2016.11.036_bib0019
  article-title: Job scheduling and data replication on data grids
  publication-title: Future Gener Comput Syst
  doi: 10.1016/j.future.2007.02.008
– volume: 10
  start-page: 109
  issue: 2
  year: 2014
  ident: 10.1016/j.compeleceng.2016.11.036_bib0024
  article-title: A dynamic replication strategy based on categorization for data grid
  publication-title: Multiagent Grid Syst
  doi: 10.3233/MGS-140218
– year: 2001
  ident: 10.1016/j.compeleceng.2016.11.036_bib0018
  article-title: Design and evaluation of dynamic replication strategies for a high performance data grid
– year: 2006
  ident: 10.1016/j.compeleceng.2016.11.036_bib0006
  article-title: PhEDEx high-throughput data transfer management system
– start-page: 15
  year: 2004
  ident: 10.1016/j.compeleceng.2016.11.036_bib0004
  article-title: Ten actions when grid scheduling
– start-page: 52
  year: 2003
  ident: 10.1016/j.compeleceng.2016.11.036_bib0008
  article-title: Evaluating scheduling and replica optimisation strategies in OptorSim
– volume: 28
  start-page: 337
  issue: 2
  year: 2012
  ident: 10.1016/j.compeleceng.2016.11.036_bib0011
  article-title: A survey of dynamic replication strategies for improving data availability in data grids
  publication-title: Future Gener Comput Syst
  doi: 10.1016/j.future.2011.06.009
– volume: 2014
  start-page: 10
  year: 2014
  ident: 10.1016/j.compeleceng.2016.11.036_bib0014
  article-title: Efficient dynamic replication algorithm using agent for data grid
  publication-title: Sci World J
  doi: 10.1155/2014/767016
– volume: 20
  start-page: 1591
  issue: 13
  year: 2008
  ident: 10.1016/j.compeleceng.2016.11.036_bib0028
  article-title: A toolkit for modelling and simulating data Grids: an extension to GridSim
  publication-title: Concurr Comput: Pract Exp
  doi: 10.1002/cpe.1307
– start-page: 487
  year: 1994
  ident: 10.1016/j.compeleceng.2016.11.036_bib0027
  article-title: Fast algorithms for mining association rules in large databases
– start-page: 75
  year: 2001
  ident: 10.1016/j.compeleceng.2016.11.036_bib0010
  article-title: Identifying dynamic replication strategies for a high performance data grid
– volume: 15
  start-page: 200
  issue: 3
  year: 2001
  ident: 10.1016/j.compeleceng.2016.11.036_bib0001
  article-title: The anatomy of the grid: enabling scalable virtual organizations
  publication-title: Int J Supercomput Appl
  doi: 10.1177/109434200101500302
– volume: 21
  start-page: 775
  year: 2005
  ident: 10.1016/j.compeleceng.2016.11.036_bib0021
  article-title: Dynamic replication algorithms for the multi-tier data grid
  publication-title: Future Gener Comput Syst
  doi: 10.1016/j.future.2004.08.001
– volume: 15
  start-page: 101
  issue: 1
  year: 2014
  ident: 10.1016/j.compeleceng.2016.11.036_bib0025
  article-title: A new decentralized periodic replication strategy for dynamic data grids
  publication-title: Scalable Comput: Pract Exp
– volume: 45
  start-page: 277
  issue: 3
  year: 2008
  ident: 10.1016/j.compeleceng.2016.11.036_bib0022
  article-title: A dynamic data replication strategy using access-weights in data grids
  publication-title: J Supercomput
  doi: 10.1007/s11227-008-0172-6
SSID ssj0004618
Score 2.1789594
Snippet •Intelligent Replica Manager – a new strategy for prediction-based dynamic replication is proposed.•Multi-criteria based replication algorithm is proposed for...
Data-intensive applications produce huge amount of data sets which need to be analyzed among geographically distributed nodes in grid computing environment....
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 281
SubjectTerms Access time
Association rules
Computational grids
Computer simulation
Data mining
Data replication
Geographical distribution
Intelligent Replica Manager
Middleware
Modified apriori algorithm
Prediction
Predictions
Replication
Scheduling
Servers
Storage capacity
Strategy
Title A prediction-based dynamic replication strategy for data-intensive applications
URI https://dx.doi.org/10.1016/j.compeleceng.2016.11.036
https://www.proquest.com/docview/1920716418
Volume 57
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFA9jguhB_MSPOSJ47ZalSdqAlyGOqTgvDnYLaZLKROrY5sGLf7t5_ZhVPAyE0kPhlfKSvI--3_s9hC6tdsQ4b_1Y7Jy_SRbEVKYBiUxqQy60zaeWPIzEcMzuJnzSQNdVLwzAKkvbX9j03FqXT7qlNruz6RR6fBmPpPdHIgQSOGg0B_Y6v6c7n71ab2SvsMYMqBmJ2EQX3xgvgG3DuBmXPQPKS3SA0DNna_7TR_2y1rkLGuyinTJ2xP3i8_ZQw2X7aLvGKHiAHvt4NofaC-g7ABdlsS2GzuO5W9Wq8aIgpf3APmbFgBINphWWHddr2odoPLh5uh4G5cyEwIRMLgOaAmcZi7WhiZUs4ZbQ1FGjfR4R-dPnUup0zxpKLZNJQgxPnBM-N9WRcITz8Ag1s7fMHSMch2Ho4xMtBWeMaqZ96mQIS6PIXzIUJyiutKRMSSgOcy1eVYUce1E1BStQsE84FAFRuhKdFawa6whdVUuhfmwR5a3_OuKtavlUeU4Xyse3BDLGXnz6v7efoS0KDj__OdNCzeX83Z37cGWZtPP92EYb_dv74egLPZXr8Q
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB5qBR8H8YlvI3hdTbNJdhe8lKJU-_DSgreQTbJSkVraevDfm9mHVvEgCMseFmZZJsk8dr75BuDCakeN89aPx875W8KDmCVZQCOT2VBIbfOpJb2-bA_5_aN4rEGr6oVBWGVp-wubnlvr8slVqc2ryWiEPb5cRIn3RzJEEjixBMvITsXrsNy867T7C-2RjcIgc2RnpHIFzr9gXojcxokzbvyEQC95iZyeOWHzr27qh8HOvdDtJmyU4SNpFl-4BTU33ob1BVLBHXhokskUyy-o8gC9lCW2mDtPpu6zXE1mBS_tO_FhK0GgaDCq4Oxksay9C8Pbm0GrHZRjEwIT8mQesAxpy3isDUttwlNhKcscM9qnEpE_gC5jTjesYczyJE2pEalz0qenOpKOChHuQX38Onb7QOIwDH2IohMpOGeaa589GcqzKPJXEsoDiCstKVNyiuNoixdVgcee1YKCFSrY5xyKoij7FJ0UxBp_EbqulkJ92yXKO4C_iB9Xy6fKozpTPsSlmDQ24sP_vf0MVtuDXld17_qdI1hj6P_zfzXHUJ9P39yJj17m6Wm5Oz8AU3juog
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+prediction-based+dynamic+replication+strategy+for+data-intensive+applications&rft.jtitle=Computers+%26+electrical+engineering&rft.au=Nagarajan%2C+Vijaya&rft.au=Maluk+Mohamed%2C+Mulk+Abdul&rft.date=2017-01-01&rft.pub=Elsevier+Ltd&rft.issn=0045-7906&rft.eissn=1879-0755&rft.volume=57&rft.spage=281&rft.epage=293&rft_id=info:doi/10.1016%2Fj.compeleceng.2016.11.036&rft.externalDocID=S0045790616309405
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0045-7906&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0045-7906&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0045-7906&client=summon