Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture 15 Floating Point I 2008-02-27TA Ordinaire Dave JacobsQuote of the daywww.ocf.berkeley.edu/~djacobs "Doomsday" Seed Vault Opens"The seed bank on a remote island near the Arctic O

Berkeley - CS - 61c

UC Berkeley CS61C : Machine StructuresLecture 16 Floating Point II 2008-02-29inst.eecs.berkeley.edu/~cs61cReviewExponent tells Significand how much (2i) to count by (., 1/4, 1/2, 1, 2, .) Floating Point lets us: Represent numbers containing

Berkeley - CS - 61c

UC Berkeley CS61C : Machine StructuresLecture 17 Instruction Representation III 2008-03-03TA Matt Johnsoninst.eecs.berkeley.edu/~cs61c-tminst.eecs.berkeley.edu/~cs61ciPhone games! (and general SDK) Apple is (finally) releasing an iPhone Softw

Berkeley - CS - 61c

UC Berkeley CS61C : Machine StructuresLecture 17 Instruction Representation III 2008-03-03TA Matt Johnsoninst.eecs.berkeley.edu/~cs61c-tminst.eecs.berkeley.edu/~cs61cReview MIPS Machine Language Instruction: 32 bits representing a single inst

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61c CS61C : Machine StructuresReview C program: foo.c Compiler Assembly program: foo.s Assembler Object(mach lang module): foo.o lib.o Executable(mach lang pgm): a.out Loader Memory Linker Lecture #20 Introduction

Berkeley - CS - 61c

