Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Multiple Instruction and Single Data stream (MISD): In this type of organization multiple processing elements are ordered under the control of multiple control units. Every control unit is managing one instruction stream and processed by its consequent processing element. However every processing element is processing just a single data stream at a time. Consequently, for managing multiple instruction streams in addition of single data stream, multiple processing elements and multiple control units are organised in this categorization. All processing elements are interacting with the common mutual memory for the organisation of single data stream as displayed in Figure. The simply known illustration of a computer capable of MISD function is the C.mmp made by Carnegie-Mellon University.
This kind of computer organisation is represented as:
Is > 1
Ds = 1
Figure: MISD Organisation
This categorization isn't popular in commercial machines as model of single data streams implementing on multiple processors is hardly ever applied. However for the particular applications, MISD organisation can be extremely helpful. E.g. Real time computers should be fault tolerant where various processors execute the similar data for generating the redundant data. This is also termed as N- version programming. All these redundant data are compared as results that must be same; or else faulty entity is replaced. So MISD machines can be applied to fault tolerant real time computers.
Explain the difference between depth first and breadth first traversing techniques of a graph. Depth-first search is dissimilar from Breadth-first search in the following way
Consider the following pseudo-code segment. 1. input y {y is a three-digit hexadecimal number} 2. d ← 0 3. for i = 1 to 3 3.1. char ← i th character from y readin
How are problems of clock skew minimized? Clock skew, when done right, can also benefit a circuit. This can be intentionally introduced to reduce the clock period, at that the
what are the fundamental data structures
Explain adaptive routing. Adaptive routing defines the ability of a system, by which routes are characterised through their destination, to change the path that the route takes
1+3+5+....... +11
Algorithm to insert a key in B-tree is as follows: 1. First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into
can u please tell me the assembly language program for carry look ahead adder that can run in 8086 emulator?? its urgent
write a program insert and remove value in queue.
Creating Files for Writing Only Creating Files for Writing Only : To create a text file for writing only, pass "w" into fopen as the second argument. This example follows along
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd