Skip to main content

Register and type of register in computer Architecture-computer world

 Register and type of register in computer Architecture


Register : register is very fast computer memory used to store data in execution. A register is consist of a group of flip-flop and gates. The flip flop hold the binary information and gates control when and how new information is transferred into a register.

Types of register 

  1. Input/output adders register
  2. Input/output buffer register
  3. Program counter(PC)
  4. Data register
  5. Accumulator register(AC)

Input/output address register : Each input/output device connector to our computer is mapped to a unique input/output address. These address are assigned to every input/output port on our computer. Including USB, Ethernet as well as any other ports or computer might having a unique address assign to each port allow our computer to easily recognize and locate device attache to computer. 

Input/output buffer register : This register is used for exchanging the data between the input/output module and the processor. 

Program counter (PC) : This register is used for hold the address of instruction and execute these instruction at current time.

Data register (DR) : Data register is used by the microcomputers for storing the data temporary the trans-meted to and from peripheral devices.

Accumulator register(AC) : Accumulator register is used for store Arithmetic and logic data in a computer CPU.  


Comments

Post a Comment

Popular posts from this blog

Deadlock in operating system-computer world

  Deadlock in operating system-computer world Deadlock :  In a multi-programming environment, many process may complete for a minute number of resources. A process make a request for a resource and if the resource is not available at that time, the process enter In a waiting state. A waiting state process is never again-able to change state because the resource it has requested is held by other waiting process. This situation is called deadlock. So we can say that a process is said to be deadlock when it is waiting for an event or resources which will never occurs.   so we can say that in this situation none of the process gets executed  since the resource it needs, is held by some other process which is also waits for some other resource to be released.  Let's assume that there are three process P1, P2, p3 and three different resources R1, R2 and R3. R1 is assigned to p1, R2 is assigned to P2 and R3 is assigned to P3.   After sometime P1 demands for R1 which is being used by  P2.
9 comments
Read more

CPU scheduling in operating system-computer world

  CPU scheduling in operating system CPU scheduling :  Whenever the CPU becomes idle, the operating system must select one of the processes. The selection process is carried by the short-term scheduler. The scheduler selects a process from the processes in memory that that are ready to execute and allocate the CPU to that process. The objective of time sharing is to skip the CPU among processes that user interact with each program while the program is in running position. As we discuss above the process scheduler selects an process for execution on the CPU. There will never more then one running process for a single processor system. If there are many processes, the process will have to wait until the CPU is free CPU Scheduling is basis of multi-programming operating system. In CPU scheduling many processes are kept in memory at a time. The CPU scheduler select a process from the many processes. The process scheduler scheduled different processes to be assigned to the CPU based on part
3 comments
Read more

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

  Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system Single partition allocation In this scheme operating system is residing in law memory and user process are executing in higher memory. Advantages It is simple  It is easy to understand and use Disadvantages User job is limited to the size of available memory. It leads to poor Utilization of processor and memory. Multiple-partition allocation  It is the simplest method for allocating  memory is divided memory into several fixed size partitions. Fixed Equal-size partitions It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes. Advantages It supports multi programming. A process whose size is less then or equal to the partitions size can be loaded into any available partition. Disadvantages If a program is big to fit into a partition use overlay te
Post a Comment
Read more