How can arithmetic processor be associated to the CPU, Computer Engineering

Assignment Help:

Q. How can this arithmetic processor be associated to the CPU? 

Two mechanisms are used for connecting arithmetic processor to CPU.  

If an arithmetic processor is treated as one of the Input / Output or peripheral units then it's termed as a peripheral processor. CPU transmitsinstructions and data to peripheral processor that performs the needed operations on data and communicates the results back to CPU. A peripheral processor has various registers to communicate with the CPU. These registers can be addressed by CPU as I/O register addresses. Peripheral and CPU processors are generally quite independent and communicate with each other by exchange of information using data transfer instructions. Data transfer instructions should be specific instructions in CPU. This kind of connection is known as loosely coupled.

Instead if the arithmetic processor has a register and instruction set that can be considered an extension of CPU registers and instruction set then it is known as a tightly coupled processor. Here CPU reserves a special subset of code for arithmetic processor. In such a system the instructions meant for arithmetic processor are fetched by CPU and decoded mutually by CPU and arithmetic processor and finally executed by arithmetic processor. So these processors can be considered a logical extension of CPU. These kind of attached arithmetic processors are called as co-processors.  

The concept of co-processor existed in 8086 machine until Intel 486 machines where co-processor was separate. But Pentium at present doesn't have a separate co-processor. In the same way peripheral processors aren't found as arithmetic processors in general. Though many chips are used for specialized I/O architecture.


Related Discussions:- How can arithmetic processor be associated to the CPU

Explain frequency-division multiplexing, Q. Explain Frequency-division mult...

Q. Explain Frequency-division multiplexing? Frequency-division multiplexing (FDM) is a technique for data transmission widely used in telephone, radio, and cable TV systems in

Which method is used for resolving data dependency, Which method is used fo...

Which method is used for resolving data dependency conflict by the compiler itself?  (A) Delayed load.   (B) operand forwarding.   (C) Pre fetch target instruction.  (D) loo

What is ale and explain the functions of ale in 8085, ALE-> Address latch e...

ALE-> Address latch enable...In the case of microcontroller (8051)& microprocessor 8085 the data line and low order 8 bit address lines are multiplexed. In order to getting address

Determine the importance of computer hardware, Determine the importance of ...

Determine the importance of computer Hardware Hardware forms the greatest asset of the company, but it reaches obsolescence very quickly. Normally, it is said that every six mo

Give an account of issue pertaining in c language, Give an account of the i...

Give an account of the issue pertaining to compilation of if statement in C language Control structures as if cause significant gap in between the PL domain and the execution d

Illustrate layout of magnetic disk, Q. Illustrate Layout of Magnetic Disk? ...

Q. Illustrate Layout of Magnetic Disk? Head is a relatively small device capable of reading from or writing to a part of platter rotating beneath it. This gives rise to organiz

Multithreaded architecture, Multithreaded Architecture:  It is clear now th...

Multithreaded Architecture:  It is clear now that if we give many contexts to multiple threads, then processors with multiple contexts are known as multithreaded systems. These sys

Main drawbacks of cd-roms, Q. Main drawbacks of CD-ROMs? The main drawb...

Q. Main drawbacks of CD-ROMs? The main drawbacks of CD-ROMs are: It is read only thus can't be updated Access time is longer than that of magnetic disks. Very

Data mining, what is data mining and what is its uses in a industry?

what is data mining and what is its uses in a industry?

Graph has a minimum spanning tree already computed, Assume that a graph has...

Assume that a graph has a minimum spanning tree already computed.  How fastly can the minimum spanning tree be updated if a new vertex and incident edges are added to G? If the

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