المساعد الشخصي الرقمي

مشاهدة النسخة كاملة : Digital Design Laboratory.. Full Adder Lab .. الجامع التام


فيزيائي 2009
20-12-2009, 00:20
Digital Design Laboratory


Full Adder Lab

Introduction to the Xilinx Foundation System -
Schematic entry, Functional Simulation and Implementation

Purpose:

The purpose of this lab is:

1. To design and simulate a Full Adder circuit.
2. To implement the circuit in a FPGA
3. To test the full adder circuit


Background:

The Half Adder of the previous lab adds two bits and generates a Sum and Carry-out output. However, to be useful for adding binary words, one needs a Full Adder (FA) which has three inputs: the augend, the addend, and a Carry-in. The following example illustrates the addition of two 4-bit words A(A3A2A1A0) and B(B3B2B1B0).


Figure 1: Addition of binary numbers

The addition can be split-up in bit slices. Each slice performs the addition of the bits Ai, Bi and the Carry-in bit Ci (= Carry-out bit of the previous slice). Each slice consists of a full adder, illustrated below.


Figure 2: Block diagram of a full adder (FA)

A circuit that implements a full adder is given in Figure 3 below.


Figure 3: Logic diagram of a Full Adder

The circuit consists of two XOR gates, two AND gates and one OR gate. The XOR=AÅB, also called exclusive OR, is defined by the following truth table.



INPUTS

Out
A

B

XOR
0

0

0
0

1

1
1

0

1
1

1

0

Pre-lab assignment:

Before coming to the lab read the pre-lab section and answer all the questions. Write the derivations down in your lab notebook. See guidelines on keeping a notebook. Failing to do the pre-lab in advance will make it impossible to finish the actual lab on time.

1. Read
1. Section on "Design Implementation" (part a on Implementation).
2. Section on "Downloading the design to the FPGA" - digilab board
3. Description of the "Digilab board".
2. Reviewing: if you have not read the following sections, read them now
1. Section on "Design Flow Overview" , :Devices" and "Projecct Manager" of the tutorial "Getting started with the Xilinx Foundation Tools".
2. Section on "Entering a Schematic design"
3. Section on "Functional Simulation"
3. Pre-lab Questions (answers need to be submitted on Blackboard)

1. A full adder can be defined by its truth table. Fill out the following truth table for the Sum S and Carry-out Co signal.

Inputs Outputs
A B C Sum Co
0 0 0 . .
0 0 1 . .
0 1 0 . .
0 1 1 . .
1 0 0 . .
1 0 1 . .
1 1 0 . .
1 1 1 . .


2. Write down the logic expression of a Sum and Carry-out bits, based on the logic diagram of Figure 3. Use the Å symbol for the XOR operator (note: when entering your answer in Blackboard, use the $ symbol for the XOR gate).

3. Verify that the expressions for S and Co derived above correspond to the outputs defined in the truth table of question 1. Check for the 8 possible combintations of the input signals and write down the corresponding outputs S and Co.

Various questions on the sections "Design Implementation", "Downloading" and the "Digilab board". Read these sections before answering the Prelab questions on Blackboard.

4. List the different steps of the implementation process of a FPGA.

5. During what step of the implementation process can part of the logic be removed (“trimmed”)?

6. What does NGD stand for?

7. When downloading a design onto a FPGA using the Digilab board, what type of communication is used?

8. What type of FPGA device (give the device family) is on the Digilab board?

9. Suppose you would like to use the General Purpose Switches, SW6, SW7 and SW8 of the Digilab board to apply the inputs A, B and C, respectively. What pin numbers on the FPGA should you connect the inputs to?

10. To display the outputs S and Co on the LEDs 7 and 8, respectively, of the Digilab board, what pin numbers should you use of the signals S and Co?

11. The parallel port on the Digilab Board can be used for two purposes: (1) Programming the FPGA and (2) Parallel data communication. Which switch determines the mode of the parallel port. Give the switch number.

12. What is the power supply needed for the Spartan and the Spartan XL FPGA family of devices?

In-lab assignment:


A. Parts and Equipment:

1. PC with the Xilinx Foundation F2.1i software
2. Digilab board

B. Experiments


Read the instructions carefully before doing the lab

You will enter the schematic and simulate the Sum and Carry-out function on the Xilinx Foundation Tools. This will be done by following the procedure explained in the tutorial webpages. Instead of doing the example in the tutorial you will be implementing the S and Co function in one schematic.

