检索结果-内蒙古大学图书馆

Address databases for national SDI: Comparing the novel data grid approach to data harvesting and federated databases

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2009年第9期23卷 1179-1209页

作者： Coetzee, Serena Bishop, Judith Univ Pretoria Dept Comp Sci ZA-0002 Pretoria South Africa

The original purpose of addresses was to enable the correct and unambiguous delivery of postal mail. The advent of computers and more specifically geographic information systems (GIS) opened up a whole new range of possibilities for the use of addresses, such as routing and vehicle navigation, spatial demographic analysis, geo-marketing, and service placement and delivery. Such functionality requires a database which can store and access spatial data effectively. In this paper we present address databases and justify the need for national address databases. We describe models used for national address databases, and present our evaluation framework for an address database at a national level within the context of a spatial data infrastructure (SDI). The models of data harvesting, federated databases and data grids are analyzed and evaluated according to our novel framework, and we show that the data grid model has some unique features that make it attractive for a national address database in an environment where centralized control and/or coordination is difficult or undesirable.

关键词： address data national address database SDI data grid information federation

来源：评论

学校读者我要写书评

暂无评论

New dynamic replication strategy for data grid

引用

Beijing Jiaotong Daxue Xuebao/Journal of Beijing Jiaotong University 2008年第6期32卷 111-115+122页

作者： Qi, Xuedong Li, Xia Liang, Hong Xing, Changzhen Tong, Zhaoqi Dongying 257061 China Dongying 257061 China Dongying 257061 China

Scientific experiments and engineering applications generate large amounts of data which need to be shared among researchers around the world. High performance grids facilitate the distribution of such data to geographically remote places. Dynamic replication is a practical and efficient method which can be used to reduce bandwidth consumption and access latency in high performance data grids where users require remote access to large files. In this paper, a new dynamic replication algorithm, Fast Cascading, is proposed for the multi-tier data grid. Simulator OptorSim has been modified to illustrate the performance of the replication algorithm. The simulation results show that this algorithm can reduce the average response time of data access greatly for random access pattern compared to Fast Spread, LRU and Economy-Zipf dynamic replication strategy and the gain increases with the number of submitted jobs.

关键词： data grid grid simulator Performance Replication Strategy

来源：评论

学校读者我要写书评

暂无评论

Dynamic replication strategies in data grid systems: a survey

引用

JOURNAL OF SUPERCOMPUTING 2015年第11期71卷 4116-4140页

作者： Tos, Uras Mokadem, Riad Hameurlain, Abdelkader Ayav, Tolga Bora, Sebnem Univ Toulouse 3 IRIT F-31062 Toulouse France Izmir Inst Technol Dept Comp Engn TR-35430 Izmir Turkey Ege Univ Dept Comp Engn TR-35100 Izmir Turkey

In data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out.

关键词： data grid Dynamic replication data grid architecture Performance

来源：评论

学校读者我要写书评

暂无评论

A review of data replication based on meta-heuristics approach in cloud computing and data grid

引用

SOFT COMPUTING 2020年第19期24卷 14503-14530页

作者： Mansouri, Najme Javidi, Mohammad Masoud Shahid Bahonar Univ Kerman Dept Comp Sci Kerman Iran

Heterogeneous distributed computing environments are emerging for developing data-intensive (big data) applications that require to access huge data files. Therefore, effective data management like efficient access and data availability has become critical requirement in these systems. data replication is an essential technique applied to achieve these goals through storing multiple replicas in a wisely manner. There are replication algorithms that address some metrics such as reliability, availability, bandwidth consumption, storage usage, response time. In this paper, we present different issues involved in data replication and discuss the key points of the recent algorithms with a tabular representation of all those features. The focus of the review is the existing algorithms of data replication that are based on the meta-heuristic techniques. This review will enable the readers to see that previous studies contributed response time to the data replication, but the contribution of the energy consumption and security improvement has not been considerable well. Moreover, the impact of meta-heuristic algorithms on data replication performance is investigated in a simulation study. Finally, open issues and future challenges have been presented in this research work.

关键词： data replication Cloud computing data grid Meta-heuristic

来源：评论

学校读者我要写书评

暂无评论

Replica selection strategies in data grid

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2008年第12期68卷 1561-1574页

作者： Rahman, Rashedur M. Alhajj, Reda Barker, Ken Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada Global Univ Dept Comp Sci Beirut Lebanon

Replication in data grids reduces access latency and bandwidth consumption. When different sites hold replicas of datasers, there is a significant benefit realized by selecting the best replica. By selecting the best replica, rile access latency can be minimized. In this research, we propose two different replica selection techniques. To select the best replica from information gathered locally, a simple technique called the k-Nearest Neighbor (KNN) rule is exploited. The KNN rule selects the best replica for a file by considering previous file transfer logs indicating the history of the rile and those nearby. We also propose a predictive technique to estimate the transfer time between sites. The predicted transfer time can be used as an estimate of transfer bandwidth of different sites that hold replica currently, and help in selecting the best replica among different sites. Simulation results demonstrate that the k-nearest algorithm shows a significant performance improvement over the traditional replica catalog based model Besides the., neural network predictive technique estimates the transfer time among sites more accurately than the multi-regression model. (C) 2008 Elsevier Inc. All rights reserved.

关键词： data grid Replication Network latency Replica selection Dynamic allocation Distributed environment

来源：评论

学校读者我要写书评

暂无评论

The impact of data replication on job scheduling performance in the data grid

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2006年第3期22卷 254-268页

作者： Tang, M Lee, BS Tang, XY Yeo, CK Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

In the data grid environment, the primary goal of data replication is to shorten the data access time experienced by the job and consequently reduce the job turnaround time. After introducing a data grid architecture that supports efficient data access for the grid job, the dynamic data replication algorithms are put forward. Combined with different grid scheduling heuristics, the performances of the data replication algorithms are evaluated with various simulations. The simulation results demonstrate that the dynamic replication algorithms can reduce the job turnaround time remarkably. In particular, the combination of shortest turnaround time scheduling heuristic (STT) and centralized dynamic replication with response-time oriented replica placement (CDR_RTPlace) exhibits remarkable performance in diverse system environments and job workloads. (c) 2005 Elsevier B.V. All rights reserved.

关键词： data replication grid scheduling data grid simulation

来源：评论

学校读者我要写书评

暂无评论

Improved Genetic Algorithm for scheduling divisible data grid application

Improved Genetic Algorithm for scheduling divisible data gri...

引用

IEEE International Conference on Telecommunications/IEEE Malaysia International Conference on Communications (ICT-MICC 2007)

作者： Abduh, Monir Othman, Mohamed Ibrahim, Hamidah Subramaniam, Shamala Univ Putra Malaysia Selangor Malaysia

ISBN: (纸本)9781424410934

data grid technology promises geographically distributed scientists to access and share physically distributed resources such as computing resources, networks, storages, and most importantly data collections for large scale data intensive problems. In many data grid applications, data can be decomposed into multiple independent sub datasets and distributed for parallel execution and analysis. In this paper, we exploit this property and propose an Improved Genetic Algorithm (IGA) for scheduling divisible data grid applications. A good heuristic approach used to generate the initial population. Experimental results show that the proposed IGA gives better performance compared to the Genetic Algorithm (GA).

关键词： scheduling Genetic Algorithm data grid

来源：评论

学校读者我要写书评

暂无评论

ISSUES IN IMPLEMENTING A SCIENTIFIC data grid BASED ON PEER-TO-PEER ARCHITECTURE

ISSUES IN IMPLEMENTING A SCIENTIFIC DATA GRID BASED ON PEER-...

引用

International Conference on Computing and Informatics

作者： Abdullah, Azizol Othman, Mohamed Sulaiman, Md Nasir Ibrahim, Hamidah Othman, Abu Talib Univ Putra Malaysia Fac Comp Sci & Inforinat Technol Serdang 43400 Selangor Malaysia Univ Kuala Lumpur MARA Infotech Inst Kuala Lumpur 50250 Malaysia

