Mechanical Engineering 101
|
|
- Christian Chandler
- 6 years ago
- Views:
Transcription
1 Mechanical Engineering 101 University of California, Berkeley Lecture #18 1
2 Today s lecture pull systems: kanban Example Parameters Reliability Scheduling, Assumptions, Variations 2
3 Kanban: a method for controlling pull system Japanese roughly translated as card used for production authorization each kanban includes info on part type number of units authorized possible additional info often used together with transport container possibly color-coded to match empty container pulls parts / triggers production kanban card is work order transfer lot size = container size 3
4 Kanban Step N supplier Step N manufacturer Z Z kanban card (and empty container) = request to supplier to make a container of Z and deliver ASAP send request when remaining WIP/material just covers lead time for replenishment 4
5 Kanban example [Mahoney] one-card kanban low mix/high volume environment products X and Z each has 3 steps performed at same 3 stations A,B,C one worker per station (aka Point Of Use, POU) storage after each station Process A Process A+B Process A+B+C 5
6 Kanban card for example X 1 card located with product throughout the system X Model number Replenishment quantity 1 X product: Z product: 6
7 LMHV Location after process A Product X after process A Product specific one-card kanban system product X kanban card Finished product X Product Z after process A Finished product Z Process A Process B Process C Process A Process A+B Process A+B+C 7
8 Signals from parts and cards Authorizes another product Z to be started Product Z Kanban card put up at C Z 1 Product Z removed from FGI 8
9 More details process B & C Z 1 Z 1 C removes partially completed Z from input buffer Z kanban put up at B to schedule production of another Z product Completed Z after process C goes with card to FGI Z 1 9
10 Moving further upstream. Z 1 Z 1 B removes partially completed Z from input buffer Z kanban put up at A to schedule production of another Z product Completed Z after process B goes with card to output buffer 10
11 Last step... process step A creates product Z Z and kanban card placed in step A output buffer 11
12 Idle state no kanban cards at any process stage no production occurs removing an X or Z from FGI would restart process 12
13 Today s lecture pull systems: kanban Intro Parameters Reliability Scheduling, Assumptions, Variations 13
14 Kanban parameters container size each kanban authorizes number of units that fit in container number of kanbans for each part type 14
15 Container size cost to move container based on handling technology ideal container size n for part i, transfer technology j: derived from minimizing total transfer & holding costs (fixed costs = c 1ij ) n ij 2c 2ij h i D i cost/move container of part i with technology j demand for product i holding cost for i 15
16 Number of kanbans Inventory position supply of parts must be coordinated with demand during lead time Q lead time, r reorder point safety stock SS time process step i has demand D, lead time how many parts will be removed during lead time? 1. D D + 16
17 .Number of kanbans for process step i, lead time demand = i D i if we have k i containers (= k i kanbans), each holding n i parts, we ll be ok if number of kanbans: n i * k i >= i D i k i >= i D i / n i 19
18 .Number of kanbans real world: variability! measure variability of lead time demand i D i use to set a safety factor l : i D i <= i D i (1 + l ) with some known probability if lead time demand i D i has mean 100, standard deviation 6, and we want to avoid shortages with ~97 1/2 % probability, what safety factor (l ) should we use? 23
19 .Number of kanbans total kanbans for step i: 27
20 Announcements HW 6 return Midterm Thursday HW 1-6, movies, lecture material through this week Try the posted samples!!! Bring: One 3x5 inch card of notes, handwritten, one side only An approved calculator: Hewlett Packard: The HP 33s and HP 35s models. Texas Instruments: All TI-30X and TI-36X models. Casio: All fx-115 models. 29
21 Today s lecture pull systems: kanban Intro Parameters Reliability Scheduling, Assumptions, Variations 30
22 Process availability example 2 stage process stage 1: 80 parts/hr but fails every 18 hrs w/ 2hrs downtime stage 2: 80 parts/hr reliable constant demand 75 parts/hr buffer 1 2 Demand 75/hour 80/hr 18hrs up/2 hrs down 80/hr 31
23 .Process availability example buffer 1 2 Demand 75/hour 80/hr 18 hrs up/2 hrs down 80/hr Do we have capacity to meet demand? 32
24 .Process availability example buffer 1 2 Demand 75/hour 125/hr 8 hrs up/2 hrs down 80/hr run stage 1 in fast mode 125 parts/hr fails every 8 hrs w/ 2 hrs downtime Average capacity? 35
25 Process availability example buffer 1 2 Demand 75/hour 125/hr 8 hrs up/2 hrs down 80/hr Stage1 production 150 have capacity to meet demand if enough buffer inventory kept since stage 1 faster, buffer will fill up time, hrs 37
26 .Process availability example buffer 1 2 Demand 75/hour 125/hr 8 hrs up/2 hrs down 80/hr kanban size is 5 parts/container for stage 1 output how many kanbans (k) for stage 1? what is max (worst case) lead time to refill container? what is max lead time demand? 38
27 Process availability example buffer 1 2 Demand 75/hour 125/hr 8 hrs up/2 hrs down 80/hr 150 Stage1 production 150 Buffer inventory 150 Stage 2 production 150 FGI time, hrs
28 Capacity, previous example buffer 1 2 Demand 75/hour 125/hr 8 hrs up/2 hrs down 80/hr Average capacity 80% of 125 = 100 parts/hr 48
29 .Preventive maintenance option slow machine to 110 parts/hr 1/2 hr preventive maintenance every 2 hrs Adequate capacity? 49
30 .Preventive maintenance option number kanbans? max lead time =.5 hrs + 5/110 =.55 hrs.55*75 = 41.3, so 9 kanbans slow machine to 110 parts/hr 1/2 hr preventive maintenance every 2 hrs Adequate capacity? 50
31 Time check 53
32 Today s lecture pull systems: kanban Intro Parameters Reliability Scheduling, Assumptions, Variations 55
33 Kanban scheduling rules several choices FCFS first come first served SPT shortest processing time families often FCFS between families EMQ wait until EMQ orders accumulated 56
34 Kanban scheduling rules yet more choices cyclical production fixed, repeating sequence (most efficient sequence) continuous time production quantity set to total number outstanding authorizations» but often have a min and a max periodic review do one full sequence per production period» based on outstanding orders at start of period variation: signal kanbans send signal kanban at reorder point with earlier material kanban signals 57
35 Signal kanbans signal authorizes production of entire EMQ signal kanban signal kanban signal kanban Part A Part B Part C 58
36 Signal kanbans signal authorizes production of entire EMQ possibly preceded by material order authorization material kanban signal kanban material kanban material kanban signal kanban signal kanban Part A Part B Part C 59
37 Oatmeal kanban 60
38 Oatmeal kanban 61
39 Oatmeal kanban 62
40 Kanban systems one card system supplier makes parts in response to arrival of kanban card inventory stored in buffers between stages at user kanban squares empty spot triggers production signal kanbans 63
41 Kanban systems two card system both input (user) and output (producer) buffers maintained Useful with multiple work centers using same part parts already waiting in output buffer when withdrawal kanban arrives from user producer makes parts in response to production kanban posted when a previous order was filled could have been triggered by any work center using part 64
42 2 card kanban example withdrawal kanban (aka transport) kanban production kanban products M,V,W,X,Y,Z PM 2 WM M 2 M PV 1 WV 1 V PW 1 WW 1 W PX 1 WX 1 X PY 1 WY 1 Y PZ 1 WZ 1 Z Inter-process inventory 65
43 Steady state i input buffer WM 2 M WV 1 V WW 1 W WX PM 2 WM 2 M M M M 1 X M X WY 1 Y WZ 1 Z process i i output buffer PV 1 V PW 1 W PX 1 PY 1 Y PZ 1 Z transit i+1 input buffer WV 1 V WW 1 W WX 1 X WY 1 Y WZ 1 Z 66
44 Assumptions needed for efficient use of kanbans demand and demand mix approximately constant otherwise need to adjust # kanbans short setup times allows rapid response to actual demand or you ll need large buffers (lots of inventory) disciplined workforce proper transfer of kanbans produce only if kanban available, flexible capacity cross-trained workers maintenance 67
Mechanical Engineering 101
Mechanical Engineering 101 University of California, Berkeley Lecture #19 1 Today s lecture Pull systems Kanban Variations, Scheduling, Assumptions CONWIP (constant work in process) choosing N backlog
More informationLESSON 24: JUST-IN-TIME
LESSON 24: JUST-IN-TIME Outline Just-in-Time (JIT) Examples of Waste Some Elements of JIT 1 Just-in-time Producing only what is needed and when it is needed A philosophy An integrated management system
More informationWithdrawal, Production, and Supplier; the Three Types of Kanban
Withdrawal, Production, and Supplier; the Three Types of Kanban Each is used for its own unique situation dealing with processes, supermarkets, outside suppliers or any combination of customers Production
More informationChapter 17 Further Practical Study of the Kanban System. Seoul National University Professor ILKYEONG MOON
Chapter 17 Further Practical Study of the Kanban System Seoul National University Professor ILKYEONG MOON All rights reserved, 2013 17.1 17.2 17.3 17.4 Maximum number of production kanbans to be stored
More informationThe Kanban Course. Workbook
The Kanban Course Workbook learn how to calculate the number of Production and Withdrawal Kanban needed with the 2 Card Kanban System. A workbook intended to accompany the Facilitator s Guides for this
More informationThe Kanban Course. Facilitator s Guide
The Kanban Course Facilitator s Guide learn how to calculate the number of Production and Withdrawal Kanban needed with the 2 Card Kanban System. A step by step guide to presenting Gemba Academy s 5S course
More informationBEC. Operations Special Interest Group (SIG)
Operations Special Interest Group (SIG) Operations Special Interest Group (SIG) Purpose: The purpose of the SIG is to provide the opportunity for attendees to discuss their experience with the topic area
More informationMarek Piatkowski. December Marek Piatkowski FSP Consulting
Materials Strategy Delivery Kanban Operating Rules Marek Piatkowski December 2010 1 We have created Supermarkets A storage place where all parts and components used by the specific Customer (Department)
More informationIntroduction to Manufacturing Systems
MIT 2.853/2.854 Introduction to Manufacturing Systems Toyota Production System Lecturer: Stanley B. Gershwin Copyright c 2002-2005 Stanley B. Gershwin. Primary source: Toyota Production System by Yasuhiro
More informationKanban Scheduling System
Kanban Scheduling System Christian Colombo and John Abela Department of Artificial Intelligence, University of Malta Abstract. Nowadays manufacturing plants have adopted a demanddriven production control
More informationA Heuristic Approach to the Design of Kanban Systems
A Heuristic Approach to the Design of Kanban Systems Chuda Basnet Department of Management Systems University of Waikato, Hamilton Abstract Kanbans are often used to communicate replenishment requirements
More informationHow the Kanban Replenishment Process Works
How the Kanban Replenishment Process Works Table of Contents Introduction...1 Kanban Planning...3 Kanban Doing...6 Kanban Checking...10 Kanban Acting...12 Final Thoughts...13 About Falcon...14 B Introduction
More informationIntro to Probability Instructor: Alexandre Bouchard
www.stat.ubc.ca/~bouchard/courses/stat302-sp2017-18/ Intro to Probability Instructor: Aleandre Bouchard Announcements New webwork will be release by end of day today, due one week later. Plan for today
More informationKanban Size and its Effect on JIT Production Systems
Kanban Size and its Effect on JIT Production Systems Ing. Olga MAŘÍKOVÁ 1. INTRODUCTION Integrated planning, formation, carrying out and controlling of tangible and with them connected information flows
More informationMaximum flow problem CE 377K. March 3, 2015
Maximum flow problem CE 377K March 3, 2015 Informal evaluation results 2 slow, 16 OK, 2 fast Most unclear topics: max-flow/min-cut, WHAT WILL BE ON THE MIDTERM? Most helpful things: review at start of
More informationECE 435 Network Engineering Lecture 10
ECE 435 Network Engineering Lecture 10 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 28 September 2017 Announcements HW#4 was due HW#5 will be posted. midterm/fall break You
More informationCourse Outline LEAN Manufacturing in Microsoft Dynamics AX TO TRAIN
80310 - LEAN Manufacturing in Microsoft Dynamics AX 2012 General Description This course provides students with a detailed overview of the Lean Manufacturing module in Microsoft It provides a description
More informationThe Kanban Course. Workbook. The 6 Kanban Prerequisites In order to succeed with Kanban, there are 6 prerequisites that must be in place.
The Kanban Course Workbook In order to succeed with Kanban, there are 6 prerequisites that must be in place. A workbook intended to accompany the Facilitator s Guides for this course. This guide includes
More informationLean Kanban Scheduling Systems
Welcome to Lean Kanban Scheduling Systems Clinic Presentation ASQ Orange Empire Monthly Dinner Meeting October 9, 2018 Frank G. Adler, Ph.D. Principal & Managing Partner Operational Excellence Consulting,
More informationThe Kanban Course. Workbook
The Kanban Course Workbook Batch Production and Signal Kanban Contains the modules Kanban in Batch Production and Calculating Signal Kanban Quantities A workbook intended to accompany the Facilitator s
More informationLecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool
SMA6304 M2 ---Factory Planning and scheduling Lecture Discrete Event of Manufacturing Systems Simulation Sivakumar AI Lecture: 12 copyright 2002 Sivakumar 1 Simulation Simulation - A Predictive Tool Next
More informationReview of Engineering Fundamentals CIVL 4197
Review of Engineering Fundamentals CIVL 4197 Course Format 13 review sessions Half-length mock FE exam 3-hour exam 55 questions (~3 minutes per question) $44 payable online What Do I Need? NCEES FE Reference
More informationSection 5.2: Next Event Simulation Examples
Section 52: Next Event Simulation Examples Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 52: Next Event Simulation Examples
More informationFLEXIBLE ASSEMBLY SYSTEMS
FLEXIBLE ASSEMBLY SYSTEMS Job Shop and Flexible Assembly Job Shop Each job has an unique identity Make to order, low volume environment Possibly complicated route through system Very difficult Flexible
More informationKanban Cards. Prepared for: APICS SFV Chapter by
Kanban Cards Prepared for: APICS SFV Chapter by Imre Andrew (Andy) Pattantyus Strategic Modularity, Inc. www.strategicmodularity.com andyp@strategicmodularity.com Phone: 661-312-5898 FAX: 661-554-0299
More informationENM316E Simulation. The output obtained by running the simulation model once is also random.
ENM 316E Simulation Lesson 6 Output analysis is the analysis of data generated from simulation study. The purpose of the output analysis To estimate the performance of a system To compare the performance
More informationTest-King.MB6-884_79.Questions
Test-King.MB6-884_79.Questions Number: MB6-884 Passing Score: 800 Time Limit: 120 min File Version: 13.05 http://www.gratisexam.com/ Till now this is the latest material we have if there is any updates
More informationCincom Manufacturing Business Solutions. Cincom and complex manufacturing: meeting the goals of a Demand-Driven environment
Cincom Manufacturing Business Solutions Cincom and complex manufacturing: meeting the goals of a Demand-Driven environment Cincom has long been providing solutions to companies that manufacture products
More informationComparative Analysis of GKCS and EKCS
International Journal of Scientific Computing, Vol.5, No.1, January-June 2011, pp. 1-7; ISSN: 0973-578X Serial Publications Comparative Analysis of GKCS and EKCS N. Selvaraj Department of Mechanical Engineering,
More informationCS 152 Computer Architecture and Engineering
CS 152 Computer Architecture and Engineering Lecture 7 Pipelining I 2005-9-20 John Lazzaro (www.cs.berkeley.edu/~lazzaro) TAs: David Marquardt and Udam Saini www-inst.eecs.berkeley.edu/~cs152/ Office Hours
More informationModule 7:Application of stochastic processes in queueing theory Lecture 29:Application of stochastic processes in Queueing Theory
The Lecture Contains: Introdution For a queueing system we generally should define or know the following General system notations Example of Single servers What we can glean from the set of information
More informationSimulation Models for Manufacturing Systems
MFE4008 Manufacturing Systems Modelling and Control Models for Manufacturing Systems Dr Ing. Conrad Pace 1 Manufacturing System Models Models as any other model aim to achieve a platform for analysis and
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Recap: Simulation Model Taxonomy 2 Recap: DES Model Development How to develop a
More informationOLE Smarts115, Smarts116
Each SMART File is listed in one or more of the categories below. Following the categories is a list of each model with a brief description of its application and the key modules or constructs used. Animation
More informationComputer Systems Architecture I. CSE 560M Lecture 17 Guest Lecturer: Shakir James
Computer Systems Architecture I CSE 560M Lecture 17 Guest Lecturer: Shakir James Plan for Today Announcements and Reminders Project demos in three weeks (Nov. 23 rd ) Questions Today s discussion: Improving
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Bayes Nets: Inference Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationEECS 373 Design of Microprocessor-Based Systems
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 10: Serial buses October 2, 2014 Some material from: Brehob, Le, Ramadas, Tikhonov & Mahal 1 Announcements Special
More informationBUFFER STOCKS IN KANBAN CONTROLLED (TRADITIONAL) UNSATURATED MULTI-STAGE PRODUCTION SYSTEM
VOL. 3, NO., FEBRUARY 008 ISSN 89-6608 006-008 Asian Research Publishing Network (ARPN). All rights reserved. BUFFER STOCKS IN KANBAN CONTROLLED (TRADITIONAL) UNSATURATED MULTI-STAGE PRODUCTION SYSTEM
More informationMidterm Exam Test Administration Manual
2017-2018 Midterm Exam Test Administration Manual Department of K-12 Curriculum Algebra 1 Regular & Honors Geometry Regular & Honors Biology 1 Regular & Honors U.S. History Regular & Honors World History
More informationMerchandise Vendor Reporting Manual
Merchandise Vendor Reporting Manual Cueto Event Management System February 2016 Table of Contents Introduction... 3 Contact Info... 3 Terms of Use... 3 Home Page... 4 Tools and Reports... 5 Movement Report...
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 13
CMPE 50/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 3 Lab3 online Due March 4 th. Introduction -2 IP addresses: how to get one? Q: how does network
More informationImplementation of JIT Technique in a Mixed Model Assembly Line: A Case Study
Volume-6, Issue-2, March-April 2016 International Journal of Engineering and Management Research Page Number: 485-489 Implementation of JIT Technique in a Mixed Model Assembly Line: A Case Study Himanshu
More informationEECS 470 Lecture 7. Branches: Address prediction and recovery (And interrupt recovery too.)
EECS 470 Lecture 7 Branches: Address prediction and recovery (And interrupt recovery too.) Warning: Crazy times coming Project handout and group formation today Help me to end class 12 minutes early P3
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Bayes Nets: Inference Instructors: Dan Klein and Pieter Abbeel --- University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel for CS188
More informationNotes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 10 Notes. Class URL:
Notes slides from before lecture CSE 21, Winter 2017, Section A00 Lecture 10 Notes Class URL: http://vlsicad.ucsd.edu/courses/cse21-w17/ Notes slides from before lecture Notes February 13 (1) HW5 is due
More informationAnnouncements. CS243: Discrete Structures. Strong Induction and Recursively Defined Structures. Review. Example (review) Example (review), cont.
Announcements CS43: Discrete Structures Strong Induction and Recursively Defined Structures Işıl Dillig Homework 4 is due today Homework 5 is out today Covers induction (last lecture, this lecture, and
More informationNetwork layer. Network Layer 4-1. application transport network data link physical. network data link physical. network data link physical
Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport layer network layer protocols in every
More informationStatistical Methods for NLP
Statistical Methods for NLP Text Similarity, Text Categorization, Linear Methods of Classification Sameer Maskey Announcement Reading Assignments Bishop Book 6, 62, 7 (upto 7 only) J&M Book 3, 45 Journal
More informationChapter X. Electronic KANBAN (delivery KANBAN)
Chapter X. Electronic KANBAN (delivery KANBAN) Table of Contents 4.1. General Information 4.1.1. What is KANBAN? 4.1.2. General information about delivery KANBAN 4.1.3. Who has to use the tool and who
More informationCSE 333 Lecture server sockets
CSE 333 Lecture 15 -- server sockets Steve Gribble Department of Computer Science & Engineering University of Washington Administrivia HW3 out later this week We will have 2 exercises this week - today
More informationAdmin CS41B MACHINE. Midterm topics. Admin 2/11/16. Midterm next Thursday in-class (2/18) SML. recursion. math. David Kauchak CS 52 Spring 2016
Admin! Assignment 3! due Monday at :59pm! Academic honesty CS4B MACHINE David Kauchak CS 5 Spring 6 Admin Midterm next Thursday in-class (/8)! Comprehensive! Closed books, notes, computers, etc.! Except,
More informationDatabase Applications (15-415)
Database Applications (15-415) DBMS Internals- Part V Lecture 13, March 10, 2014 Mohammad Hammoud Today Welcome Back from Spring Break! Today Last Session: DBMS Internals- Part IV Tree-based (i.e., B+
More informationAgenda. Cache-Memory Consistency? (1/2) 7/14/2011. New-School Machine Structures (It s a bit more complicated!)
7/4/ CS 6C: Great Ideas in Computer Architecture (Machine Structures) Caches II Instructor: Michael Greenbaum New-School Machine Structures (It s a bit more complicated!) Parallel Requests Assigned to
More informationCS399 New Beginnings. Jonathan Walpole
CS399 New Beginnings Jonathan Walpole Virtual Memory (1) Page Tables When and why do we access a page table? - On every instruction to translate virtual to physical addresses? Page Tables When and why
More informationIMPROVEMENTS OF WORKSITE CONTROL FOR PULL SYSTEM
IMPROVEMENTS OF WORKSITE CONTROL FOR PULL SYSTEM Jamaliah. M. S. 1, Mohamad Amin Mohd Hashim 2 and Azianti Ismail 1 1 Faculty of Mechanical Engineering, Universiti Teknologi Mara Johor Cawangan Pasir Gudang,
More informationAnnouncements. Transaction. Motivating Example. Motivating Example. Transactions. CSE 444: Database Internals
Announcements CSE 444: Database Internals Lab 2 is due TODAY Lab 3 will be released tomorrow, part 1 due next Monday Lectures 13 Transaction Schedules CSE 444 - Spring 2015 1 HW4 is due on Wednesday HW3
More informationAnnouncements. CS 188: Artificial Intelligence Spring Today. Example: Map-Coloring. Example: Cryptarithmetic.
CS 188: Artificial Intelligence Spring 2010 Lecture 5: CSPs II 2/2/2010 Pieter Abbeel UC Berkeley Many slides from Dan Klein Announcements Project 1 due Thursday Lecture videos reminder: don t count on
More informationE40M. An Introduction to Making: What is EE?
E40M An Introduction to Making: What is EE? Jim Plummer Stanford University plummer@stanford.edu Chuan-Zheng Lee Stanford University czlee@stanford.edu Roger Howe Stanford University rthowe@stanford.edu
More informationOutline for Today. How can we speed up operations that work on integer data? A simple data structure for ordered dictionaries.
van Emde Boas Trees Outline for Today Data Structures on Integers How can we speed up operations that work on integer data? Tiered Bitvectors A simple data structure for ordered dictionaries. van Emde
More informationLean Manufacturing II
Lean Manufacturing II Leverage Lean Manufacturing in Microsoft Dynamics AX Date: February 1st, 2010 www.ebecs.com www.leancentreofexcellence.com Contents LEAN MANUFACTURING II... 3 INVENTORY TRACE CONTROL...
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #22 CPU Design: Pipelining to Improve Performance II 2007-8-1 Scott Beamer, Instructor CS61C L22 CPU Design : Pipelining to Improve Performance
More informationAdvanced Caching Techniques (2) Department of Electrical Engineering Stanford University
Lecture 4: Advanced Caching Techniques (2) Department of Electrical Engineering Stanford University http://eeclass.stanford.edu/ee282 Lecture 4-1 Announcements HW1 is out (handout and online) Due on 10/15
More informationDeterministic Variable Demand Inventory. Chen Zhou Assoc. Prof For Prof. Reveliotis Sept 11, 2008
Deterministic Variable Demand Inventory Chen Zhou Assoc. Prof For Prof. Reveliotis Sept 11, 2008 Demand and replenishment Demand can be Nearly deterministic Variable Replenishment is in discrete intervals
More informationAnnouncements. Motivating Example. Transaction ROLLBACK. Motivating Example. CSE 444: Database Internals. Lab 2 extended until Monday
Announcements CSE 444: Database Internals Lab 2 extended until Monday Lab 2 quiz moved to Wednesday Lectures 13 Transaction Schedules HW5 extended to Friday 544M: Paper 3 due next Friday as well CSE 444
More informationCSC 401 Data and Computer Communications Networks
CSC 40 Data and Computer Communications Networks Network Layer NAT, Routing, Link State, Distance Vector Prof. Lina Battestilli Fall 07 Chapter 4 Outline Network Layer: Data Plane 4. Overview of Network
More informationCSE 444: Database Internals. Lectures Transactions
CSE 444: Database Internals Lectures 13-14 Transactions CSE 444 - Spring 2014 1 Announcements Lab 2 is due TODAY Lab 3 will be released today, part 1 due next Monday HW4 is due on Wednesday HW3 will be
More informationCPSC 121: Models of Computation
Instructor: Bob Woodham woodham@cs.ubc.ca Department of Computer Science University of British Columbia Lecture Notes 2009/2010, Section 203 Menu March 22, 2010 Topics: A Simple Computer High-level design
More informationCMPE 80N: Introduction to Networking and the Internet. Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 20
CMPE 80N: Introduction to Networking and the Internet Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 0 Announcements Final exam: June 7 th at 4pm. Comprehensive. Photo id required.
More informationInventory Control by Kanban Based Pull System Implementation
Inventory Control by Kanban Based Pull System Implementation Virendra Konde, Student, Rajgad Institute of Management Research Development, Dhankawadi, Pune. E-mail : vir96konde@rediffmail.com Mr. Rohan
More informationPhoto David Wright STEVEN R. BAGLEY PIPELINES AND ILP
Photo David Wright https://www.flickr.com/photos/dhwright/3312563248 STEVEN R. BAGLEY PIPELINES AND ILP INTRODUCTION Been considering what makes the CPU run at a particular speed Spent the last two weeks
More informationEECS 470 Lecture 6. Branches: Address prediction and recovery (And interrupt recovery too.)
EECS 470 Lecture 6 Branches: Address prediction and recovery (And interrupt recovery too.) Announcements: P3 posted, due a week from Sunday HW2 due Monday Reading Book: 3.1, 3.3-3.6, 3.8 Combining Branch
More informationDatabase Applications (15-415)
Database Applications (15-415) DBMS Internals- Part V Lecture 15, March 15, 2015 Mohammad Hammoud Today Last Session: DBMS Internals- Part IV Tree-based (i.e., B+ Tree) and Hash-based (i.e., Extendible
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 14 Congestion Control Some images courtesy David Wetherall Animations by Nick McKeown and Guido Appenzeller The bad news and the good news The bad news: new
More informationIntroduction to Data Management. Lecture #24 (Transactions)
Introduction to Data Management Lecture #24 (Transactions) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Announcements v HW and exam info:
More informationQ.uick Start Guide: How to Configure the Q.station Data Logger
Q.uick Start Guide: How to Configure the Q.station Data Logger Purpose: This document is used to provide a thorough understanding of how to configure and utilize the logging capabilities of a Q.station
More informationEECS 470. Branches: Address prediction and recovery (And interrupt recovery too.) Lecture 7 Winter 2018
EECS 470 Branches: Address prediction and recovery (And interrupt recovery too.) Lecture 7 Winter 2018 Slides developed in part by Profs. Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Roth, Shen,
More informationInference. Inference: calculating some useful quantity from a joint probability distribution Examples: Posterior probability: Most likely explanation:
Inference Inference: calculating some useful quantity from a joint probability distribution Examples: Posterior probability: B A E J M Most likely explanation: This slide deck courtesy of Dan Klein at
More informationNAFEM-INVENTORY-MANAGEMENT-MIB DEFINITIONS ::= BEGIN. -- From file: "inventory-management.mib" IMPORTS -- enterprises FROM RFC1155-SMI
NAFEM-INVENTORY-MANAGEMENT-MIB DEFINITIONS ::= BEGIN From file: "inventory-management.mib" IMPORTS enterprises FROM RFC1155-SMI IpAddress, Counter FROM RFC1065-SMI OBJECT-TYPE FROM RFC-1212 DisplayString
More information15-740/ Computer Architecture Lecture 20: Main Memory II. Prof. Onur Mutlu Carnegie Mellon University
15-740/18-740 Computer Architecture Lecture 20: Main Memory II Prof. Onur Mutlu Carnegie Mellon University Today SRAM vs. DRAM Interleaving/Banking DRAM Microarchitecture Memory controller Memory buses
More informationPaper Reference(s) 6672 Edexcel GCE Pure Mathematics P2 Advanced/Advanced Subsidiary Monday 20 January 2003 Morning Time: 1 hour 30 minutes
Paper Reference(s) 6672 Edexcel GCE Pure Mathematics P2 Advanced/Advanced Subsidiary Monday 20 January 2003 Morning Time: 1 hour 30 minutes Materials required for examination Answer Book (AB16) Graph Paper
More informationSNC Quick Reference Guide v1.0
SNC Quick Reference Guide v1.0 Page: 2 Table of Contents Table of Contents... 2 General navigation... 3 Queries... 8 Personalize your screen... 11 Alerts... 14 Notifications... 17 Assign Partner Product
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationCS Prelim 1 Review Fall 2017
CS 1110 Prelim 1 Review Fall 2017 Exam Info Prelim 1: 7:30 9:00PM, Thursday, October 12th Last name A J in Uris G01 Last name K Z in Statler Auditorium SDS Students will get an e-mail To help you study:
More informationAnnouncements. ! Previous lecture. Caches. Inf3 Computer Architecture
Announcements! Previous lecture Caches Inf3 Computer Architecture - 2016-2017 1 Recap: Memory Hierarchy Issues! Block size: smallest unit that is managed at each level E.g., 64B for cache lines, 4KB for
More informationClean Slate: Create a Complete Dashboard of Your Work. Zachary Sexton
Clean Slate: Create a Complete Dashboard of Your Work Zachary Sexton Hi there! I m Zachary Sexton The dashboard comes from a manufacturing technique called Kanban I m going to teach you how to visualize
More informationSTUDENT NAME: STUDENT ID: Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Total
University of Minnesota Department of Computer Science & Engineering CSci 5103 - Fall 2018 (Instructor: Tripathi) Midterm Exam 1 Date: October 18, 2018 (1:00 2:15 pm) (Time: 75 minutes) Total Points 100
More informationLecture 8. TCP/IP Transport Layer (2)
Lecture 8 TCP/IP Transport Layer (2) Outline (Transport Layer) Principles behind transport layer services: multiplexing/demultiplexing principles of reliable data transfer learn about transport layer protocols
More information6689 Edexcel GCE Decision Mathematics D1 (New Syllabus) Advanced/Advanced Subsidiary Thursday 23 May 2002 Afternoon Time: 1 hour 30 minutes
Paper Reference(s) 89 Edexcel GCE Decision Mathematics D (New Syllabus) Advanced/Advanced Subsidiary Thursday May 00 Afternoon Time: hour 0 minutes Materials required for examination Nil Items included
More informationCS3: Introduction to Symbolic Programming. Lecture 11: Tree Recursion, beginning lists, and Midterm 2. Spring 2007 Nate Titterton
CS3: Introduction to Symbolic Programming Lecture : Tree Recursion, beginning lists, and Midterm 2 Spring 2007 Nate Titterton nate@berkeley.edu Schedule April 2-6 2 April 9-3 3 April 6-20 4 April 23-27
More informationCS344 - Build an Internet Router. Nick McKeown, Steve Ibanez (TF)
CS344 - Build an Internet Router Nick McKeown, Steve Ibanez (TF) Generic Packet Switch Data H Lookup Address Update Header Queue Packet Destination Address Egress link Forwarding Table Buffer Memory CS344,
More information/90 TOTAL. 1(a) 8pts. fiv(a,b) is called the function.
Your Name: SID Number: UNIVERSITY OF CALIFORNIA AT BERKELEY BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO SANTA BARBARA SANTA CRUZ Department of Electrical Engineering and Computer
More informationAnnouncements. Project 0: Python Tutorial Due last night
Announcements Project 0: Python Tutorial Due last night HW1 officially released today, but a few people have already started on it Due Monday 2/6 at 11:59 pm P1: Search not officially out, but some have
More informationI/O 1. Devices and I/O. key concepts device registers, device drivers, program-controlled I/O, DMA, polling, disk drives, disk head scheduling
I/O 1 Devices and I/O key concepts device registers, device drivers, program-controlled I/O, DMA, polling, disk drives, disk head scheduling reading Three Easy Pieces: Chapters 36-37 I/O 2 Sys/161 Device
More informationPointers and memory Nov 17, Ch 9 & 13.1
Pointers and memory Nov 17, Ch 9 & 13.1 Announcements Test next week! (no homework) Will post practice midterm on website (by Thursday) Highlights - pointers - new and delete Review: address vs value Consider
More informationCopyright/Trademark Information. Using This Guide
eservice Parts and Service User's Guide Copyright/Trademark Information Copyright 2004, 2005 ProQuest Business Solutions Inc. All rights reserved. Microsoft is a registered trademark of Microsoft Corporation.
More informationFlow-start: Faster and Less Overshoot with Paced Chirping
Flow-start: Faster and Less Overshoot with Paced Chirping Joakim Misund, Simula and Uni Oslo Bob Briscoe, Independent IRTF ICCRG, Jul 2018 The Slow-Start
More informationCourse on Computer Communication and Networks. Lecture 7 Network Layer, Chapter 4 (6/e) - Part B (7/e Ch5)
Course on Computer Communication and Networks Lecture 7 Network Layer, Chapter 4 (6/e) - Part B (7/e Ch5) EDA344/DIT 420, CTH/GU Based on the book Computer Networking: A Top Down Approach, Jim Kurose,
More informationAdmin. ! Assignment 3. ! due Monday at 11:59pm! one small error in 5b (fast division) that s been fixed. ! Midterm next Thursday in-class (10/1)
Admin CS4B MACHINE David Kauchak CS 5 Fall 5! Assignment 3! due Monday at :59pm! one small error in 5b (fast division) that s been fixed! Midterm next Thursday in-class (/)! Comprehensive! Closed books,
More information61A LECTURE 1 FUNCTIONS, VALUES. Steven Tang and Eric Tzeng June 24, 2013
61A LECTURE 1 FUNCTIONS, VALUES Steven Tang and Eric Tzeng June 24, 2013 Welcome to CS61A! The Course Staff - Lecturers Steven Tang Graduated L&S CS from Cal Back for a PhD in Education Eric Tzeng Graduated
More informationMultimedia Systems 2011/2012
Multimedia Systems 2011/2012 System Architecture Prof. Dr. Paul Müller University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de Sitemap 2 Hardware
More information