Skip to main content

Comparison between Shared memory architecture and Shared nothing architecture



Shared-Memory Architecture:






This architecture connects different processor under one operating system through high speed interconnections (cross-bar switch or high speed bus etc). Query response time is reduced by dividing workload to any connected processor with least or no workload. This architecture provides two main advantages over other architectures as it manages load in a perfect manner and easy to manage. It uses least busy processors and allocates new tasks to it so that query processing is done at a fast speed.










But along with two major advantages it has three basic disadvantages too. These are low availability, any fault or problem may affect most of the processors making less availability, high cost to link processors and third, limited extensible.



















Performance

  Shared memory architecture provides a good performance as compared to shared nothing architecture by balancing query load on a processor with less or no work load.


Software complexity query processing





 

There is a need to parallelize intra query but it remains simple. Load balancing can be easily achieved at run time processing with this architecture by assigning new tasks to nodes with less load or no load.






Availability

 
Shared memory has disadvantage over shared nothing architecture that it has low availability, any fault or problem may affect most of the processors making less availability. Duplex memory with a repeating interconnection is a solution to this problem.


Shared nothing architecture 


Performance



This architecture provides a complexity to manage load caused by required distributed database functions to be implemented for a large number of nodes

Software complexity query processing 

Load balancing in this architecture is comparably complex as it needs to decide load balancing on the basis of data placed at different locations. With the addition of new nodes, there is a need to reorganize database for load balancing issue.

Availability

Shared nothing architecture is good as compared to shared memory architecture as it provides high availability by copying data on many nodes.
Any fault or disturbance in any node may not disturb the availability to the data 




Comments

Popular posts from this blog

Information Retreival Systems in Bioinformatics: Entrez

Currently many biological databases have been developed and became an important toolbox for every scientist in research and academic purpose. Searching a sequence homologue of either Protein, DNA or to know the novelty of a sequence, one needs to do a sequence search against available databases. Similarly, searching for Open Reading Frame, structure, functional, regulatory sequences and repeated elements, we also need to search our query against different available databases. As biological data is increasing with the passage of time, its tremendous growth requires a searching and access system to retrieve useful information. In biological data, three retrieval systems are widely used relevant to a scientific need, it includes: Entrez, Sequence Retrieval System also known as SRS and DBGET. These retrieval systems let its user a text search against multiple molecular databases and also provides useful relevant information in the forms of links either internal or external to our qu...

Information Retreival System: Implementation

NCBI provides an information retrieval system, Entrez, designed to provide user friendly access to biomedical data including structural, molecular, sequences and literature.   Entrez provides access and searching facilities to more than 30 databases of genome, health, structural, literature, sequence and chemical. It provides faecet, limited and advance searching option with Boolean operators to customize user’s query. It also facilitates querying with wild card characters, mapping and controlled vocabulary. Web implementation of Entrez has more valuable applications and benefits over Network Entrez as it facilitates searching with a tremendous amount of data in different databases. Entrez provides navigational links between different databases either provided by NCBI or external (journal/databases) for each record by using two types of relationships: neighbors and hard links. Both of these types of relationships have been found on the basis of controlled vocabulary and algor...

How genetic algorithm works in Bioinformatics?

A.     Initialization Originally various individual solutions are generated arbitrarily to build initial population. Size of population depends on problem nature, but typically it carries several hundred to several thousand possible solutions. Usually, the population is created arbitrarily, covering the complete range of probable solutions. Sometimes solutions may be “seeded” where there is a chance of optimal solutions. B.     Selection During every consecutive generation, a fraction of the present population is chosen for breeding a new generation. Fitness-based process chooses individual solutions, where solutions measured through functions of fitness are usually likely to be chosen. Many selection procedures rate the fitness for every solution and specially select the one best solution among all. Some other procedures rate just a random population sample, because this procedure may be inefficient in terms of time. Most functions are designed ...