1. First create a folder users\your_name on the C: drive in which you will save your project. Give it your last name. Don't use a name which is longer than 8 characters. Xilinx will cause problems later on whenever you use names of folders and files which have more than 8 characteres. When you create a project in Xilinx, the program creates a new folder with the same name as the project as well as a PDF (project description) file, which it uses to recognize projects. Both of these items should be placed in your folder.

2. General Information (read this first before doing the assignment explained in section 3 below).
You will implement the schematic diagram of the Sum and Co functions shown in Figure 3. Follow the step by step instructions in the tutorial. Save the schematic as "MYFA.SCH". The inputs should be connected to an input pad (IPAD) with buffer and the output pins should be connected to an output pad (OPAD) with buffer (see example of Fig. 5 of Schematic tutorial). It is a good practice to place the logic gates first and connect them later. Try to be neat and organized when you draw the schematic. You will be graded on the neatness of it. Also, it will be much easier to read a schematic when it is clearly organized. Make sure you name the input and output nets with the names A, B, C, Sum and Co, respectively.

3. Start with the tutorial "Creating a new Project: Schematic Entry" on the Tutorial webpages. Instead of implementing the comparator circuit of Fig. 1 of the tutorial you will design the Full Adder of the pre-lab.

o Launch the Xilinx Foundation Software by clicking on the Xilinx Foundation Project Manager Icon on the desktop.
o Open a new project and give it the name, MYFA (Don't give it the name of EasyProj). This project should be created in your folder (directory) that you just created: c:\users\your_name\). Use the Browse button to locate your directory (folder) on the C: drive.
o Under the flow, select Schematic.
o For Type, fill select F2.1i
o For family select from the pull-down menu "Spartan XL" (when using the Digilab board), XC4000E (when using the FPGA demoboard), XC5000XL (when using the XS40 board) or XS9500 (when using the XS95 board).
o For Part use S10XLPC84 (when using the Digilab Board), 4010EPC84 (FPGA demobaord - or name of the chip corresponding to the FPGA device on the FPGA demo board), 4005XLPC84 (XS40 board), or 95108PC84 (XS95 board). This refers to the target device you will later use to actually implement your design. You can change this at a later time.
o For speed, select grade 4 (can be changed later during the implementation process)

4. Proceed with the schematic entry as explained in the remainder of the tutorial (TOOLS -> DESIGN ENTRY -> SCHEMATIC ENTRY; or click on the Schematic Entry icon). It is a good idea to specify the page size before drawing the schematic otherwise the schematic may print too small. Go to FILE -> PAGE set up in the Schematic Editor window. Specify A size (8"x11").

Start drawing the schematic. Add pin locations using the Symbol Properties window (Parameter Name: LOC and Parameter Description: P#) by double clicking on the pads. Choose the pin numbers according to the board you are using. Here are some sugggestions for the different boards:

o Digilab board: connect the inputs to the general purpose switches SW1, SW2, SW3: e.g. A(P28), B(P27), and C(P26); connect the outputs to the LEDs, e.g. S(LD1 on pin P69) and Co(LD2 on pin P68).
o XS40 board: connect the inputs to the parallel port PC, e.g. A (P44), B(P45), C(P46); connect the output to a segment of the LED display, e.g. S (P19) and Co(P25). For a schematic drawing of the XS40 board and the position of the LEDs, click here.
o XS95 board: A (P46), B(P47), C(P48); connect the output to a segment of the LED display, e.g. S (P15) and Co(P21). For a schematic drawing of the XS95 board and the position of the LEDs, click here
o FPGA demoboard: connect the inputs to one of the general purpose switches SW3, e.g. A(P19), B(P20), C(P23); connect the output to one of the bar LEDs, e.g. S(P61) and Co(P62). For a schematic drawing of the demoboard and the position of the switches and LEDs, click here.

When finished save the schematic. Put your name in the little table at the bottom right hand side of the sheet. This can be done by going to the FILE -> TABLE SETUP menu item (type in your and your partners name, Lab 2, Lab Title).

5. Next, you will do a functional simulation in order to check that the logic circuit gives you the required function (but no information yet about timing or delays; that will come later). Follow the tutorial on Functional Simulation for the Sum and Carry-out circuit.

Do now the Functional Simulation. Make sure that the "Functional" appears in the pull down menu at the bottom of the simulator window.

Check that your circuit works as expected and compare it with the truth table given in the pre-lab. Verify each entry. If the circuit does not work properly, check your schematic and correct it. Read also the section on "Common Mistakes". When you modify your schematic you should update the simulator. When the schematic has been modified save it and go to the OPTIONS menu -> EXPORT NETLIST and UPDATE SIMULATION in order to ensure that the simulator will use the latest schematic.

6. If the circuit works as expected write your name and date on the waveform (using the Graphics Tools by clicking on the bottom icon on the left side icon bar) and (select the bottom signal in the Waveform viewer and go to WAVEFORM -> COMMENTS window). Instead of printing the schematic and the waveforms, you will capture a screen of it and save it as a GIF file for insertion in your report. You can use the screen capture program (Hypersnap DX) that is installed on each PC. To find out how to use it, click on Hypersnap.

7. Implementation and testing

To download your design into the FPGA (or CPLD) and verify experimentally that your circuit functions properly, you will first generate a configuration file. This is done as follows:

1. Implementation: follow the instructions in the "Implementation Tutorial". When you are finished with the implementation, a bitstream file will be generated in your project directory. If you are using an FPGA, this file will be called: myfa.bit; for a CPLD based design, the file will be called myfa.svf. If the implementation was successful, you can check the pin assignments by selecting the Reports tap in the right window pane of the Project Manager. Double click the Implementation Reports folder to open the Report Browser File. Double click on the Pad Report and check the pin assignments. Here is a summary of the steps involved in the implementation process:
1. In the Project Manager window, click on the Implementation Icon in the Flow tab of the window. If you get the message: "Schematic netlist is older than schematic. Update netlist from Schematic editor?" click YES.
2. In the Implement Window, select the proper device: for the Digilab board select S10XLPC84 (or S05XLPC84 depending on the FPGA on the board), for the XS40 board select 4005XLPC84, for the XS95 select 95108PC84 and for the FPGA demobaord select 4010EPC84 (some boards may be populated with a 4005EP84 FPGA - check the actual board you have available in the lab or ask the lab instructor if not sure).
3. Click RUN. This will launch the Flow Engine. When the implementation process is done a small window will pop up letting you know that the implementation was completed successfully. If errors occurs, check the implementation reports: in the Project Manager window, click on the Reports tab and double click on the Implementation Report files. Open the last report and check which error occured. Correct the errors. To implement the revision, go to the PROJECT -> CREATE REVISION in the Project Manager window. Click on the RUN button
4. For more information on the implementation, consult the tutorial or the user's guide.
5. In case you are using the XC95 board, you need to do one additional step in order to translate the bitstream in the correct format (for the XS40 ro FPGA demobaord, you can skip these steps).:
1. In the Porject Manager, click on the Programming Icon. This will open the JTAG Programmer window.
2. In the JTAG programmer window, go to OUTPUT -> CREATE SVF File.
3. In the Option window, select Through Test-Logic-Reset".
4. Save the .svf file
5. Select OPERATION -> PROGRAM in the JTAG programming window. Click OK.
6. When successful, close the JTAG programming window.
2. Downloading the design (configuring the device). This procedure will be slightly different depending on the type of board you are using. Follow the instruction for your board.
1. Digilab Board
2. FPGA Demoboard
3. XS40 Board
4. XS95 Board
3. Testing your circuit.
o If you are using the Digilab board or the FPGA board, set the switches SW for different values of the inputs A, B and C; check the corresponding outputs S and Co on the bar LEDs. Make a table in your lab notebook and write down the value of the inputs A,B and C with the corresponding outputs Sum and Co. Compare this table with the truth table for full adder. There is one interesting aspect you should be aware of when using the FPGA demoboard, the LEDs are "active-low". This means that the LED will light up when the applied signal is low and will go off when the signal is high.
o If you are using the XS40 or XS95 board you can use the GXSPORT utility (in the XSTOOLS/BIN directory, click on GXSPORT). In the gsxport window, set the value of the data bits corresponding to the input signals, as defined on the schematic (e.g A(D0), B(D1) and C(D2)). Go through the various combinations and check the corresponding output S and Co. If you check off the Count box, every time you click on the strobe button, the counter will advance by one bit (See below). Make a table in your lab notebook and write down the value of the inputs A,B and C with the corresponding outputs Sum and Co. Compare this table with the truth table for the full adder.

Figure 1: GXSPORT used to apply test signals over the parallel port to the FPGA
8. Saving or archiving your design: It will be a good idea to save your project as you will be making use of the full adder at a later time. Do not expect to find your project on the PC when you come back! First archive your project: Select FILE -> ARCHIVE in the Project Manager window and follow the Archive Project Wizard. This will generate a MYFA.zip file in your folder. Next you can save your project either on a floppy (if the file is not too large) or on a Zip disk Alternatively you can ftp your archived project to any other computer that is connected to the network. In case you did not archive the project, you need to transfer both the .pdf file and the project folder (in this case Myfa.pdf AND Myfa folder)!

If you have problems with any of the above tasks, see the instructor, TA or one of the consultants during the scheduled lab times.

Hand-in (at the start of next lab)

You have to hand in a short lab report that contains the following (see also Guidelines of Lab Report):

1. Course Title, Lab no, Lab title, your names and date
2. Since the Pre-lab has been submitted online, there is no need to repeat it here.
3. Section on the lab experiment:
1. Brief description of the lab experiment including the goals and discussion on the theory of operation (if applicable).
2. Schematics of the circuit (insert the screen capture of your schematic - make sure your names is on it)
3. Simulation waveform (use the screen shot of the timing waveforms with your names on it)
4. Review of the results indicating that the circuit function properly. You can for instance give a truth table and indicate that for each entry the logic simulator give the right results. Feel free to label the waveforms to indicate the proper operation.
4. Conclusion or discussion (if appropriate).

The lab report is an important part of the laboratory. Write it carefully, be clear and well organized. It is the only way to convey that you did a great job in the lab. It is preferred (but not necessary) that you type the lab report. The report is due at the start of the next lab session.

Back to ESE201 homepage
Created by Jan Van der Spiegel; September 12, 1997; Updated by J. Van der Spiegel, September 9, 2004.
Copyright, J. Van der Spiegel, 2004

فيزيائي 2009
20-12-2009, 00:20
http://www.seas.upenn.edu/~ese201/lab/LabFullAdder/LabFullAdderF01.html

فيزيائي 2009
20-12-2009, 00:26
اسئلة امتحانات في الدوائر المنطقية .. الجامع التام والنصفي ..

Sample Exam Questions


1) Explain the following terms:
• Carry select
• Reduction of summands (multiplication)
• Multiplicative division.
• non-restoring division
• size gap
• CISC

2)
a) Name major characteristics of the RISC philosophy:
b) Name major characteristics of the CISC philosophy:

3)
A program contains the following instruction mix:
• 60% load/store instructions with execution time of 1.2 microsecond each
• 10% ALU instructions with execution time of 0.8 microsecond each
• 30% branch instructions with execution time of 1.0 microsecond each
a) If the clock period is 0.2 microsecond, calculate the average clock cycles per instruction (CPI) for the program.
b) What is the average million-instruction per second (MIPS) rate of the program?

4)
Assume floating point square root (FPSQR) is responsible for 25% of the execution time of a benchmark on a machine. One proposal is to add FPSQR hardware that will speed up this operation by a factor of 10. The other alternative is just to make all floating point (FP) instructions run two times faster. FP instructions are responsible for a total of 40% of the execution time. Compare performance of these two design alternatives.

5)
Assume we have a machine where the CPI is 2.0 when all memory accesses (instruction fetches and data fetches) hit in the cache. The only data accesses are loads and stores (note, these are one address type instructions), and these total 40% of the instructions (the rest of instructions are dealing with registers). If the miss penalty is 25 clock cycles and the miss rate is 2%, how much faster would the machine be if all accesses were cache hits?

6)
A RISC type workstation uses a 15-MHz processor with a claimed 10-MIPS rating to execute a given program mix. Assume a one-cycle delay for each memory access:
a) What is the effective CPI of this computer?
b) Suppose the processor is being upgraded with a 30-MHz clock. However, the speed of the memory subsystem remains unchanged, and consequently two clock cycles are needed per memory access. If 30% of the instructions require one memory access and another 5% require two memory accesses per instruction, what is the performance of the upgraded processor with a compatible instruction set and equal instruction counts in the given program mix?

