The concept of process-parallel computing, Computer Engineering

Assignment Help:

The Concept of Process

Informally, a method is a program in execution, behind the program has been loaded in the main memory. However, a method is more than just a program code. A process has its own value of program counter, address space, threads, and temporary variables, file handles, security attributes, return addresses etc.

Each process has a life cycle, which consists of execution, creation and termination phases.  A process may create numerous new processes, which in turn may also make a latest process. In UNIX operating system surroundings, a new process is shaped by fork system call. Process creation needs the subsequent four actions:

i)  Setting up the process description: Setting up the process description need the design of a Process Control Block (PCB). A PCB includes basic data such as, process status, owner, description of the allocated address space, process identification number, and much other implementation dependent process explicit information essential for process management.

ii) Allocating an address space:  There are only two ways to allocate address space to processes: allocating separate space to each process or sharing the address space among the created processes

iii) Loading the program into the allocated address space: The executable program file is fully loaded into the allocated memory space.

iv) Passing the process description to the process scheduler:  Once, the three steps ofProcess formation as mention above are finished, the information gathered through the above-mentioned steps is sent to the process scheduler who allocate processor(s) resources to many competing to-be-executed processes queue.

The process execution phase is guarded by the process scheduler. Process scheduling may be per thread or per process. The process scheduling engage three concepts: state transition, process state, and scheduling policy.

A process may be in one of the following states:

(1)   Running: The process is being implemented on a multiple processors or Single processor.

(2)   New: The process is being formed.

(3)   Ready: The process is prepared to be executed if a processor is accessible.

(4)   Waiting: The process is coming up for some event to happen.

(5)   Terminated: The process has complete execution.

At the time, a process may be in some one of the above mentioned states. As soon as the process is declare into job queue, it goes into equipped state. When the process scheduler transmits the process, its state become running. If the process is completely executed then it is terminated and we say that it is in final state. However, the process may go back to complete state due to some interrupts or may go to ahead of you state due to some I/O activity. When I/O activity is ended it may go to ready state. The state transition diagram is shown in Figure 1:

                                        935_The Concept of Process.png

The scheduling policy may be also pre-emptive or non pre-emptive. In pre-emptive policy, the process can be interrupted. Operating systems have dissimilar scheduling policies. For example, to select a process to be implemented, one of the best scheduling policy may be: First In First Out (FIFO).When the process completed execution it is ended by system calls like abort, releasing all the allocated resources.


Related Discussions:- The concept of process-parallel computing

Draw back of assigning one bit position to control signals, What is the dra...

What is the draw back of assigning one bit position to each control signals? Assigning individual bits to every control signal results in long microinstructions due to the numb

Computer systems architecture, Assume that you are working in a software co...

Assume that you are working in a software company as a programmer and a bank is your company's client. The Bank is a most popular and one of the leading banks in Malaysia. Your

What do you mean by manual assembly, Q. What do you mean by Manual Assembly...

Q. What do you mean by Manual Assembly? It was an old method which required the programmer to translate every opcode in its numerical machine language representation by search

Instruction pipeline-level of processing, Classification according to level...

Classification according to level of processing According to this classification, computer operations are classified as arithmetic operations and instruction implementation. Ne

Adbms, what are the different way of executing pipelines

what are the different way of executing pipelines

A global variable is a variable, A global variable is a variable A globa...

A global variable is a variable A global variable is declared outside the body of each function.

Define the while loop, The while Loop The while loop repeats a statemen...

The while Loop The while loop repeats a statement until the test at the top proves false. As an example, here is a function to return the length of a string. int string_leng

What is the advantage of caching in a web browser, What is the advantage of...

What is the advantage of caching in a web browser? Like other application browsers utilize a cache to enhance document access. The browser places a copy of all items it retriev

Register addressing mode - computer architecture , Register Addressing mode...

Register Addressing mode - computer architecture: Register Addressing: Register addressing mode is same to direct addressing. Only difference in between is that the addre

Micro processor code, Suppose that the working register W contains the valu...

Suppose that the working register W contains the value 0x4F, the register FSR contains the value 0x2B; the register with address 0x2B contains 0x2F and the instruction ADDWF INDF,

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