Explain threads in details?, Operating System

What are threads?

A thread - sometimes called as an implementation context or a lightweight process - is a single sequential flow of control within a program. We use threads to separate tasks. While we run one of the applets it creates a thread that performs the operation. Every thread is a sequential flow of control within the same program (the browser). Every operation runs independently from the others but at the same time.

A thread is alike to the sequential programs described previously. A single thread as well has a beginning and a sequence and an end. At any given point of time during the runtime of the thread there is a single point of execution. Though, a thread itself isn't a program; a thread can't run on its own. Relatively it runs within a program.

A thread is the single sequential flow of control within a program. Threads perform two or more tasks at once. The real excitement surrounding threads isn't about a single sequential thread. Relatively, it is about the use of multiple threads running at the same time and performing different tasks in a single program.

A Web browser is an instance of a multithreaded application. Within a usual browser, you are able to scroll a page while it is downloading an image or an applet, play sound and animation concurrently and print a page in the background while you download a new page or watch three sorting algorithms race to the finish.

Some texts call a thread as a lightweight process. A thread is alike to a real process in that both have a single sequential flow of control. Though, a thread is considered as a lightweight for the reason that it runs within the context of a full-blown program and takes advantage of the resources allocated for that program and the program's environment.

The same as a sequential flow of control, a thread ought to carve out some of its own resources within a running program. For instance, a thread should have its own execution stack and program counter. The code running inside the thread works merely within that context. Some other texts use implementation context as a synonym for thread.


Result of calling the start method on a Thread object:

 

1. The thread goes into the Runnable position and the run method is invoked.

The two ways you are able to provide the implementation for a thread's run method:

 

1. Create a Thread subclass that dominates the run method.

2. Write a class that executes the Runnable interface and the run method

Posted Date: 6/22/2013 7:06:14 AM | Location : United States







Related Discussions:- Explain threads in details?, Assignment Help, Ask Question on Explain threads in details?, Get Answer, Expert's Help, Explain threads in details? Discussions

Write discussion on Explain threads in details?
Your posts are moderated
Related Questions
What is an acyclic graph? A tree that has been corrupted by links to other branches, but does not have any cyclic paths in it.

Explain the Thread Contextual Data  Threads in Net Ware carry additional context as well. Per-thread, stacks, errno, Net Ware Errno, t_errno and others are available to the ap

Can you give me assistance on my operating system assignment?

Calculate the Average Waiting Time CPU burst time points out the time, the process needs the CPU. The subsequent are the set of processes with their respective CPU burst time (

What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type

You have a system with two primary workloads. One performs sequential access to a set of large files, the other performs small, independent, random reads to a separate set of large

Explain a boot control block A boot control block can have the information required by the system to boot an operating from that partition. If the disk does not have an operati

Q. Describe the purpose of the open() and close() operations. Answer: The open() operation notifies the system that the named file is about to become active. The c

Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c

Paging: Only the needed memory pages are moved to main memory from the swap machine for execution. Process size does not matter. Produce the concept of the virtual memory. It