ISBN: (纸本)9781424402199

grid and Peer-to-Peer (P2P) networks enable the sharing and aggregation of geographically distributed resources. grids mostly deals with large computational problems and provide geographically distributed resources for large-scale data-intensive applications that generate large data sets, whereas P2P provides a way for sharing huge volumes of data. In a modern scientific computing, the communities of researchers involves in organizing, moving, visualizing, and analyzing massive amounts of a very large data collections in a geographically distributed environment. Research in the area of grid and P2P computing;have given us various ideas and solutions to address the problems. One of the most challenging issues in grid computing that address above requirements is locating and sharing remote data. In this paper, we illustrate the idea of using P2P approach for locating and sharing data in scientific data grid environment through our P2P Scientific data grid Framework.

关键词： data grid data sharing peer-to-peer

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a web-based data grid management system for enterprise PACS backup and disaster recovery

Design and implementation of a web-based data grid managemen...

引用

Medical Imaging 2007 Conference

作者： Zhou, Zheng Ma, Kevin Talini, Elisa Documet, Jorge Lee, Jasper Liu, Brent Univ So Calif Image Proc & Informat Lab Marina Del Rey CA 90292 USA Dept Biomed Engn Austin TX USA Dept Diagnost & Intervent Radiol Pisa Italy

ISBN: (纸本)9780819466341

A cross-continental data grid infrastructure has been developed at the Image Processing and Informatics (IPI) research laboratory as a fault-tolerant image data backup and disaster recovery solution for Enterprise PACS. The data grid stores multiple copies of the imaging studies as well as the metadata, such as patient and study information, in geographically distributed computers and storage devices involving three different continents: America, Asia and Europe. This effectively prevents loss of image data and accelerates data recovery in the case of disaster. However, the lack of centralized management system makes the administration of the current data grid difficult. Three major challenges exist in current data grid management: 1. No single user interface to access and administrate each geographically separate component;2. No graphical user interface available, resulting in command-line-based administration;3. No single sign-on access to the data grid;administrators have to log into every grid component with different corresponding user names/passwords. In this paper we are presenting a prototype of a unique web-based access interface for both data grid administrators and users. The interface has been designed to be user-friendly;it provides necessary instruments to constantly monitor the current status of the data grid components and their contents from any locations, contributing to longer system up-time.

关键词： data grid management system graphical user interface single sign-on web

来源：评论

学校读者我要写书评

暂无评论

data resource discovery model based on hybrid architecture in data grid environment

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2015年第3期27卷 507-525页

作者： Ma, Tinghuai Lu, Yinhua Shi, Sunyuan Tian, Wei Wang, Xin Guan, Donghai Nanjing Univ Informat Sci & Technol Jiangsu Engn Ctr Network Monitoring Nanjing 210044 Jiangsu Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China Huafeng Meteorol Media Grp Beijing 100086 Peoples R China Kyung Hee Univ Dept Comp Engn Suwon 446701 South Korea

Today, the management of massive data collections draws much attention as data grids have been developed to deal with large computational problems and provide the opportunity for sharing geographically distributed resources for largescale dataintensive applications. Therefore, finding an effective approach to discover data resources in order to promote better interactions between application communities or virtual organizations becomes a critical challenge. Traditional grid resource discovery models are mostly based on central and hierarchical architecture that can lead to bottlenecking with the expansion of the grid scale. Although the PeertoPeer (P2P) technique is integrated into the grid in order to improve the performance in recent years, each P2P structure still has drawbacks that require several compensatory strategies. In this paper, based on the unstructured supernodebased architecture from the P2P system, we design a structured logic resource tree in each domain in order to effectively alleviate the load on the supernode, and we propose a query recording learning algorithm based on this hybrid architecture to reduce traffic in the network and greatly shorten the response time. The model and algorithm are validated by simulations and compared with the traditional superpeer model and the floodingbased approach. Copyright (c) 2014 John Wiley & Sons, Ltd.

关键词： data grid resource discovery P2P supernode logic resource tree

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：