Copyright 2016 Ramez Elmasri and Shamkant B. Navathe
|
|
- Stephen Lamb
- 6 years ago
- Views:
Transcription
1 Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe
2 CHAPTER 20 Itroductio to Trasactio Processig Cocepts ad Theory Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe
3 Itroductio Trasactio Describes local uit of database processig Trasactio processig systems Systems with large databases ad hudreds of cocurret users Require high availability ad fast respose time Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-3
4 20.1 Itroductio to Trasactio Processig Sigle-user DBMS At most oe user at a time ca use the system Example: home computer Multiuser DBMS May users ca access the system (database) cocurretly Example: airlie reservatios system Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-4
5 Itroductio to Trasactio Processig (cot d.) Multiprogrammig Allows operatig system to execute multiple processes cocurretly Executes commads from oe process, the suspeds that process ad executes commads from aother process, etc. Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-5
6 Itroductio to Trasactio Processig (cot d.) Iterleaved processig Parallel processig Processes C ad D i figure below Figure 20.1 Iterleaved processig versus parallel processig of cocurret trasactios Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-6
7 Trasactios Trasactio: a executig program Forms logical uit of database processig Begi ad ed trasactio statemets Specify trasactio boudaries Read-oly trasactio Read-write trasactio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-7
8 Database Items Database represeted as collectio of amed data items Size of a data item called its graularity Data item Record Disk block Attribute value of a record Trasactio processig cocepts idepedet of item graularity Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-8
9 Read ad Write Operatios read_item(x) Reads a database item amed X ito a program variable amed X Process icludes fidig the address of the disk block, ad copyig to ad from a memory buffer write_item(x) Writes the value of program variable X ito the database item amed X Process icludes fidig the address of the disk block, copyig to ad from a memory buffer, ad storig the updated disk block back to disk Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-9
10 Read ad Write Operatios (cot d.) Read set of a trasactio Set of all items read Write set of a trasactio Set of all items writte Figure 20.2 Two sample trasactios (a) Trasactio T1 (b) Trasactio T2 Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-10
11 DBMS Buffers DBMS will maitai several mai memory data buffers i the database cache Whe buffers are occupied, a buffer replacemet policy is used to choose which buffer will be replaced Example policy: least recetly used Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-11
12 Cocurrecy Cotrol Trasactios submitted by various users may execute cocurretly Access ad update the same database items Some form of cocurrecy cotrol is eeded The lost update problem Occurs whe two trasactios that access the same database items have operatios iterleaved Results i icorrect value of some database items Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-12
13 The Lost Update Problem Figure 20.3 Some problems that occur whe cocurret executio is ucotrolled (a) The lost update problem Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-13
14 The Temporary Update Problem Figure 20.3 (cot d.) Some problems that occur whe cocurret executio is ucotrolled (b) The temporary update problem Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-14
15 The Icorrect Summary Problem Figure 20.3 (cot d.) Some problems that occur whe cocurret executio is ucotrolled (c) The icorrect summary problem Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-15
16 The Urepeatable Read Problem Trasactio T reads the same item twice Value is chaged by aother trasactio T betwee the two reads T receives differet values for the two reads of the same item Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-16
17 Why Recovery is Needed Committed trasactio Effect recorded permaetly i the database Aborted trasactio Does ot affect the database Types of trasactio failures Computer failure (system crash) Trasactio or system error Local errors or exceptio coditios detected by the trasactio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-17
18 Why Recovery is Needed (cot d.) Types of trasactio failures (cot d.) Cocurrecy cotrol eforcemet Disk failure Physical problems or catastrophes System must keep sufficiet iformatio to recover quickly from the failure Disk failure or other catastrophes have log recovery times Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-18
19 20.2 Trasactio ad System Cocepts System must keep track of whe each trasactio starts, termiates, commits, ad/or aborts BEGIN_TRANSACTION READ or WRITE END_TRANSACTION COMMIT_TRANSACTION ROLLBACK (or ABORT) Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-19
20 Trasactio ad System Cocepts (cot d.) Figure 20.4 State trasitio diagram illustratig the states for trasactio executio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-20
21 The System Log System log keeps track of trasactio operatios Sequetial, apped-oly file Not affected by failure (except disk or catastrophic failure) Log buffer Mai memory buffer Whe full, appeded to ed of log file o disk Log file is backed up periodically Udo ad redo operatios based o log possible Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-21
22 Commit Poit of a Trasactio Occurs whe all operatios that access the database have completed successfully Ad effect of operatios recorded i the log Trasactio writes a commit record ito the log If system failure occurs, ca search for trasactios with recorded start_trasactio but o commit record Force-writig the log buffer to disk Writig log buffer to disk before trasactio reaches commit poit Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-22
23 DBMS-Specific Buffer Replacemet Policies Page replacemet policy Selects particular buffers to be replaced whe all are full Domai separatio (DS) method Each domai hadles oe type of disk pages Idex pages Data file pages Log file pages Number of available buffers for each domai is predetermied Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-23
24 DBMS-Specific Buffer Replacemet Policies (cot d.) Hot set method Useful i queries that sca a set of pages repeatedly Does ot replace the set i the buffers util processig is completed The DBMIN method Predetermies the patter of page refereces for each algorithm for a particular type of database operatio Calculates locality set usig query locality set model (QLSM) Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-24
25 20.3 Desirable Properties of Trasactios ACID properties Atomicity Trasactio performed i its etirety or ot at all Cosistecy preservatio Takes database from oe cosistet state to aother Isolatio Not iterfered with by other trasactios Durability or permaecy Chages must persist i the database Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-25
26 Desirable Properties of Trasactios (cot d.) Levels of isolatio Level 0 isolatio does ot overwrite the dirty reads of higher-level trasactios Level 1 isolatio has o lost updates Level 2 isolatio has o lost updates ad o dirty reads Level 3 (true) isolatio has repeatable reads I additio to level 2 properties Sapshot isolatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-26
27 20.4 Characterizig Schedules Based o Recoverability Schedule or history Order of executio of operatios from all trasactios Operatios from differet trasactios ca be iterleaved i the schedule Total orderig of operatios i a schedule For ay two operatios i the schedule, oe must occur before the other Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-27
28 Characterizig Schedules Based o Recoverability (cot d.) Two coflictig operatios i a schedule Operatios belog to differet trasactios Operatios access the same item X At least oe of the operatios is a write_item(x) Two operatios coflict if chagig their order results i a differet outcome Read-write coflict Write-write coflict Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-28
29 Characterizig Schedules Based o Recoverability (cot d.) Recoverable schedules Recovery is possible Norecoverable schedules should ot be permitted by the DBMS No committed trasactio ever eeds to be rolled back Cascadig rollback may occur i some recoverable schedules Ucommitted trasactio may eed to be rolled back Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-29
30 Characterizig Schedules Based o Recoverability (cot d.) Cascadeless schedule Avoids cascadig rollback Strict schedule Trasactios ca either read or write a item X util the last trasactio that wrote X has committed or aborted Simpler recovery process Restore the before image Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-30
31 20.5 Characterizig Schedules Based o Serializability Serializable schedules Always cosidered to be correct whe cocurret trasactios are executig Places simultaeous trasactios i series Trasactio T 1 before T 2, or vice versa Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-31
32 Figure 20.5 Examples of serial ad oserial schedules ivolvig trasactios T1 ad T2 (a) Serial schedule A: T1 followed by T2 (b) Serial schedule B: T2 followed by T1 (c) Two oserial schedules C ad D with iterleavig of operatios Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-32
33 Characterizig Schedules Based o Serializability (cot d.) Problem with serial schedules Limit cocurrecy by prohibitig iterleavig of operatios Uacceptable i practice Solutio: determie which schedules are equivalet to a serial schedule ad allow those to occur Serializable schedule of trasactios Equivalet to some serial schedule of same trasactios Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-33
34 Characterizig Schedules Based o Serializability (cot d.) Result equivalet schedules Produce the same fial state of the database May be accidetal Caot be used aloe to defie equivalece of schedules Figure 20.6 Two schedules that are result equivalet for the iitial value of X = 100 but are ot result equivalet i geeral Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-34
35 Characterizig Schedules Based o Serializability (cot d.) Coflict equivalece Relative order of ay two coflictig operatios is the same i both schedules Serializable schedules Schedule S is serializable if it is coflict equivalet to some serial schedule S. Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-35
36 Characterizig Schedules Based o Serializability (cot d.) Testig for serializability of a schedule Algorithm 20.1 Testig coflict serializability of a schedule S Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-36
37 Characterizig Schedules Based o Serializability (cot d.) Figure 20.7 Costructig the precedece graphs for schedules A to D from Figure 20.5 to test for coflict serializability (a) Precedece graph for serial schedule A (b) Precedece graph for serial schedule B (c) Precedece graph for schedule C (ot serializable) (d) Precedece graph for schedule D (serializable, equivalet to schedule A) Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-37
38 How Serializability is Used for Cocurrecy Cotrol Beig serializable is differet from beig serial Serializable schedule gives beefit of cocurret executio Without givig up ay correctess Difficult to test for serializability i practice Factors such as system load, time of trasactio submissio, ad process priority affect orderig of operatios DBMS eforces protocols Set of rules to esure serializability Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-38
39 View Equivalece ad View Serializability View equivalece of two schedules As log as each read operatio of a trasactio reads the result of the same write operatio i both schedules, the write operatios of each trasactio must produce the same results Read operatios said to see the same view i both schedules View serializable schedule View equivalet to a serial schedule Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-39
40 View Equivalece ad View Serializability (cot d.) Coflict serializability similar to view serializability if costraied write assumptio (o blid writes) applies Ucostraied write assumptio Value writte by a operatio ca be idepedet of its old value Debit-credit trasactios Less-striget coditios tha coflict serializability or view serializability Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-40
41 20.6 Trasactio Support i SQL No explicit Begi_Trasactio statemet Every trasactio must have a explicit ed statemet COMMIT ROLLBACK Access mode is READ ONLY or READ WRITE Diagostic area size optio Iteger value idicatig umber of coditios held simultaeously i the diagostic area Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-41
42 Trasactio Support i SQL (cot d.) Isolatio level optio Dirty read Norepeatable read Phatoms Table 20.1 Possible violatios based o isolatio levels as defied i SQL Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-42
43 Trasactio Support i SQL (cot d.) Sapshot isolatio Used i some commercial DBMSs Trasactio sees data items that it reads based o the committed values of the items i the database sapshot whe trasactio starts Esures phatom record problem will ot occur Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-43
44 20.7 Summary Sigle ad multiuser database trasactios Ucotrolled executio of cocurret trasactios System log Failure recovery Committed trasactio Schedule (history) defies executio sequece Schedule recoverability Schedule equivalece Serializability of schedules Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Slide 20-44
Copyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
CHAPTER 20 Introduction to Transaction Processing Concepts and Theory Introduction Transaction Describes local unit of database processing Transaction processing systems Systems with large databases and
More informationTRANSACTION MANAGEMENT [CH 16]
Sprig 2017 TRANSACTION MANAGEMENT [CH 16] 4/25/17 CS 564: Database Maagemet Systems; (c) Jigesh M. Patel, 2013 1 Trasactio Maagemet Read (A); Check (A > $25); Pay ($25); A = A 25; Write (A); Yes You Read
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 21 Cocurrecy Cotrol Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Cocurrecy cotrol protocols Set of rules to guaratee
More informationReview: The ACID properties
Recovery Review: The ACID properties A tomicity: All actios i the Xactio happe, or oe happe. C osistecy: If each Xactio is cosistet, ad the DB starts cosistet, it eds up cosistet. I solatio: Executio of
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.
More informationChapter 20 Introduction to Transaction Processing Concepts and Theory
Chapter 20 Introduction to Transaction Processing Concepts and Theory - Logical units of DB processing - Large database and hundreds of transactions - Ex. Stock market, super market, banking, etc - High
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationIntroduction to Transaction Processing Concepts and Theory
Chapter 4 Introduction to Transaction Processing Concepts and Theory Adapted from the slides of Fundamentals of Database Systems (Elmasri et al., 2006) 1 Chapter Outline Introduction to Transaction Processing
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 17-1
Slide 17-1 Chapter 17 Introduction to Transaction Processing Concepts and Theory Chapter Outline 1 Introduction to Transaction Processing 2 Transaction and System Concepts 3 Desirable Properties of Transactions
More informationChapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings
Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationTransaction Processing Concepts and Theory. Truong Tuan Anh CSE-HCMUT
1 Transaction Processing Concepts and Theory Truong Tuan Anh CSE-HCMUT 2 Outline Introduction to Transaction Processing Transaction and System Concepts Desirable Properties of Transactions Characterizing
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationReliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1
Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationECE 650 Systems Programming & Engineering. Spring 2018
ECE 650 Systems Programming & Engineering Spring 2018 Database Transaction Processing Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) Transaction Processing Systems Systems with
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationProgramming with Shared Memory PART II. HPC Spring 2017 Prof. Robert van Engelen
Programmig with Shared Memory PART II HPC Sprig 2017 Prof. Robert va Egele Overview Sequetial cosistecy Parallel programmig costructs Depedece aalysis OpeMP Autoparallelizatio Further readig HPC Sprig
More informationAbstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:
Chapter 4 Computatio Bjare Stroustrup www.stroustrup.com/programmig Abstract Today, I ll preset the basics of computatio. I particular, we ll discuss expressios, how to iterate over a series of values
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationCMSC Computer Architecture Lecture 15: Multi-Core. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 15: Multi-Core Prof. Yajig Li Uiversity of Chicago Course Evaluatio Very importat Please fill out! 2 Lab3 Brach Predictio Competitio 8 teams etered the competitio,
More informationCMSC22200 Computer Architecture Lecture 9: Out-of-Order, SIMD, VLIW. Prof. Yanjing Li University of Chicago
CMSC22200 Computer Architecture Lecture 9: Out-of-Order, SIMD, VLIW Prof. Yajig Li Uiversity of Chicago Admiistrative Stuff Lab2 due toight Exam I: covers lectures 1-9 Ope book, ope otes, close device
More informationFederated Transaction Management with Snapshot Isolation
Federated Trasactio Maagemet with Sapshot Isolatio Ralf Schekel, Gerhard Weikum Norbert Weißeberg Xuequ Wu Uiversity of the Saarlad Frauhofer ISST Deutsche Telekom AG email {schekel,weikum}@cs.ui-sb.de
More informationMaster Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1
Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Memory Hierarchy (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Itroductio Programmers wat ulimited amouts
More informationThreads and Concurrency in Java: Part 1
Cocurrecy Threads ad Cocurrecy i Java: Part 1 What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More informationOutline. CSCI 4730 Operating Systems. Questions. What is an Operating System? Computer System Layers. Computer System Layers
Outlie CSCI 4730 s! What is a s?!! System Compoet Architecture s Overview Questios What is a?! What are the major operatig system compoets?! What are basic computer system orgaizatios?! How do you commuicate
More informationCMSC Computer Architecture Lecture 10: Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 10: Caches Prof. Yajig Li Uiversity of Chicago Midterm Recap Overview ad fudametal cocepts ISA Uarch Datapath, cotrol Sigle cycle, multi cycle Pipeliig Basic idea,
More informationThreads and Concurrency in Java: Part 1
Threads ad Cocurrecy i Java: Part 1 1 Cocurrecy What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More information% Sun Logo for. X3T10/95-229, Revision 0. April 18, 1998
Su Microsystems, Ic. 2550 Garcia Aveue Moutai View, CA 94045 415 960-1300 X3T10/95-229, Revisio 0 April 18, 1998 % Su Logo for Joh Lohmeyer Chairperso, X3T10 Symbios Logic Ic. 1635 Aeroplaza Drive Colorado
More informationSCI Reflective Memory
Embedded SCI Solutios SCI Reflective Memory (Experimetal) Atle Vesterkjær Dolphi Itercoect Solutios AS Olaf Helsets vei 6, N-0621 Oslo, Norway Phoe: (47) 23 16 71 42 Fax: (47) 23 16 71 80 Mail: atleve@dolphiics.o
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationCMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 11: More Caches Prof. Yajig Li Uiversity of Chicago Lecture Outlie Caches 2 Review Memory hierarchy Cache basics Locality priciples Spatial ad temporal How to access
More informationUsing VTR Emulation on Avid Systems
Usig VTR Emulatio o Avid Systems VTR emulatio allows you to cotrol a sequece loaded i the Record moitor from a edit cotroller for playback i the edit room alog with other sources. I this sceario the edit
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationn Learn how resiliency strategies reduce risk n Discover automation strategies to reduce risk
Chapter Objectives Lear how resiliecy strategies reduce risk Discover automatio strategies to reduce risk Chapter #16: Architecture ad Desig Resiliecy ad Automatio Strategies 2 Automatio/Scriptig Resiliet
More informationn Maurice Wilkes, 1949 n Organize software to minimize errors. n Eliminate most of the errors we made anyway.
Bjare Stroustrup www.stroustrup.com/programmig Chapter 5 Errors Abstract Whe we program, we have to deal with errors. Our most basic aim is correctess, but we must deal with icomplete problem specificatios,
More informationCMPT 125 Assignment 2 Solutions
CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationLazy Type Changes in Object-oriented Database. Shan Ming Woo and Barbara Liskov MIT Lab. for Computer Science December 1999
Lazy Type Chages i Object-orieted Database Sha Mig Woo ad Barbara Liskov MIT Lab. for Computer Sciece December 1999 Backgroud wbehavior of OODB apps compose of behavior of persistet obj wbehavior of objects
More informationDatabase Technology. Topic 8: Introduction to Transaction Processing
Topic 8: Introduction to Transaction Processing Olaf Hartig olaf.hartig@liu.se Motivation A DB is a shared resource accessed by many users and processes concurrently Not managing concurrent access to a
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationCourse Site: Copyright 2012, Elsevier Inc. All rights reserved.
Course Site: http://cc.sjtu.edu.c/g2s/site/aca.html 1 Computer Architecture A Quatitative Approach, Fifth Editio Chapter 2 Memory Hierarchy Desig 2 Outlie Memory Hierarchy Cache Desig Basic Cache Optimizatios
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationFoundation of Database Transaction Processing. Copyright 2012 Pearson Education, Inc.
Foundation of Database Transaction Processing Copyright 2012 Pearson Education, Inc. Chapter Outline - 17.1 Introduction to Transaction Processing - 17.2 Transaction and System Concepts - 17.3 Desirable
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationOverview. Chapter 18 Vectors and Arrays. Reminder. vector. Bjarne Stroustrup
Chapter 18 Vectors ad Arrays Bjare Stroustrup Vector revisited How are they implemeted? Poiters ad free store Destructors Iitializatio Copy ad move Arrays Array ad poiter problems Chagig size Templates
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationtransaction - (another def) - the execution of a program that accesses or changes the contents of the database
Chapter 19-21 - Transaction Processing Concepts transaction - logical unit of database processing - becomes interesting only with multiprogramming - multiuser database - more than one transaction executing
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationRecursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames
Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of
More informationRECOVERY CHAPTER 21,23 (6/E) CHAPTER 17,19 (5/E)
RECOVERY CHAPTER 21,23 (6/E) CHAPTER 17,19 (5/E) 2 LECTURE OUTLINE Failures Recoverable schedules Transaction logs Recovery procedure 3 PURPOSE OF DATABASE RECOVERY To bring the database into the most
More informationChapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationCustomer Portal Quick Reference User Guide
Customer Portal Quick Referece User Guide Overview This user guide is iteded for FM Approvals customers usig the Approval Iformatio Maagemet (AIM) customer portal to track their active projects. AIM is
More informationChapter 2. C++ Basics. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 2 C++ Basics Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 2.1 Variables ad Assigmets 2.2 Iput ad Output 2.3 Data Types ad Expressios 2.4 Simple Flow of Cotrol 2.5 Program
More informationMulti-Threading. Hyper-, Multi-, and Simultaneous Thread Execution
Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor Advanced Issues
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Advaced Issues Review: Pipelie Hazards Structural hazards Desig pipelie to elimiate structural hazards.
More informationCS 11 C track: lecture 1
CS 11 C track: lecture 1 Prelimiaries Need a CMS cluster accout http://acctreq.cms.caltech.edu/cgi-bi/request.cgi Need to kow UNIX IMSS tutorial liked from track home page Track home page: http://courses.cms.caltech.edu/courses/cs11/material
More informationOutline n Introduction n Background o Distributed DBMS Architecture
Outlie Itroductio Backgroud o Distributed DBMS Architecture Datalogical Architecture Implemetatio Alteratives Compoet Architecture o Distributed DBMS Architecture o Distributed Desig o Sematic Data Cotrol
More information% Sun Logo for Frame. X3T10/95-229, Revision 2. September 28, 1995
Su Microsystems, Ic. 2550 Garcia Aveue Moutai View, CA 94045 415 960-1300 X3T10/95-229, Revisio 2 September 28, 1995 % Su Logo for Frame Joh Lohmeyer Chairperso, X3T10 Symbios Logic Ic. 1635 Aeroplaza
More informationMR-2010I %MktBSize Macro 989. %MktBSize Macro
MR-2010I %MktBSize Macro 989 %MktBSize Macro The %MktBSize autocall macro suggests sizes for balaced icomplete block desigs (BIBDs). The sizes that it reports are sizes that meet ecessary but ot sufficiet
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002
ICS Reget Commuicatios Modules RS-232, RS-422 ad RS-485 (T3150A) Issue 1, March, 06 Commuicatios modules provide a serial commuicatios iterface betwee the cotroller ad exteral equipmet. Commuicatios modules
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationChapter 10 : Concurrency Control
Chapter 10 : Cocurrecy Cotro modified from: Database System Cocepts, 6 th Ed. Siberschatz, Korth ad Sudarsha See www.db-book.com for coditios o re-use Ituitio of Lock-based Protocos Trasactios have to
More informationToday s objectives. CSE401: Introduction to Compiler Construction. What is a compiler? Administrative Details. Why study compilers?
CSE401: Itroductio to Compiler Costructio Larry Ruzzo Sprig 2004 Today s objectives Admiistrative details Defie compilers ad why we study them Defie the high-level structure of compilers Associate specific
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationFAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS
SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG
More informationChapter 8. Strings and Vectors. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 8 Strigs ad Vectors Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Copyright 2015 Pearso Educatio, Ltd..
More informationA Reservation-Based Extended Transaction Protocol
Clevelad State Uiversity EgagedScholarship@CSU Electrical Egieerig & Computer Sciece Faculty Publicatios Electrical Egieerig & Computer Sciece Departmet 2-2008 A Reservatio-Based Exteded Trasactio Protocol
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationGoals of the Lecture Object Constraint Language
Goals of the Lecture Object Costrait Laguage Object-Orieted Aalysis ad Desig - Fall 1998 Preset the Object Costrait Laguage Ð As best as possible, with the limited iformatio available from UML i a Nutshell
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationCOMP Parallel Computing. PRAM (1): The PRAM model and complexity measures
COMP 633 - Parallel Computig Lecture 2 August 24, 2017 : The PRAM model ad complexity measures 1 First class summary This course is about parallel computig to achieve high-er performace o idividual problems
More information