7)
Three enhancements with the following speedups are proposed:
Speedup1 = 30
Speedup2 = 20
Speedup3 = 10
Only one enhancement is usable at a time:
a) If enhancements 1 and 2 are each usable for 30% of the time, what fraction of the time must enhancement 3 be used to achieve an overall speedup of 10?
b) Assume the distribution of enhancement usage is 30%, 30%, and 20% for enhancements 1, 2, and 3, respectively. Assuming all three enhancements are in use, for what fraction of the reduced execution time is no enhancement in use?
c) Assume for some benchmark, the fraction of use is 15% for each of the enhancements 1 and 2 and 70% for enhancement 3. We want to maximize performance. If only one enhancement can be implemented, which should be chosen?

8)
a) As a performance metric define MIPS
b) It has been discussed that MIPS is not an accurate measure for comparing performance among computers justify this. Note, I need a discussion that is straight-forward and clear.

9)
a) Cray Y-MP/8 (a vector processor) has a cycle time of 6ns. During a cycle, the results of both an addition and a multiplication can be completed. Furthermore, there are eight processors operating simultaneously without interference in the best case. Calculate the peak performance of the Cray Y-MP/8 (in MIPS).


10)
Consider the time needed to transfer a block of data from the main memory to the cache when a read miss occurs. Cache block size is 8 words, it takes one clock cycle to send an address to the main memory, it takes 8 clock cycles to read the first word and subsequent words are read in 4 clock cycles per word, finally one clock cycle is needed to send one word to the cache.
a) If a single memory module is used, then what is the time needed to load a block from main memory into cache.
b) Now assume that the memory is 4-way interleaved, then what is the time needed to load a block from main memory into cache.
c) Now assume the computer has L1 and L2 caches, each with block size of 8 words. Hit rate is the same for both caches and that it is 0.95 and 0.90 for instructions and data, respectively. Finally, the time needed to access an 8-word block in these caches are C1=1 and C2=10 cycles:
a. What is the average access time experienced by the processor during an instruction cycle, if the main memory uses interleaving (30% of instructions are load/store) (use parameters defined earlier)?
b. What is the average access time during an instruction cycle, if the main memory is not interleaved?
c. What is the improvement obtained with interleaving?

11)
Calculate the execution time of a parallel adder augmented by the carry look-ahead scheme1 where operands are 64-bit long. Note, the basic building blocks are a collection of eight full adders, and within each basic building block it takes 1d delay to generate ps and gs, 2d extra delay to generate carries, and 1d extra delay to generate sums (Show your work in detail).

12)
Calculate the execution time of a 30-bit parallel adder augmented by carry-select scheme. Note: each basic building block is a cascade of six full adders (show your work step-by-step).

13)
Calculate the execution time of a 64-bit parallel adder augmented by carry-select scheme. Note: each basic building block is a cascade of eight full adders (show your work step-by-step).

14)
Calculate the execution time of a parallel adder augmented by the carry look-ahead scheme1 where operands are 32-bit long. Note, the basic building blocks are a collection of six full adders (Show your work in detail).

15)
Figure 1 shows the ith stage logic of a parallel ALU: Where (Ai, Bi and Ci) are the operands and the carry-in, respectively, and (S2, S1, S0 and M) are the control signals. Determine under what values of S2, S1, S0, M, and C1 (carry-in to the right most stage) the ALU performs the following operation:

a) F A - B (Why?)
b) F B (Why?).


Figure 1

16)
Booth algorithm is a technique that allows multiplication of two 2s complement numbers:

a) True or false; On the average Booth algorithm is faster than add-and-shift algorithm (justify your answer)?
b) Booth algorithm can be extended by checking three bits of multiplicand in one loop iteration. Compare and contrast traditional Booth algorithm with extended Booth algorithm.
c) Extended Booth algorithm can be further modified by checking group of more than three bits in each iterations (say 4, 5, …). However, in practice rarely, Booth algorithm based on grouping of more than three bits has been implemented. Why (clear explanation)?
d) Apply extended Booth algorithm (group of 3 bits) to perform the following multiplication:
a. Multiplier 1000111
b. Multiplicand 1111000

17)
a) The "add and shift" algorithm can be used to multiply two signed numbers (say A and B) in 1s complement format. Calculate the correction term, where A is negative and B is positive.
b) Apply your conclusion from part (a) to perform the following operation using "add and shift" algorithm (show step-by-step operation).
101001
* 010011
Note: numbers are in 1s complement format.

18)
a) The "add and shift" algorithm can be used to multiply two negative numbers (say A and B) in 2s complement format. Calculate the correction term.
b) Apply your conclusion from part (a) to perform the following operation using "add and shift" algorithm (show step-by-step operation).
101001
* 110011
Note: numbers are in 2s complement format.

19)
Apply the Column Compression technique to perform the following operation:
111001
* 111101
Note: numbers are in 2s complement format.

20)
a) Apply the Reduction of Summands technique to perform the following operation (show your work step-by-step):
101011
* 110101
b) Calculate the execution time of a Full Adder Tree when performing a 16*16 multiplication (show your work).

21)
Apply the Column Compression technique to perform the following operation:
101011
* 110101
Note: numbers are in 2s complement format (show your work in detail).

22)
Apply the Column Compression technique to perform the following operation:
111011
* 110111
Note: numbers are in 2s complement format (show your work in detail).

23)
Apply Hurson's scheme to perform the following operation in which numbers are in 2s complement format:
1101101 * 0101101
Show your work and explain each action step-by-step.

24)
Apply the Column Compression technique to perform the following operation (show your work):
101001
* 111101

25)
a) Draw the block diagram of a "full adder tree" for multiplication of two n-bit numbers.
b) Discuss the sequence of the operations in a "full adder tree".
c) Calculate the execution time of an 8*8 "full adder tree" (show your work and explain why).

26)
Apply reduction of summands scheme (using half and full adders) to perform the following operation:
1 1 0 0 0 1 1 * 0 1 1 0 0 1 0
Note: operands are unsigned numbers.

27)
Apply reduction of summands scheme (using half and full adders) to perform the following operation:
1 1 0 1 1 1 1 * 0 1 1 0 0 1 1
Calculate the execution time of the operation (show the work). Note: operands are in 2s complement format.

28)
Apply column compression scheme to perform the following operation:
1 1 0 0 0 1 1 * 0 1 1 0 0 1 0
Calculate the execution time of the operation (show the work).

29)
Apply the Column Compression technique to perform the following operation:
1110111
* 1101011
Note: numbers are in 2s complement format.

30)
Use SRT division method to perform the following operation:
AQ/B where AQ = .00100011
B = .0111
Show step-by-step operation.

31)
Use SRT division method to perform the following operation:
AQ/B where AQ = .00100000
B = .0110
Show step-by-step operation.

32)
Use SRT method to perform
AQ/B where AQ = .0010100100 and
B = .01111 (Show step by step operations.)

33)
Use SRT division method to perform the following operation:
AQ/B where AQ = .11001100
B = .0111
Show step-by-step operation.

34)
As a computer architect, in the design process of an ALU, what initial issues one have to keep in mind? Name them and discuss about their importance.

35)
a) Explain access gap as clearly as possible.
b) Discuss, in detail, three distinct directions that reduce the access gap.

36)
a) Compare and contrast low-order interleaving against high-order interleaving (I need clear discussion).
b) A 16-way interleaved memory is used for program storage. It is found that the branching probability  of the memory-request queue is 0.25. What is the average number of instruction words accessed per memory cycle?

37)
Explain what factors degrade the performance of an interleaved memory. Why?

38)
Calculate the average duration of an instruction cycle for a Harvard-machine organization, where:
instructions are in the form of
R  R <op> <operand>, and
there are two types of instructions:
Type1: te ≤ ts
Type2: te > ts
te and ts are the instruction execution time and the main memory regeneration time, respectively.

39)
Within the scope of interleaved memory:
a) What factors affect efficiency the most?
b) Prove part (a).

40)
a) Define term “interleave memory”,
b) Define high-order interleaving,
c) Define low-order interleaving,
d) Compare and contrast high-order interleaving with low-order interleaving,
e) Two issues affect performance of an interleave memory:
a. What are they,
b. Show (proof) how do they affect the effectiveness of the interleave memory
f) With respect to the part (e), discuss about solutions (one for each case).

41)
a) A memory is n-way interleaved if:
1)
2)
3)
b) Define high-order interleaving,
c) Define low-order interleaving,
d) Address accessible memory can be classified as:
1)
2)
3)
e) Explain access gap as clearly as possible.

42)
Assume we are utilizing a parallel disk (RAID) composed of 6 and 8 disks (# of data disks available). Calculate space utilization of each configuration for various redundancy schemes (show your work):
Redundancy Space Utilization%
Configuration
6 disks 8 disks
Level 0
Level 1
Level 0+1
Level 3
Level 4
Level 5
Level 6

43)
Assume we are utilizing a parallel disk (RAID) composed of 6 and 8 disks (# of data disks available). Calculate space utilization of each configuration for various redundancy schemes (show your work):
Redundancy Space Utilization%
Configuration 6 disks 8 disks
Level 0
Level 1
Level 0+1
Level 3
Level 4
Level 5
Level 6

44)
“A programmer should avoid the application of branch instructions in a program.” Clearly name and discuss three architectural concepts that support it.


45) All homework problems and quizzes

فيزيائي 2009
20-12-2009, 00:28
شـكــ وبارك الله فيك ـــرا لك ... لك مني أجمل تحية .