Concurrency - Parallel Execution

Data System Architecture

Concurrency - Parallel Execution

Introduction

Where a sequential execution can be imagined as a single worker on an assembly line moving between tasks, a parallel process is more like a series of workers, each doing a specific task.

It takes 4 months to grow a tomato. Can you only grow 3 tomatoes a year ??

Parallel does not mean always that your process will use another CPU. Two processes can run in parallel using only one CPU

Parallelism use is only going to increase because:

Parallel execution is the ability to :

  • divide a single operation through the hardware ressource
  • apply multiple CPU and I/O resources to the execution of a single operation.

There are three architectures and approaches to increase performance through paralleled work over additional hardware:

See also: Parallel Programming - (Function|Operation)

Implementation

mechanism by which a task can be run in parallel may be:

  • time-sharing cooperative multitasking,
  • fibers,
  • threads,
  • processes, using different hyperthreads,
  • cores,
  • CPUs,
  • machines,
  • etc.

Documentation / Reference





Discover More
Data Path From Disk To Cpu
IO - Data Path / Balanced System

The data paths is the path composed of all hardware components that are needed to get the data from: a storage device (generally disk drive or network drive) to the CPU It is important to understand...
Data System Architecture
Relational Data Modeling - Aggregate Table (Summary Table)

An Aggregate table is a persistence unit of aggregate data. Aggregate tables are also known as summary table (from summary) materialized view A aggregate is a table that contains the result of a query...
Data System Architecture
Relational Data Modeling - Normal Forms

A relational database is : in First Normal Form (1NF) if each attribute is single-valued with atomic values. in Second Normal Form (2NF) if it is in 1NF and each attribute that is not a primary key...



Share this page:
Follow us:
Task Runner