3/14/08inst.eecs.berkeley.edu/~cs61cReview ISA is very important abstraction layerContract between HW and SWCS61C : Machine StructuresLecture #21 State Elements: Circuits that Remember 2008-3-14 Scott Beamer, Guest Lecturer3.141592653589

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture #1 Introduction 2008-01-23"I stand on the shoulders of giants."There is one handout today at the front and middle of the room!Lecturer SOE Dan Garcia www.cs.berkeley.edu/~ddgarc

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine Structures2007-01-25Review Continued rapid improvement in computing 2X every 2.0 years in memory size; every 1.5 years in processor speed; every 1.0 year in disk capacity; Moores Law enables proces

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresNumber review.META: We often make design decisions to make HW simpleLecture 3 Introduction to the C Programming Language (pt 1) 2008-01-28Hello to Dev Anand from Pune, Maharashtra, INDI

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresMore C Pointer Dangers Declaring a pointer just allocates space to hold the pointer it does not allocate something to be pointed to! Local variables in C are not initialized, they may cont

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresReview Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection Array bounds not checked Variables not automatically in

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresReview Use handles to change pointers Create abstractions (and your own data structures) with structures Dynamically allocated heap memory must be manually deallocated in C. Use malloc()

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresReview C has 3 pools of memory Static storage: global variable storage, basically permanent, entire program run The Stack: local variable storage, parameters, return address The Heap (dyn

Berkeley - CS - 61c

inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture 8 Introduction to MIPS Assembly language : Arithmetic 2008-02-08Ni Hao to Yi Chen from CHINA!Review Several techniques for managing heap w/ malloc/free: best-, first-, next-fit,

Berkeley - CS - 61c

UCBCS61C:MachineStructuresLecture9IntroductiontoMIPS DataTransfer&DecisionsI LecturerSOE DanGarcia HitoNickCarlsonfrom UNorthernColorado inst.eecs.berkeley.edu/~cs61cReview InMIPSAssemblyLanguage: Registersreplacevariables OneInstruction(s

Berkeley - CS - 61c

UCBCS61C:MachineStructuresLecture10IntroductiontoMIPS DecisionsII LecturerSOE DanGarcia Obamasweeps8thstate inarow;it'sgettingtight! inst.eecs.berkeley.edu/~cs61cReview Memoryisbyteaddressable,butlwandswaccessonewordatatime.20080213 A

Berkeley - CS - 61c

UCBCS61C:MachineStructuresLecture11IntroductiontoMIPS ProceduresI LecturerSOE DanGarcia inst.eecs.berkeley.edu/~cs61cReview Inordertohelptheconditionalbranchesmake20080215 Internet2,anonprofitadvancedUS networkingconsortium,isdesigninga "

Berkeley - CS - 61c

UCBCS61C:MachineStructuresLecture12IntroductiontoMIPS ProceduresII&LogicalOps LecturerSOE DanGarcia inst.eecs.berkeley.edu/~cs61cReview Functionscalledwithjal,returnwithjr $ra. Thestackisyourfriend:Useittosaveanything20080220 youneed.Jus

Berkeley - CS - 61c

UCBCS61C:MachineStructuresLecture13 MIPSInstructionRepresentationI LecturerSOE DanGarcia inst.eecs.berkeley.edu/~cs61c61CLevelsofRepresentation(abstractions)High Level Language Program (e.g., C)20080222 Compiler Assembly Language Program

Berkeley - CS - 61c

UCB CS61C : Machine StructuresLecture 14 MIPS Instruction Representation IILecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cReview Simplifying MIPS: Define instructions to be2008-02-25IBM wants to use "self-assembling" nanotechnology to

Berkeley - CS - 61c

UCB CS61C : Machine StructuresLecture 18 Running a Program I(Compiling, Assembling, Linking, Loading)Lecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cReview Disassembly is simple and starts bydecoding opcode field.2008-03-04 Be crea

Berkeley - CS - 61c

UCB CS61C : Machine StructuresLecture 19 Running a Program II(Compiling, Assembling, Linking, Loading)Lecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cWhere Are We Now?2008-03-0620000 15000 10000 5000 01998 1999 2000 2001 2002 2003 20

Berkeley - CS - 61c

UC Berkeley CS61C : Machine Structures Representations of Combinatorial Logic Circuits inst.eecs.berkeley.edu/~cs61cCombinational Logic FSMs had states and transitions How to we get from one state to the next? Answer: Combinational LogicLectur

Berkeley - CS - 61c

UC Berkeley CS61C : Machine Structures Lecture 23 Combinational Logic Blocks 2008-03-19 Lecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cReview Use this table and techniques we learned to transform from 1 to anotherwww.cs.berkeley.edu/~

Berkeley - CS - 61c

Five Elements of a Computer CS61C ReviewMidterm Spring 2008 Control Datapath Memory Input OutputNegative Numbers Sign/Magnitude One's Complement Two's Complement Pros, Cons of Each C TopicsPointers! malloc, free Handles Pass by V

Berkeley - CS - 61c

Question 1: You must be kidding! (groan) (15 pts, 40 min)We have a simple linked list that consists of kids' names (a standard C string) and the grade they are in an integer between 0 (Kindergarten) and 12. The structure appears as follows, with an

Berkeley - CS - 61c

Question 1: You must be kidding! (groan) (15 pts, 40 min)We have a simple linked list that consists of kids' names (a standard C string) and the grade they are in an integer between 0 (Kindergarten) and 12. The structure appears as follows, with an

Korea University - COMPUTER S - 583

Korea University - COMPUTER S - 583

Korea University - COMPUTER S - 664

Traditional DIY approachDIY approach Do everything by yourself Design hardware CPU, Peripherals I/O and Memory address mapping Entire software ROM Bios or Monitor program Interrupt processing Application functions In charge of entire CPU

Korea University - COMPUTER S - 664

QoS-Driven Optimal Resource ManagementChang-Gun Lee Seoul National UniversityResource Assignment Problem Resources: CPU, Bandwidth, etc. Resource Assignment Problem: How much resource should be assigned to real-time tasks? Always satisfy minim

Korea University - COMPUTER S - 583

22.2 a) 1) The root of r is an articulation point of G The root of G has at least two children. - let r be the root of G. If r has no child, the G has only one vertex r. Thus r is not articulation point of G according to definition. If r has one chi

Korea University - COMPUTER S - 583

Korea University - COMPUTER S - 525A

Final Exam, Spring Semester, 2008 Data Networks Professor: Sunghyun Choi 2008-06-13 (Fri), 11am-1pm 1. (20 points) Consider a slotted Aloha with an infinite set of nodes and with "perfect capture." That is, ifmore than one packet are transmitted i

Korea University - COMPUTER S - 583

4-6 VLSI chip testingThere are four possible outcomes of a test#of good chips is more than n/2Chip A says 1. B is good2. B is good 3. B is bad 4. B is badChip B says Conclusion A is good both are good or both are bad A is bad at least A is

Korea University - COMPUTER S - 664

Scheduling of Aperiodic and Sporadic Jobs in Priority-Driven Systems - Chapter 7 (Fixed-Priority Framework)Types of Aperiodic Requests The jobs of an aperiodic task have random release times Soft aperiodic tasks: random arrivals such as a Poiss

Korea University - COMPUTER S - 664

Resources and Resource Access Control (only on Fixed-Priority System)- Chapter 8 -Overview Resource access (Mutual Exclusive) Priority inversion Unbounded priority inversion Resource access control protocol Priority inheritance protocol Pri

Korea University - COMPUTER S - 664

Real-Time Task Model - Chapter 3 -"Monolithic approach" Good enough? No! For a complex system, it is really hard to design a single superloop Really hard to validate cross-related temporal requirements So, we need a more structured way to look

Korea University - COMPUTER S - 664

Real-time Communications over Wireless Sensor NetworksInstructor: Chang-Gun LeeForest Monitoring Sensor NetworksPeriodic monitoring of forest Fast delivery of emergency event1Rescue Supporting Sensor NetworksPeriodic messages message deli

Korea University - COMPUTER S - 583

Korea University - COMPUTER S - 664

Real-Time SystemsChan-Gun LeeWhat are real-time embedded systems? Embedded Systems Cell phones, PDAs Digital cameras Microwave ovens Multimedia systems such as DVR, VOD server, etc Factory process control Radar systems Avionics Most of e

Korea University - COMPUTER S - 664

Real-Time and Embedded Systems ? - Chapter 1 & 2 -Definition is not clear!1Let's take a look at "examples"Cell phones, PDAs Digital cameras Microwave ovens Network adaptor box (e.g., ISDN adaptor) Multimedia systems such as DVR, VOD server, et

Korea University - COMPUTER S - 664

Monolithic Design ApproachISDN Terminal Adaptor (HW)TimerCPU 80186Text/ImageD/A A/DROM RAMVoice HandsetSiemens Siemens ITAC ISAC1ISDN Terminal Adaptor (SW) Control Plane: Protocol Processing Layer 2: LAPD Data link management Lay

Korea University - COMPUTER S - 664

