نتایج جستجو برای: dynamic replication

تعداد نتایج: 505259  

Journal: :Future Generation Comp. Syst. 2007
Giovanni Ciriello Matteo Comin Concettina Guerra

This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an index-based search that produces a list of proteins that are good candidates for similarity, and a dynamic programming algorithm that aligns the target protein with each candidate protein. Both components use the same ...

Journal: :Int. Arab J. Inf. Technol. 2012
Feras Hanandeh Mutaz Khazaaleh Hamidah Ibrahim Rohaya Latip

Data grids are currently proposed solutions to large scale data management problems including efficient file transfer and replication. Large amounts of data and the world-wide distribution of data stores contribute to the complexity of the data management challenge. Recent architecture proposals and prototypes deal with dynamic replication strategies for a high-performance data grid. This paper...

Journal: :IEEE Access 2021

In recent years, cloud computing research, specifically data replication techniques and their applications, has been growing. If the replicas number is raised put in multiple positions, it will be expensive to maintain usability, performance stability of application systems. this paper, two bio- inspired algorithms were proposed improve both selection placement environment. The suggested for dy...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده علوم پایه 1391

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

2009
P. K. Suri Manpreet Singh

One major challenge in data grids is how to provide good and timely access to huge amount of data in distributed locations, given the high latency of interconnection networks. Dynamic replication strategies are regarded as one of the major optimization technique for reducing access latency. In addition to reducing data access time, replication also aims to use network and storage resource effic...

2009
Bharat Bhargava Karl Friesen Abdelsalam Helal John Riedl

Adaptable systems can improve reliability and performance by allowing dynamic reconfiguration. We are conducting a series of experiments on the RAID distributeel database system to siudy the cost and performance impHcations of providing static and dynamic adaptability, and for increasing the availabiliiy of daia iiems. Our studies of the cost of our adaptable implementation wefe conducted in th...

Journal: :Scalable Computing: Practice and Experience 2014

Journal: :Applied sciences 2021

A surge of interest in data-intensive computing has led to a drastic increase the demand for data centers. Given this growing popularity, centers are becoming primary contributor increased consumption energy worldwide. To mitigate problem, paper revisits DVFS (Dynamic Voltage Frequency Scaling), well-known technique reduce usage processors, from viewpoint distributed systems. Distributed system...

Journal: :IEEE Access 2023

Data growth in recent years has been swift, leading to the emergence of big data science. Distributed File Systems (DFS) are commonly used handle data, like Google System (GFS), Hadoop (HDFS), and others. The DFS should provide availability reliability system case failure. replicates files different locations reliability. These replications consume storage space other resources. importance thes...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید