1 / 107

אימות רכיב מרובה מעבדים Validation of a Multi-Core Chip

PLURALITY. אימות רכיב מרובה מעבדים Validation of a Multi-Core Chip. מצגת אמצע Mid Presentation Project period : 2 semesters Starting semester: winter 2010/2011. Performed by : Malik Kittani, Ayman Mouallem Supervisor : Moshe Bensal. PLURALITY. Plurality – Reminder.

joshwa
Download Presentation

אימות רכיב מרובה מעבדים Validation of a Multi-Core Chip

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. PLURALITY אימות רכיב מרובה מעבדיםValidation of a Multi-Core Chip מצגת אמצע Mid Presentation Project period : 2 semesters Starting semester: winter 2010/2011 Performed by : Malik Kittani, Ayman Mouallem Supervisor : Moshe Bensal

  2. PLURALITY Plurality – Reminder This is a Blocks diagram that describes the basics of Plurality system, the system that we are going to test through this project, with all its components.

  3. PLURALITY Reminder About PLURALITY : • * The cores • - 16-256 of 32-RISC SPARC Hyper-core processor • - Perform basic arithmetic operations • * Co-Processor • - One helper unit for each 4 cores • - Perform multiplication and division • * Central Synchronization Unit (CSU) - scheduler • Distributes the tasks between the cores with minimal overhead • * Shared memory system • -Allows any number of cores to access data and instruction memory at every clock cycles

  4. PLURALITY Project Objectives : • Understand Plurality's HAL Architecture. • Understand Plurality’s Simulator and its capabilities. • Learning, designing of several testing • methods for single core • Implementing of several testing methods for single core • Expanding the testing to multi-core architecture .

  5. PLURALITY PROGRESS SO FAR : • Learning the compiling, execution and debugging process using the simulator and the Eclipse [done] :- we managed to test the system by running few program that were previously designed by the students of the faculty such as : Hello World , FFT, etc…and we saw that the system re-acts • Learning and Programming in Task Oriented Programming (TOP) method[done]. • Learning about cornerstones of chip testing field[done] : • Observabilityand Controllability: we have explored what features Plurality have in order to do this. • Building A skeleton and ideas for the tests that we are going to build until the end of the semester [done] . • Midterm Presentation.

  6. PLURALITY What are we going to test at the current semester ?! • Current perspective : • This Is a new hardware. Is every component working as it should ?! • Are all the components connected and can pass data between them ? • Is all the memory space addressable ? And can be read and written ?! • Are all the components needed for a single core working correctly ? (program counter, register file, ALU, FPU, Memory).

  7. PLURALITY Problems that we faced until now : As we have mentioned before, in the Characterization Presentation, Plurality is having financial problems, therefore we couldn’t get any support of them in order to solve the problems we faced. We tried to cope with the problems in another ways. These ways, maybe, are not the right ways that are used in the industry. But are the best ways that we could think about, considering the lack of tools that we have in hands. In some components, such like FPU, in order to get maximal coverage fault of the components, we must know how these components are built. And since we don’t have that information, we will assume that these components are built in a standard way.

  8. PLURALITY Problems that we faced until now : • Controllability – how to control data flow : Plurality haven’t exposed or published any paper about the features of controllability that it had in it’s chip, for example; Since we don’t have a built in DFT for registers, we can’t write to a specific register using C-language, because it depends on how the compiler translate high level language to machine language. • Solution: We will try to control the data through forcing values by using assembly code of the chip.

  9. PLURALITY Problems that we faced until now : • Automatic Compiler Optimizations: When compiling C-code, the compiler make some optimizations for the code. Therefore, after compilation, the machine code that we get is different than the one we intended to get for our test. • Solution: We will give a “-o1” flag in the command line of the GCC compiler. This flag prevents the compiler of making optimizations to the assembly code that we use in the tests. Using command line (or through eclipse) we can view the Assembly code of the test, and make sure that no optimizations were made.

  10. PLURALITY Problems that we faced until now : • Memory hierarchy : When we test the memory, we shall read and write to all the physical addresses. And since we don’t know how the memory is build, and how it’s divided between the stack, data, and instruction sections, we might write data to the instructions section or stack section that stores the data of the running test. And by doing this we will destroy the test flow. • Solution: We will create files of ones and zeros or sequence of zeros and ones , and read them. After that we will dump all the memory to a file. When we view this file, we can guess what are the physical addresses of the memory that we can validate. We will check only this area of the memory.

  11. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  12. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  13. PLURALITY Basic Test/Program Counter: In order to validate the program counter, we choose a well know test bench that is called “Dhrystone Benchmark”. This benchmark includes variety of tests for assignments, control statements, procedures, and function calls. We will re-write that test bench in away that we can run it on plurality’s hardware.

  14. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  15. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  16. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  17. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  18. PLURALITY ALU- Shifter testing: We adopt a deterministic test strategy that tests the shifter by performing the ROR/ROL operations 2n+3 times(where n is the word length) starting from value 1. This test code achieves 100% fault coverage.

  19. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  20. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  21. PLURALITY ALU- logic operations: We adopt a deterministic test strategy that tests the “logic” part of the ALU by performing the logical operations : OR, AND, XOR, XNOR,NOT and CMP.This test strategy is general enough and it can be applied to various ALU designs. Test pattern generation is performed by putting the four possible combinations of values all 0's and all 1's. This test code achieves the below fault coverage [3] WORD LENGTH ARCHITECTURE FAULT COVERAG 32 bits SEP - RCA 100.0% 32 bits SEP - CLA 99.9% 32 bits COM - CLA 99.9% where SEP=separate arithmetic logical part of the ALU, COM=combined arithmetic/logical part of the ALU, RCA=ripple-carry adder and CLA=carry look ahead adder.

  22. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  23. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  24. PLURALITY ALU- Arithmetic operations[ADD, SUB]: Here we will use a strategy that is similar to the strategy used in logical operations test, including more special cases(8) because of the Carry bit that we have.

  25. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  26. PLURALITY ALU: We will divide the ALU test to four parts : Basic Arithmetic Operations Shift operations Logic Operations Multiplier

  27. PLURALITY ALU- Multiplier operation: We adopt a determinist test strategy for multiplier-accumulator pairs. As it was proven theoretically and experimentally that this method achieves very high fault coverage. The method takes two words X and Y, and focus on 4 bits of each word respectively. This way we can get 256 possibilities of multiplication values.

  28. PLURALITY ALU- Multiplier operation: The derived code achieves after compaction, the results shown in the following Table for various architectures [3]. WORD LENGTH ARCHITECTUREFAULT COVERAGE 32 bits CSA - RCA 99.5% 32 bits CSA - CLA 99.3% 32bitsBWM - RCA 99.3% 32bitsBWM - CLA 99.2% where CSA=cany save array multiplier, BWM=Booth encoded tree (Wallace) multiplier, RCA=ripple-carry adder and CLA=canylookahead adder

  29. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  30. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  31. PLURALITY FPU: The FPU can be build in a lot of ways. Therefore we will assume that it is build according to IEEE standard(IEEE 754). The FPU is a complexed unit, and under the lack of time that we have through this project, we can’t get a high fault coverage percentage. Therefore we will run tens of small tests to test extreme cases such as : dividing by zero, overflow, etc…

  32. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  33. PLURALITY Tests Block Diagram: In this project we managed to divide the components to five categories : Basic Test/Program Counter ALU FPU Memory Register file

  34. PLURALITY Memory Testing: Production tests objective is to verify that the device works correctly at speed throughout all the operation conditions. In addition, maximum coverage and minimum time for execution are two main properties required for production test algorithms. All of the existing memory test algorithms were developed based on their ability to detect functional faults. Based on their complexities, simple algorithms such as zero-one and checkerboard tests are believed to be able to detect some simple functional faults such as the stuck-at fault. More complex algorithms, such as march 13N, can detect almost all the functional faults.

  35. PLURALITY Memory Testing: Explanation on memory faults : Address Decoder Fault (AF) : A defect on the memory array, can happen within the address decoder or the read and write logic as well as on the row and column decoder. Stuck At Fault (SAF) : The memory cell contains either a zero or a one all the time and cannot change the state of the cell. Transition Fault (TF) : The memory cell can change from one state to the other but fails to go back to the initial state.

  36. PLURALITY Memory Testing: Explanation on memory faults : Stuck-Open Fault (SOF) : In this case, the memory cell is not accessible by either the write or read action. Coupling Fault (CF) : Every time the memory cell is accessed by a write or read, the content of the cells next to it change their values. Data Retention Fault (DRF) : The memory cell loses its data after a certain time.

  37. PLURALITY Memory Testing [iv]:

  38. PLURALITY Memory Testing: We choose to implement two of these algorithms: The first algorithm can locate only one of these faults – GALPAT - > GALROW. The second algorithm can detect all of these faults- March 13N

  39. PLURALITY Memory Testing: GALPAT : This algorithm is also known as Galloping 1/0 test. 32 31 ….. 4 3 2 1 0 - - - - - - - - 0 1 2 3 4 . . . N-2 N-1 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

  40. PLURALITY Memory Testing: GALPAT : The algorithm first initializes all memory cells to '0'. 32 31 ….. 4 3 2 1 0 0 0 0 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  41. PLURALITY Memory Testing: GALPAT : Then, for each cell, it writes 'l', read all the cells and then writes back '0' to that cell. 32 31 ….. 4 3 2 1 0 0 0 0 0 0 0 1 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  42. PLURALITY Memory Testing: GALPAT : Then, for each cell, it writes 'l', read all the cells and then writes back '0' to that cell. 32 31 ….. 4 3 2 1 0 0 0 0 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  43. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 0 0 0 0 1 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  44. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 0 0 0 1 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  45. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 0 0 1 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  46. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 0 1 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  47. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 0 1 0 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  48. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 1 0 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  49. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 1 0 0 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

  50. PLURALITY Memory Testing: GALPAT : The procedure looks like that a '1' is shifting its position from cell to cell throughout the whole memory. 32 31 ….. 4 3 2 1 0 0 0 0 0 0 0 0 0 1 2 3 4 … N-2 N-1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 … … … … … … … 0 0 0 0 0 0 0 0 0 0 0 0 0 0

More Related