Explain the concept of thread, Computer Engineering

Assignment Help:

The Concept of Thread

A thread is a sequential flow of control within a process. A process is able to have one or more threads. Threads have their own register-values and program-counter but they share memory space and other resources of the process. Every process begins with a single thread. Through the execution, other threads can be created as and when required. Similar to processes, every thread has an execution state (terminated, ready, blocked or running). A thread has right to use the memory address space and resources of its process. Threads have similar life cycles as processes do. A single processor system may support concurrency by switching execution among two or more threads. A multi processor system may support parallel concurrency by executing a separate thread on every processor. There are three fundamental techniques in concurrent programming languages for terminating and creating threads: 

  • Unsynchronised creation and termination - In this mode threads are created and terminated by means of library functions for example START_PROCESS, CREATE_PROCESS, START_THREAD, CREATE_THREAD and. Thus because of these function calls a new thread or process is created and starts executing independent of its parents.
  • Synchronized termination and unsynchronised creation: This manner uses two instructions: JOIN and FORK. The FORK instruction creates a new thread or process. When the parent needs the child's (thread or process) result, it calls JOIN instruction. At this junction two processes (threads) are synchronised.
  • Synchronised termination and creation: The most often system construct to implement synchronization is COBEGIN...COEND. The threads among the COBEGIN...COEND construct are implemented in parallel. The termination of parent-child is suspended till all child threads are terminated.

We can think of a thread as essentially a lightweight process. Though, threads propose a number of advantages over processes. The advantages are as follows:

a)  It does not take so much time to create and terminate a new thread than to create and terminate a process. The reason is that a newly created thread uses the current process address space.  

b)  It does not take so much time to switch between two threads within a common process, partly since the newly created thread uses current process address space. 

c)  Less communication overheads -- communicating between the threads of one process is simple since the threads share amongst other entities the address space. So, data generated by one thread is right away available to all other threads.


Related Discussions:- Explain the concept of thread

Determine the order in which optimized c-scan would service, Consider the s...

Consider the situation in which the disk read/write head is currently located at track 45 (of tracks 0-255) and moving in the positive direction. Assume that the following track re

Show encoding data options, Q. Show Encoding data options? PVM uses SUN...

Q. Show Encoding data options? PVM uses SUN's XDR library to make a machine independent data format if you request it. Settings for encoding option are:  PvmDataDefault: Use

Proof by contradiction - artificial intelligence, Proof by Contradiction - ...

Proof by Contradiction - Artificial intelligence So, both backward chaining andforward chaining have drawbacks. Another approach is to think regarding proving theorems by contr

What is event-driven control, What is event-driven control? Control res...

What is event-driven control? Control resides within a dispatcher or monitors that language, subsystem or OS provider. Developers attach application process to events and dispa

Write an algorithm to outline the macro-expansion, Write an algorithm to ou...

Write an algorithm to outline the macro-expansion using macro-expansion counter. The flow of control throughout macro expansion can be implemented by using a MEC that is macro-

Describe the necessary conditions for deadlock, Describe the necessary cond...

Describe the necessary conditions for Deadlock. Required conditions for deadlock 1. Mutual exclusion 2. Hold and wait 3. No preemption 4. Circular wait Mutual e

Discuss program testing and debugging in detail, Discuss program testing an...

Discuss program testing and debugging in detail. In program debugging and testing significant steps are as follows: a. For the program, construction of test data b. Analy

Define compilers with high level programming language, Define Compilers wit...

Define Compilers with High Level Programming Language? All high-level programming language (except strictly interpretive languages) comes with a compiler. Effectively the compi

Combining logic gates - boolean algebra, More complicated logic circuits ca...

More complicated logic circuits can be made byconnecting a number of simple logic gates.How do we decide how to connect the gates togive a particular function e.g. output Y?We need

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd