# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

1 Page

### extra2

Course: CS 232, Fall 2008
School: University of Illinois,...
Rating:

Word Count: 132

#### Document Preview

232: CS Extra Credit 2 Caches Due in section, or by 11/14 10am 1. If a cache requires N bits to implement and can store n bits of data, the space overhead is defined as N - n. Assuming a 32-bit address, consider a direct-mapped cache capable of holding B blocks of data, where each block contains b bytes (both B and b are powers of two). What is the space overhead this for cache? 2. Suppose the cache in Problem...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Illinois >> University of Illinois, Urbana Champaign >> CS 232

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
232: CS Extra Credit 2 Caches Due in section, or by 11/14 10am 1. If a cache requires N bits to implement and can store n bits of data, the space overhead is defined as N - n. Assuming a 32-bit address, consider a direct-mapped cache capable of holding B blocks of data, where each block contains b bytes (both B and b are powers of two). What is the space overhead this for cache? 2. Suppose the cache in Problem 1 is modified as follows: it is now a 2k -way associative cache, capable of holding the same number of bits of data as the cache in Problem 1. What is the space ov...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

University of Illinois, Urbana Champaign - CS - 232
CS232 Fall 2005Discussion 12: Virtual MemoryNovember 28-29, 20051. Consider a system with the following processor components and policies: L1 cache: Direct-mapped, size = 4KB, block size = 16 bytes, indexed and tagged using physical addresses,
University of Illinois, Urbana Champaign - CS - 232
WhyVirtualMemory? Mem[4000]virtual(notphysical)Reason1 Reason2 Reason31WhyVirtualMemory? Mem[4000]virtual(notphysical)Runprogramsthatcantfitinmemory2WhyVirtualMemory? Mem[4000]virtual(notphysical)Programscanusechosenaddressnorecompilat
Unix System AdministrationChris Schenk Lecture 27 Tuesday Apr 28CSCI 4113, Spring 2009Question Which of these passwords is ok to use? A) 'test' B) 'password' C) 'test123' D) 'changeme' E) The one I use everywhere elseInformation Secur
UMass Dartmouth - ECE - 560
ECe560-S'09Application of Gordon/Newell Theorem &amp; Algorithm (I) Example: consider a closed QN p QSolution to Hands-on Problems in L#17 Number of jobs: N=3 Number of nodes: K=3 K 3 Service times exponentially distributed with: Scheduling dis
UMass Dartmouth - ECE - 591
ECE 591 Project Presentation Guidelines Spring 2009Instructor: Dr. Liudong Xing Department of Electrical and Computer Engineering University of Massachusetts DartmouthEach team is expected to give a 20-minute presentation, with time for questions
UMass Dartmouth - ECE - 560
ECE560: Computer Systems Performance EvaluationLecture #20Petri Nets OverviewInstructor: Dr. Liudong Xing II-214A, Spring 2008Administrative Issues(April 22, Tuesday) Homework #6 solution available from the course website Homework #7 Due o
UMass Dartmouth - ECE - 454
Fall'08ECE454/544: Fault-Tolerant Computing &amp; Reliability EngineeringLecture #19 Availability Modeling and Analysis (I) Instructor: Dr. Liudong XingAdministrative Issues ECE544 project Project final abstract due 5 pm, Dec. 5 (Fri.) Project p
UMass Dartmouth - ECE - 454
Fall'08ECE454/544: Fault-Tolerant Computing &amp; Reliability EngineeringLecture #15 Reliability Analysis Using Markov Models (I) Instructor: Dr. Liudong Xing Fall 2008Administrative Issues (10/29/2008, Wednesday) ECE544 project meeting Due by F
Stanford - PUBS - 22322
Stanford - CME - 325
CME325, winter 08, Wednesday Feb 131. Initial-value problems (IVP), well-posedness and stability, periodic problems 2. Initial-boundary-value problems (IBVP), well-posedness and stability by energy estimates 3. Stability, Convergence and Accuracy 4.
UMass Dartmouth - PSY - 506
Correlation and RegressionPreparation for Ch. 1 Review undergraduate presentations Correlation as descriptive and/or inferential statistic Regression as predicting individual performance Restructure your understanding Correlation/regression i
Imaging CancersVisualizing cancers for improved diagnosis of neoplasmsEarly detection is key to dealing effectively with cancer Early detection means that the tumor is still small, so there are fewer cells to kill Early detection reduces chances
Stanford - PUBS - 8750
SLAC-PUB-8853The Generalized Uncertainty Principle and Black Hole Remnants*Ronald J. Adler Gravity Probe B, W. W. Hansen Experimental Physics Laboratory Stanford University, Stanford CA 94035 Pisin Chen Stanford Linear Accelerator Center Stanford
Stanford - PUBS - 4250
SLAC-PUB-4271 March 1987 T/ETHE BETHE-MAXIMONRESULT*RICHARD BLANKENBECLER AND SIDNEYStanford StanfordD. DRELLLinear AcceleratorStanford,CenterUniversity,California,94305ABSTRACTWe develop and illustrate one-particle quantum a v
Stanford - PUBS - 7250
SLACPUB7422 May 1997Emittance Studies of the BNL/SLAC/UCLA 1.6 cell Photocathode rf GunD. T. Palmer , X. J. Wangy , R. H. Miller , M. Babzieny , I. Ben-Zviy , C. Pellegrini , J. Sheehany, J. Skaritkay , H. Winick , M. Woodley , V. Yakimenkoy943
Idaho - CE - 573
Transportation Planning CE 573Course Introduction and Four-Step Travel Demand Moding (FSTDM)Issues for Today Course introduction Systematic transportation system evaluation Introduction to travel demand modelingCourse Topics Travel demand mo
Idaho - CE - 573
Trip Generation ModelingObjectives Use terminology Understand Variables Learn growth factoringTrip Generation Terminology Journey (a.k.a. trip): one-way movement from a point of origin to a point of destination to satisfy the need or demand f
Idaho - CE - 573
Trip Generation Modeling Cross-ClassificationCE 573 Transportation Planning Lecture 2 (2nd part)Cross-classification (category analysis): Introduction Trip production:h p = trip purpose i = zone h = household type groupingOip = ai (h)t p (
Idaho - CE - 573
Number of households per cell and mean trip rates Households 0 car 1 car 2 + cars Total 1 person 28 21 0 2 or 3 person 150 201 93 4 persons 61 90 75 5 persons 37 142 90 Total 276 454 258 Mean trip rate 0.73 1.53 2.4449 444 226 269 988Mean trip ra
Idaho - CE - 573
Trip rate Households Income10.4 100 400001040Income levels Household size levels Trip rates Income (\$1,000) 20 40 603 3Household size 1 2 4+ 8 10.4 10 14 11 15.512 16 18.2
Idaho - CE - 573
Trip Generation Modeling Linear RegressionCE 573 Transportation Planning Lecture 5Objectives Regression review Trip generation and regression05/22/09Michael Dixon2Linear Regression Review Raw data Dependent variable (Y) Independent va
Idaho - CE - 573
Income linear regression m total trips = a + bAverage autos Average income 1.5 35 X autos Household ID Autos 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 X income Income 0 0 0
Idaho - CE - 573
Minimum Cost Path Tree BuildingCE 573 Transportation Planning Lecture 11Objectives Review Four Step Travel Demand Model (FSTDM) framework Minimum Cost Path Tree Building Dijkstra's Algorithm05/22/09Michael Dixon2Four Step Travel Demand
Idaho - CE - 573
Example: Take a look at the following network and find the minimum cost path tree from node A using the travel times given for each linkA5 min 1 15 min 9 min 3DB10 min 2 16 min 5 6 12 minEC4 6 min 7What is the minimum path tree? What
Idaho - CE - 573
Trip Distribution Modeling Part IICE 573 Transportation Planning Lecture 13Objectives Trip length distribution Model constraints Converting to Origin-Destination (O-D) format05/22/09Michael Dixon2Trip Length Distribution (TLD) Survey o
Idaho - CE - 573
Trip Length DistributionCost-Bin TLDobs 2.5 329 7.5 780 12.5 1164 17.5 702 22.5 796 27.5 451Intrazonal Travel Times (min)Zone 1 2 3 4 1 2.5 22 12 7 Zone 2 25 2.5 28 11 3 18 28 2.5 17 4 7 29 22 2.5Relating Zone pairs to cost-bins by travel time
Idaho - CE - 573
Trip Distribution Modeling Part IIICE 573 Transportation Planning Lecture 14Objectives Growth factoring Types of constraints Methods05/22/09Michael Dixon2Growth Factoring Concept: XFUTURE = XNOW*(growth factor) Applications Beyond
Idaho - CE - 573
Given 1 2 3 Dest. Vol Target 1 100 200 50 350 500 2 200 100 75 375 6003 Origin vol Target 150 450 900 50 350 500 200 325 800 400 1125 2200 1100 2200 Sum of the target origin volumes equals the sum of the tarstep 1 (b = 1 solve for a) 1 200 285.71
Idaho - CE - 573
Mode ChoiceCE 573 Transportation Planning Lecture 15Objectives mode split (choice) concept place in four-step-travel-demand-model (FSTDM) cause and effect model mode choice05/22/09Michael Dixon2What is mode split (choice)? Given an O
Idaho - CE - 573
Traffic Assignment Part ICE 573 Transportation Planning Lecture 16Objectives Define traffic assignment assumptions Mathematically define relationship between OD trips and network Load traffic onto the network05/22/09Michael Dixon2Networ
Idaho - CE - 573
O-D Pairs A,A A,B A,C A,D A,E B,A B,B B,C B,D B,E C,A C,B C,C C,D C,E D,A D,B D,C D,D D,E E,A E,B E,C E,D E,E1-2 0 1 1 1 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 02-3 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 01-4 0 0 0 0 0 0 0 0 0 0 0 0 0
Idaho - CE - 573
Traffic Assignment Part IICE 573 Transportation Planning Lecture 17Objectives Understand user equilibrium Execute a link cost update Communicate capacity restrained traffic assignment concept Execute incremental assignment05/22/09Michael D
Idaho - CE - 573
O-D Pairs A,A A,B A,C A,D A,E B,A B,B B,C B,D B,E C,A C,B C,C C,D C,E D,A D,B D,C D,D D,E E,A E,B E,C E,D E,E1-2 0 1 1 1 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 02-3 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 01-4 0 0 0 0 0 0 0 0 0 0 0 0 0
Idaho - CE - 573
Solution of example given in Modeling Transport by Ortuzar and Willumsen, 3rd ed. Step size Town Route Town Route Bypass Route Bypass Route Iteration task Flows Cost Flows Cost Initialized V and C 0 10 0 15 1 F Fa - Van V and C F Fa - Van V and C F
Idaho - CE - 573
Quiz 5: FOUR STEP TRAVEL DEMAND MODEL MAIN PROGRAM SCHEDULE YOUR MEETING WITH ME (Friday, March 9: 10:00 AM 2:00 PM) E-MAIL YOUR PROGRAM TO ME BEFORE YOUR SCHEDULED MEETING Perform the following tasks: A. 1) 2) 3) Integrate the following programs: t
Idaho - CE - 573
Session 11: Model Calibration, Validation, and Reasonableness ChecksS o urc e : NHI c o urs e o n T ra ve l De m a nd Fo re c a s ting (152054A) Terminology Model Calibration Model Validation Reasonableness checks Sensitivity checksIs
Idaho - CE - 573
Selection of land use Code Mid-Rise Apartments Land use code is 223 (Mid-Rise Apartments). Size 160 dwelling units Time period AM peak hour of generator Select regression equation, average, or field data collection Step 1: Is the land use compatible
Idaho - CE - 573
Conducting a Trip Generation StudyWhen to Collect Data Not covered by the ITE land use classification Location is in CBD Significant multi-modal component Size of site is not within ITE data range Insufficient sample size Inadequate statisti
Idaho - CE - 573
Homework 2 1. Determine the number of trips produced for each zone given the following information and using the cross-classification method. The data are also contained in the spreadsheet provided for this assignment problem.Regional Auto Ownership
Idaho - CE - 573
Regional Auto Ownership (percentage by income level) Income Autos/HH (\$1,000) 0 1 2 3+ 10 48 48 4 0 20 4 72 24 0 30 2 53 40 5 40 1 32 52 15 50 0 19 56 25 60 0 10 60 30Number of Households 1 100 200 400 250 200 150 2 0 0 100 200 300 100 Zone 3 0 200
Idaho - CE - 573
Household ID Autos 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52Income 0 0 0 0 0 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 0 0 0 0 0 1 1 1 1 1 2 2 2 2 2 3 3 3
Idaho - CE - 573
Homework 3 1. Repeat problem 1 of Homework 2 using the spreadsheet provided for the problem and VBA. Remember, you need to determine the number of trips produced for each zone given the following information and using the cross-classification method.
Idaho - CE - 573
Regional Auto Ownership (percentage by income level) Income Autos/HH (\$1,000) 0 1 2 3+ 10 48 48 4 0 20 4 72 24 0 30 2 53 40 5 40 1 32 52 15 50 0 19 56 25 60 0 10 60 30Number of Households 1 100 200 400 250 200 150 2 0 0 100 200 300 100 Zone 3 0 200
Idaho - CE - 573
Regional Auto Ownership (percentage by income level) Income Autos/HH (\$1,000) 0 1 2 3+ 10 48 48 4 0 20 4 72 24 0 30 2 53 40 5 40 1 32 52 15 50 0 19 56 25 60 0 10 60 30Number of Households 1 100 200 400 250 200 150 2 0 0 100 200 300 100 Zone 3 0 200
Idaho - CE - 573
CE 573 Urban Transportation PlanningHomework 41) You have been tracking an indicator of construction cost per mile of facility. The target value is 1.1 million dollars. Based on the data that you have collected from 18 different projects, the sam
Idaho - CE - 573
You have been tracking an indicator of construction cost per mile of facility. The targe value is 1.1 million dollars. Based on the data that you have collected from 18 different projects, the sample mean is 1.3 million with a sample standard deviati
Idaho - CE - 573
Homework 6 1. Use Dijkstra's algorithm to complete the in-class example. 2. Use Dijkstra's algorithm to determine three minimum cost path trees for the network shown below for nodes 2, 4, and 8 as origins, respectively.1 1.88 miles 42.63 miles1.
Idaho - CE - 573
Number of nodes= Number of zones= Node Number type Node 1n 2z 3n 4z 5n 6n 7n 8z 9n 10 n10 3Number of links=36 a 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Idaho - CE - 573
Zone 2 4 82Zone 48
Idaho - CE - 573
Number of nodes= Number of zones= Node Number type Node 1n 2z 3n 4z 5n 6n 7n 8z 9n 10 n10 3Number of links=36 a 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Idaho - CE - 573
Get Path Trees CommandButton2Number of nodes= 10 Number of zones= 3 Node Number type (z = zone centroid or origin) Node 1n 2z 3n 4z 5n 6n 7n 8z 9n 10 nNumber of links=36 a 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
Idaho - CE - 573
Homework 7 1. GRAVITY MODEL: Estimate the trip interchanges for three trip matrices. One trip matrix for each trip purpose (HBW, HBO, NHB), given the following information, using the gravity model.2. CONVERTING TO O-D FORMAT: Given the results of p
Idaho - CE - 573
Impedance function = HBW HBO NHB Zone 1 2 3 4 5Fij = a * cij exp( c * cij )a = 0.02 a = 0.09 a = 0.4 b = 2.15 b = 2.15 b = 1.15 c = -0.19 c = -0.39 c = -0.39bHBW HBO NHB Productions Attractions Productions Attractions Productions Attractions 2
Idaho - CE - 573
Trip Length DistributionCost-Bin 2.5 7.5 12.5 17.5 22.5 27.5 TLDobs 100 300 400 650 500 300 2250Intrazonal Travel Times (min)Zone Zone 1 2 3 4 5 1 4 20 10 25 20 2 20 5 15 30 25 3 10 15 3 30 25 4 25 30 30 6 10Relating Zone pairs to cost-bins by
Idaho - CE - 573
Homework 8 1. You have been assigned the task of estimating the travel demand on the transportation system in Moscow, Idaho. You have completed the base year trip matrix and now need to estimate the trip matrix for the design year (forecast year). Pa
Idaho - CE - 573
Base Year Trip Matrix Origin 1 1 38 2 684 3 751 4 656 5 652 6 493 7 624 8 837 9 863 10 734 Destination Volume 6332 2 970 101 891 359 542 878 902 533 657 146 5979 3 926 600 74 483 760 390 674 544 952 987 6390 4 139 315 719 83 458 898 317 319 382 682 4
Idaho - CE - 573
Homework 9 1. Load the following network with the given OD volumes using AON assignment. Record the volumes using the respective minimum cost paths for O-D pairs AC and BC. Also, record the total volumes using each of the links in the network. The O-