DOC PREVIEW
UCSD CSE 141L - Lecture 1

This preview shows page 1-2-3-4-5 out of 14 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1CSE 141LComputer Architecture LabSummer Session I, 2005Lecture 1Pramod V. ArgadePramod Argade Slide1-2UCSD CSE 141L, Spring 2005CSE141: Computer Architecture LabInstructor: Pramod V. Argade ([email protected])Office Hour: Tue. 7:30 - 8:50 PM (Center 105)Wed. 4:30 - 5:30 PM (EBU3 2204)TAs:Anjum Gupta: [email protected] Jianhua Liu: [email protected]:Anthony Choi: [email protected] Chin: [email protected]: LogicWorks 5, Interactive Circuit Design SoftwareCapilano Computing Systems, 2004 (Available in UCSD Bookstore.)Web-page:http://www.cse.ucsd.edu/classes/su05/cse141L2Pramod Argade Slide1-3UCSD CSE 141L, Spring 2005Prerequisites• Completed CSE 140 & 140L• Completed CSE 141 or currently enrolled in• Working knowledge of LogicWorks 4/5• Experience in C/C++ or Java and assembly programmingPramod Argade Slide1-4UCSD CSE 141L, Spring 2005Evolution of Intel Processors*ProcessorYear ofIntroduction#Transistors4004 1971 2,2508008 1972 2,5008080 1974 5,0008086 1978 29,000286 1982 120,000Intel I386 1985 275,000Intel I486 1989 1,180,000Intel Pentium 1993 3,100,000Intel Pentium II 1997 7,500,000Intel Pentium III 1999 24,000,000Intel Pentium 4 2000 42,000,000Intel Itanium 2002 220,000,000Intel Itanium 2 2003 410,000,000*http://www.intel.com/research/silicon/mooreslaw.htm1 Bit Memory: 6 Transistors1 Inverter: 2 Transistors1 NAND gate: 4 Transistors1 NOR gate: 4 Transistors3Pramod Argade Slide1-5UCSD CSE 141L, Spring 2005Pentium 2 Photomicrograph**http://microscope.fsu.edu/chipshots/pentium/pent2large.htmlPramod Argade Slide1-6UCSD CSE 141L, Spring 2005Microprocessor Design Steps• Design Instruction Set Architecture (ISA)• Develop software generation tools– Compiler, Assembler, Linker, Debugger, Libraries, ...• Code applications• Develop Instruction Set Simulator (ISS)• Run applications, gather run-time statistics, tune ISA• Design the processor, tune implementation• Verify the processor• Fabricate the chip4Pramod Argade Slide1-7UCSD CSE 141L, Spring 2005Lab Course AssignmentDesign a “Statistics Processor”Pramod Argade Slide1-8UCSD CSE 141L, Spring 2005Statistics Background• Mode– Most frequent value– Can have multiple modes– You can assume that there is only one mode for your data sets•Median– At least half the numbers in the list are less than median– Sort the list in ascending order• If odd number of elements, median is the middle value• If even number of elements, median is average of middle two values• Mean– Average of all elements– Round average up if fractional part >= 0.55Pramod Argade Slide1-9UCSD CSE 141L, Spring 2005Description of the Course• Lab1: Design Instruction Set Architecture (ISA) and code 3 programs in assembly for your machine.• Lab2: Develop an instruction set simulator (ISS) and test your programs from Lab 1.• Lab3: Develop datapath for your architecture and test it.• Lab4: Develop hardware for your processor and test your programs from Lab 1.Pramod Argade Slide1-10UCSD CSE 141L, Spring 2005CSE141L Course ScheduleLecture # Date Time Room TopicAssignmentDue1 Tue. 6/28 6 - 7:15 PM Center 105 Assignment 1: ISA -2 Tue. 7/5 6 - 7:15 PM Center 105Assignment 2: ISS& Assembler#13 Tue. 7/12 6 - 7:15 PM Center 105 Assignment 3: Datapath #24 Tue. 7/19 6 - 7:15 PM Center 105 Assignment 4: CPU #3- Tue. 7/26July 26 - 28: Students demonstrate their working CPU Design to TAs by appointment.Assignment #4 reports are due July 26th at 6 PM in the Lab (AP&M 2444?).No Lecture6Pramod Argade Slide1-11UCSD CSE 141L, Spring 2005Grading• All Labs are worth 100 points• Weight of each Lab towards final gradeLab1: 20%Lab2: 20%Lab3: 25%Lab4: 35%• Reports beginning of the class in two weeks• No late submissions!• Everyone in the group gets the same grade• Appeal grade on Lab to TA within 1 weekPramod Argade Slide1-12UCSD CSE 141L, Spring 2005Administrative• From groups of preferrably 3 students– Don’t leave without forming a group– Can’t change group w/o approval• Computer accounts distributed in class• Lab: AP&M 2444 (PCs have LogicWorks)• Unix workstations: AP&M B4027Pramod Argade Slide1-13UCSD CSE 141L, Spring 2005Academic Honesty•Do– Work within your own group• Don’t– Discuss solutions between groups– Discuss with someone who took the course before– Look at completed project of other group– Find solutions on the Web or in textbooks– Copy design from someone outside the group– Alter LogicWorks dataPramod Argade Slide1-14UCSD CSE 141L, Spring 2005Lab 1• Construct 8-bit ISA• Optimize onlyfor 3 given programs• Lab 1 due in the beginning of class July 5th• What you will turn in for this Lab• Lab report covering all the issues outlined below.• Assembly code and hand-assembled machine code for three programs in your ISA.• Instruction and data files for the three programs.8Pramod Argade Slide1-15UCSD CSE 141L, Spring 2005Program 1: Mode• D-Mem[ 0 ] = # of elements of an array of unsigned bytes • D-Mem[ 1 ] = starting address of array a[] • Find the mode, i.e. most frequent value and save it in D-Mem[ 2 ]• Initially, D-Mem[] = { 0x09, 0x06, 0xde, 0xad, 0xf0, 0x0d,0x4, 0x7, 0x4, 0x5, 0x7, 0x4, 0x5, 0x6, 0x4}Pramod Argade Slide1-16UCSD CSE 141L, Spring 2005Program 2: Median• D-Mem[ 0 ] = # of elements of an array of unsigned bytes • D-Mem[ 1 ] = starting address of array a[] • Find Median value and save it at D-Mem[ 2 ] • Initially, D-Mem[] = {0x09, 0x07, 0x10, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0x78, 0xff, 0x65, 0x55, 0xea, 0x23, 0x9d, 0x09, 0x44}9Pramod Argade Slide1-17UCSD CSE 141L, Spring 2005Bubble Sort: Early Outlimit = num - 1;flag = true;while( flag ) {flag = false;for( int i = 0; i < limit; i++ ) {if( a[ i ] < a[ i+1 ] ) {temp = a[ i ];a[ i ] = a [ i+1 ];a[ i+1 ] = temp;flag = true;}}limit = limit--;}Pramod Argade Slide1-18UCSD CSE 141L, Spring 2005Program 3: Mean• D-Mem[ 0 ] = starting address of array a[] • D-Mem[ 1 ] = 16 (# of elements of array a[] of unsigned bytes)• Find the mean (average value) for the elements of a[]• Your program may be specific to mean of 16 elements• You must round the mean to nearest unsigned byte• Initially, D-Mem[] = {0x08, 0x10, 0xde, 0xad, 0xf0, 0x0d, 0xdd, 0xdd, 0xff, 0x12, 0x80, 0x27, 0x34, 0x87, 0xce, 0x46, 0x01, 0xdd, 0x5d, 0xd8, 0x76, 0x49, 0xbf, 0x06}10Pramod Argade Slide1-19UCSD CSE 141L, Spring 2005Tips for Mean• Design specifically for count = 16• No general divide


View Full Document

UCSD CSE 141L - Lecture 1

Download Lecture 1
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture 1 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture 1 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?