Tian Tian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tian Tian has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Junzhou Luo
Southeast University, Nanjing, China
5 shared publications - Aibo Song
School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
3 shared publications - Zhiang Wu
School of Computer Science, Nanjing Audit University, Nanjing, China
3 shared publications Fang Dong
1 shared publication- Jiuxin Cao
Southeast University, Nanjing, China and Purple Mountain Laboratories, Nanjing, China
1 shared publication
Latest Publications
- 20 August 2013
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 24 (8) , 2117-2131
Query Mechanism for File Correlation in Cooperative Replica Prefetching
- 20 August 2013
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 24 (8) , 2117-2131
Query Mechanism for File Correlation in Cooperative Replica Prefetching
- 20 October 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (10) , 2372-2384
Cooperative Replica Prefetching Mechanism for Virtual Organization in Grid
- 20 October 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (10) , 2372-2384
Cooperative Replica Prefetching Mechanism for Virtual Organization in Grid
- 1 October 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 526-531
A Prefetching-based Replication Algorithm in Data Grid
Replica value determination plays an important role in the problem of replication in data grid, since only replicating high value replicas can improve the replication efficiency. However, replica value determination methods applied now do not perform well, because they cannot well adapt to the changes of file access patterns. We address this problem by introducing a new replica value determination method through data mining, and based on this method we propose a prefetching-based replication algorithm in a virtual organization (VO) environment in order to carry out a better replication optimization. The major idea of this algorithm is to make use of the characteristic that members in a VO have similar interests of file. Experiments show that compared with traditional replication algorithms our new replication algorithm shows better performance and efficiency in data grid.
- 1 October 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 526-531
A Prefetching-based Replication Algorithm in Data Grid
Replica value determination plays an important role in the problem of replication in data grid, since only replicating high value replicas can improve the replication efficiency. However, replica value determination methods applied now do not perform well, because they cannot well adapt to the changes of file access patterns. We address this problem by introducing a new replica value determination method through data mining, and based on this method we propose a prefetching-based replication algorithm in a virtual organization (VO) environment in order to carry out a better replication optimization. The major idea of this algorithm is to make use of the characteristic that members in a VO have similar interests of file. Experiments show that compared with traditional replication algorithms our new replication algorithm shows better performance and efficiency in data grid.
- 29 July 2008
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 60 (3) , 420-436
Dynamic multi-resource advance reservation in grid environment
- 29 July 2008
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 60 (3) , 420-436
Dynamic multi-resource advance reservation in grid environment
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 594-598
A Prediction-based Two-Stage Replica Replacement Algorithm
To access large and widely distributed data on data grid quickly and efficiently is an important goal of the implementation of data grid. Due to high latency of the Internet, large amounts of data need to be replicated in multiple copies at several distributed sites. However, the storage capacity is limited. So a good replacement algorithm is important to the efficiency of the access to the replicas. In this paper, we propose a prediction-based two-stage replica replacement algorithm. This algorithm achieves a good balance between value and cost by predicting replica value to make sure which replica will be replaced, and predicting the replacement cost to make it as low as possible. Simulation results show that compared with traditional replacement algorithms our prediction-based two-stage replica replacement algorithm shows better performance and efficiency of the data access on data grids.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 594-598
A Prediction-based Two-Stage Replica Replacement Algorithm
To access large and widely distributed data on data grid quickly and efficiently is an important goal of the implementation of data grid. Due to high latency of the Internet, large amounts of data need to be replicated in multiple copies at several distributed sites. However, the storage capacity is limited. So a good replacement algorithm is important to the efficiency of the access to the replicas. In this paper, we propose a prediction-based two-stage replica replacement algorithm. This algorithm achieves a good balance between value and cost by predicting replica value to make sure which replica will be replaced, and predicting the replacement cost to make it as low as possible. Simulation results show that compared with traditional replacement algorithms our prediction-based two-stage replica replacement algorithm shows better performance and efficiency of the data access on data grids.