Priority-Driven Scheduling of Periodic Tasks - Chapter 6 (Dynamic Priority (2)Summary All of the above schedulability check works only under limited conditions Preemptable at any time Context switch overhead is negligible Scheduling decision i

Korea University - COMPUTER S - 664

Objected-Oriented Real-Time System DesignMotivations Next-Generation real-time systems become Complicated Distributed Networked Examples Military unmanned command/control system City-wide disaster monitoring and management system Hospital

Korea University - COMPUTER S - 664

Real-Time Ubiquitous System: A Case Study"Combined Scheduling of Sensing and Communication for Real-Time Indoor Tracking in Assisted Living" RealLiving"M.-Y. Nam M.CS Dept. UIUCM. Z. Al-Sabbagh C.-G. Lee, J. Kim, M. Yoon AlC.ECE Dept. Ohio State

Korea University - COMPUTER S - 664

Inter-process communication (FIFO and Shared Memory)RTOS Support NOT necessarily responsible everything RTOS system callsTask Managementpthread_create pthread_setschedparam/ pri. sched pthread_make_periodic_np pthread_wait_np pthread_delete_np

Korea University - COMPUTER S - 664

Power Aware SchedulingMotivations PDAs and Pocket PCs Display, processor, hard disk, and wireless LAN card are main sources of power consumption Processor may consume up to 25% of the system power for laptop computers Technology advance in proc

Korea University - COMPUTER S - 664

Scheduling of Aperiodic and Sporadic Jobs in Priority-Driven Systems - Chapter 7 (Dynamic Priority Framework)Dynamic priority servers We focused on fixed priority servers so far. Such servers can be used along with RM. Now, we will focus on dyna

Korea University - COMPUTER S - 664

WCET AnalysisOverview Measurement method vs. Analytical method Simple analytical method Architecture-aware analysis1Why analytical methods? Measurement does NOT guarantee WCET The execution time depends on branches taken, loop count, cach

Korea University - COMPUTER S - 664

Overview of Commonly used Approaches to Real-Time Scheduling - Chapter 4 -Overview of Chapter 4 topics The nature of the "game" Overview of common approaches Clock-Driven Approach Weighted Round-Robin Approach Priority-Driven Approach EDF, LS

Korea University - COMPUTER S - 664

Priority-Driven Scheduling of Periodic Tasks (1) - Chapter 6 -Overview Reference Model Assumptions Fixed-priority vs. Dynamic Priority RM schedulable utilization bound time demand analysis EDF schedulable utilization bound time demand anal

Korea University - COMPUTER S - 664

Priority-Driven Scheduling of Periodic Tasks (2) - Chapter 6 -Schedulable utilization bound Simpler method for the schedulabiity check1Utilization A periodic task's utilization Ui of an active resource is the ratio between its execution time

Korea University - COMPUTER S - 664

Real-Time ThreadRTOS Task NOT necessarily responsible everything A big system can be partitioned into multiple functions running simultaneously One person can focus on only one function RTOS thread help this1RTOS SupportInterrupt Manageme

Korea University - COMPUTER S - 664

Priority-Driven Scheduling of Periodic Tasks - Chapter 6 (Dynamic Priority (1)Overview EDF optimality (Done!) schedulable utilization bound time demand analysis1Dynamic-priority scheduling How to assign Priorities? we already proved that

UCSD - CSE - 20

Welcome to CSE 20 Discrete MathematicsInstructor: Cynthia Lee Email: clbailey@cs.ucsd.edu* Office Hours: 2-3pm Wednesdays TA: Sat Garcia Email: sat@cs.ucsd.edu* Office Hours: 4-5pm Mondays * Questions: All non-confidential questions should be posted

UCSD - CSE - 20

CSE 20 - Gradinghttp:/www.cse.ucsd.edu/classes/su08/cse20/details.htmlCSE 20: Discrete MathBasic Info Calendar Grading Details Assignments PDF of SyllabusGrading DetailsGrades will be computed as follows: Quizzes: 30% Midterm: 30% Final: 40%

San Diego State - BIOLOGY - 201 B

Chapter 34: VertebratesBiol 201B Part 3: VertebratesAnnalisa Berta LS 250 Office Hours: MW 10:00-11:00am aberta@sunstroke.sdsu.edu Review folders: Powerpoint lectures, iQuizzes, cladograms and study questions (Blackboard) Reading: Campbell Biol

San Diego State - CHEM - 231

Version 1 (yellow) Problem 1. Rank the following six carbocations in increasing order of stability. (Least stable as #1).(7p)1CH36Benzylic cation + 3-cation 3-cationMethyl carbocation45Benzylic cation + 2-cation21-cation 2-cation3

San Diego State - CHEM - 231

C\a,- LllVersim IF,'n{+L S/V?oo 6given on the rate of the the Problem 1. Consider reactionbelow. Predictthe effect of the changes (20p) reaction. Explain your reasoning! H3c^Br * @oa*r"11. -cHtcHto\H3c-r'o-rrH3 + -9 "P^P,E+rr,.,to A)

San Diego State - CHEM - 231

Chem 231 Lab Final Study Guide Experiment 1- Recrystallization Know the properties of the recrystallizing solvents (see the first hand-out I gave you) Know the purpose of taking a melting point Understand how recrystallization worksExperiment 2- Fr