0% found this document useful (0 votes)
46 views11 pages

Parallel DB

Parallel database systems consist of multiple processors and disks connected by a fast network. There are four main architectures: shared memory, shared disk, shared nothing, and hierarchical. Shared memory has common memory accessible by all processors but does not scale well. Shared disk has all processors accessing all disks through a network, bottlenecking disk access. Shared nothing has independent nodes of processor, memory, and disks communicating over a network, scaling to thousands of processors without interference but increasing communication costs. Hierarchical combines characteristics of the other architectures, with top level as shared nothing and lower levels as shared memory or shared disk.

Uploaded by

deepen1989
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
46 views11 pages

Parallel DB

Parallel database systems consist of multiple processors and disks connected by a fast network. There are four main architectures: shared memory, shared disk, shared nothing, and hierarchical. Shared memory has common memory accessible by all processors but does not scale well. Shared disk has all processors accessing all disks through a network, bottlenecking disk access. Shared nothing has independent nodes of processor, memory, and disks communicating over a network, scaling to thousands of processors without interference but increasing communication costs. Hierarchical combines characteristics of the other architectures, with top level as shared nothing and lower levels as shared memory or shared disk.

Uploaded by

deepen1989
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

BY- Deepen Teraiya

PARALLEL SYSTEM
 Parallel database systems consist of multiple
processors and multiple disks connected by a
fast interconnection network.

 Two main performance measures:


 Throughput:- The number of tasks that can be
completed in a given time interval.
 Response Time:- The amount of time it takes to
complete a single task from the time it is
submitted.
 Bus:- System components send data on and
receive data from a single communication
bus.
 Mesh:- Components are arranged as nodes in
a grid, and each component is connected to
all adjacent components.
 Hypercube:- Components are numbered in
binary; components are connected to one
another if their binary representations differ
in exactly one bit.
There are four main architecture have been
proposed for building parallel DBMS.

1. Shared memory
2. Shared disk
3. Shared nothing
4. Hierarchical
1.Processors and disks have access to a
common memory, typically via a bus or
through an interconnection network.

2.Extremely efficient communication


between processors — data in shared
memory can be accessed by any
processor without having to move it
using software.

3.Downside – architecture is not scalable


beyond 32 or 64 processors since the bus
or the interconnection network becomes
a bottleneck
1.All processors can directly access all disks
via an interconnection network, but the
processors have private memories.

2.Examples: IBM Sysplex and DEC clusters


(now part of Compaq) running Rdb (now
Oracle Rdb) were early commercial users

3.Downside: bottleneck now occurs at


interconnection to the disk subsystem.

4.Shared-disk systems can scale to a


somewhat larger number of processors, but
communication between processors is
slower.
1.Node consists of a processor, memory, and one
or more disks. Processors at one node
communicate with another processor at another
node using an interconnection network. A node
functions as the server for the data on the disk or
disks the node owns.

2.Examples: Teradata, Tandem, Oracle-n CUBE

3.Data accessed from local disks (and local memory


accesses) do not pass through interconnection
network, thereby minimizing the interference of
resource sharing.

4.Shared-nothing multiprocessors can be scaled up


to thousands of processors without interference.

5.Main drawback: cost of communication and non-


local disk access; sending data involves software
interaction at both ends.
Combines characteristics of shared-memory,
shared-disk, and shared-nothing architectures.

Top level is a shared-nothing architecture – nodes


connected by an interconnection network, and
do not share disks or memory with each other.

Each node of the system could be shared-memory


system with a few processors.

Alternatively, each node could be a shared-disk


system, and each of the systems sharing a set of
disks could be a shared-memory system.

Reduce the complexity of programming such


systems by distributed virtual-memory architectures
Also called non-uniform memory architecture
(NUMA)

You might also like