Reading Object Code. A Visible/Z Lesson
|
|
- Jeffery Stevens
- 6 years ago
- Views:
Transcription
1 Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly programmer, it is ritial that we be able to read the mahine ode that is produed for eah instrution. Otherwise, there will be programs that are extremely diffiult to understand and debug. VisibleZ was built to help you visualize eah instrution as it appears in objet ode and wath it exeute. When the assembler proesses an instrution, it onverts the instrution from its mnemoni form to a standard mahine-language (binary) format alled an instrution format. In the proess of onversion, the assembler must determine the type of instrution, onvert symboli labels and expliit notation to a base/displaement format, determine lengths of ertain operands, and parse any literals and onstants. Consider the following Move Charater instrution, MVC COSTOUT,COSTIN The assembler must determine the operation ode (x D2 ) for MVC, determine the length of COSTOUT, and ompute base/displaement addresses for both operands. After assembly, the result whih is alled objet ode, might look something like the following in hexadeimal, D207C008C020 The assembler generated 6 bytes (12 hex digits) of objet ode in a Storage to Storage (SS) type one format. In order to understand the objet ode whih an assembler will
2 generate, we need some familiarity with 5 basi instrution formats (there are many other instrution types overing privileged, non-privileged, and semi-privileged instrutions whih are beyond the sope of this disussion). First we onsider the Storage to Storage type one (SS1) format listed below. This is the instrution format for the MVC instrution above. Byte 1 - mahine operation ode Byte 2 - length -1 in bytes assoiated with operand 1 Byte 3 and 4 - the base/displaement address assoiated with operand 1 Byte 5 and 6 - the base/displaement address assoiated with operand 2 Eah box represents one byte or 8 bits and eah letter represents a single hexadeimal digit or 4 bits. The subsripts indiate the number of the operand used in determining the ontents of the byte. For example, the instrution format indiates that operand 1 is used to ompute L1L1, the length assoiated with the instrution. If we reonsider the assembled form of the MVC instrution above we see that the op-ode is x D2, and the length, derived from COSTOUT, is listed as x 07. Sine the assembler always derements the length by 1 when onverting to mahine ode, we determine that COSTOUT is 8 bytes long - 8 bytes will be moved by this instrution. Additionally we see that the base register for COSTOUT is x C (register 12) and the displaement is x 008. The base/displaement address for COSTIN is x C020. Why was register 12 hosen as the base register? How were the displaements omputed? These parts of the objet ode ould not be determined by the information given in the example above. In order to determine base/displaement addresses we must examine the USING and DROP diretives that are oded in the program. These diretives are disussed in the topi alled BASE DISPLACEMENT ADDRESSING on the website.
3 Being able to read objet ode is a neessary skill for an assembler programmer as knowledge of an instrution s format gives several important lues about semantis of the instrution. For example, knowing that MVC is a storage to storage type one instrution, informs us that both operands are fields in memory and that the first operand will determine the number of bytes that will be moved. Sine the length (L1L1) oupies one byte or 8 bits, the maximum length we an reate is = 255. Reall that the assembler derements the length when assembling, so the instrution is apable of moving a maximum of 256 bytes. The 256 byte limitation is shared by all storage to storage type one instrutions. Storage to Storage type two (SS2) is a variation on SS1. Byte 1 - mahine operation ode Byte 2 - L1 - the length assoiated with operand 1 (4 bits) L2 - the length assoiated with operand 2 (4 bits) Byte 3 and 4 - the base/displaement address assoiated with operand 1 Byte 5 and 6 - the base/displaement address assoiated with operand 2 The only differene between SS1 and SS2 is the length byte. Notie that both operands ontribute a length in the seond byte. Sine eah length is 4 bits, the maximum value that ould be represented is = 15. Again, sine the assembler derements the length by 1, the instrution an proess operands that are large as 16 bytes. There are many arithmeti instrutions that require the mahine to use the length of both operands. Consider the example below,
4 Objet Code Soure Code AFIELD DS PL4 BFIELD DS PL2... FA31C300C304 AP AFIELD,BFIELD AP (Add Paked) is an instrution whose format is SS2. Looking at the objet ode that was generated, we see that x FA is the op-ode and that the length of the first operand is x 3 whih was omputed by subtrating 1 from the length of AFIELD. Similarly, the length of BFIELD was used to generate the seond length of x 1. In exeuting this instrution, the mahine makes use of the size of both fields. In this ase, a 2-byte field is added to a 4-byte field. A third type of instrution format is Register to Register (RR). Byte 1 - mahine operation ode Byte 2 - R1 - the register whih is operand 1 R2 - the register whih is operand 2 Instrutions of this type have two operands, both of whih are registers. An example of an instrution of this type is LR (Load Register). The effet of the instrution is to opy the ontents of the register speified by operand 2 into the register speified by operand 1. The following LR (Load Register) instrution,
5 LR R3,R12 would ause register 12 to be opied into register 3. The assembler would produe the objet ode listed below as a result of the LR instrution. 183C Examining the objet ode we see that the op-ode is x 18, operand 1 is register 3, and operand 2 is register 12. You should note that 4 bits are enough to represent any of the registers whih are numbered 0 through 15. A fourth type of instrution format is Register to Indexed Storage (RX). Byte 1 - mahine operation ode Byte 2 - R1 - the register whih is operand 1 X2 - the index register assoiated with operand 2 Byte 3 and 4 - the base/displaement address assoiated with operand 2 For instrutions of this type, the first operand is a register and the seond operand is a storage loation. The storage loation is designated by a base/displaement address as well as an index register. The subjet of index registers is disussed in the topi BASE DISPLACEMENT ADDRESSING. L (Load) is an example of an instrution of type RX. Consider the example below.
6 L R5,TABLE(R7) The Load instrution opies a fullword from memory into a register. The above instrution might assemble as follows, 5857C008 The op-ode is x 58, operand 1 is speified as x 5, the index register is denoted x 7 and Operand 2 generates the base/displaement address x C008. Again, from the information given in the example above, there is no way to determine how the base/displaement address was omputed without looking at the USING statements in the program. Related to the RX type is a similar instrution format alled Register to Storage (RS). In this type the index register is replaed by a register referene or a 4-bit mask (pattern) R3 below. One instrution whih has a Register to Storage format is STM (Store Multiple). An example of how STM an be oded is as follows, STM R14,R12,12(R13) The previous instrution would generate the following objet ode, 90ECD00C
7 where x 90 is the op-ode, x E = 14 is operand 1, x C = 12, is treated as R3, and x D00C is generated from an expliit base/displaement address (12(R13)). The fifth and final instrution format that we will onsider is alled Storage Immediate (SI). In this format, the seond operand, alled the immediate onstant, resides in the seond byte of the instrution. This onstant is usually speified as a self-defining term. The format for SI instrutions is listed below. Byte 1 - mahine operation ode Byte 2 - I2I2 - the immediate onstant denoted in operand 2 Byte 3 and 4 - the base/displaement address assoiated with operand 1 An example of a storage immediate instrution is Compare Logial Immediate (CLI). This instrution will ompare one byte in storage to the immediate byte whih resides in the instrution itself. We see from the instrution format that operand 2 is the immediate onstant. For example, onsider the instrution below. CLI CUSTTYPE,C A When assembled, the objet ode might look like the following,
8 95C1C100 The op-ode is x 95, the self-defining term C A is onverted to the EBCDIC representation x C1, and the variable CUSTTYPE would generate the base/displaement address x C100. Again, there is not enough information provided to determine the exat base/displaement address for CUSTTYPE. The x C100 address is merely an example of what might be generated. Trying It Out in VisibleZ: 1) Load the program readingobjetcode.obj from the \Codes diretory and single step through eah instrution. Identify the type and parts of eah instrution below. The ode doesn t do anything but is representative of the different instrution formats you will enounter. Answers are provided at the end. 90 e d0 0 Instrution Type 90 e d 00 0d 0 Instrution Type 0d 0
9 e Instrution Type e d a Instrution Type d a Instrution Type
10 fa e 0 23 Instrution Type fa e f Instrution Type 07 f Answers: 90 e d0 0 Instrution Type = RS 90 = op ode (STM) e d = operand 1 register = operand 3 register = operand 2 base register 00 = operand 2 displaement
11 0d 0 Instrution Type = RR 0d = op ode (BASR) = operand 1 register 0 = operand 2 register e Instrution Type = RX 41 = op ode (LA) 2 = operand 1 register 0 = operand 2 index register (none) = operand 2 base register 00e = operand 2 displaement d a Instrution Type = SS1 d2 = op ode (MVC) 03 = length of operand 1 (minus 1) = operand 1 base register 016 = operand 1 displaement = operand 2 base register 01a = operand 2 displaement
12 Instrution Type = SI 92 = op ode (MVI) 1 = immediate onstant (operand 2) = operand 1 base register 026 = operand 1 displaement fa e 0 23 Instrution Type = SS2 fa = op ode (AP) 4 = length of op 1 (minus 1) 2 = length of op 2 (minus 1) = operand 1 base register 01e = operand 1 displaement = operand 2 base register 023 = operand 2 displaement 07 f Instrution Type = RR 07 = op ode (BCR) f = operand 1 register = operand 2 register
Reading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationBackground/Review on Numbers and Computers (lecture)
Bakground/Review on Numbers and Computers (leture) ICS312 Mahine-Level and Systems Programming Henri Casanova (henri@hawaii.edu) Numbers and Computers Throughout this ourse we will use binary and hexadeimal
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationChapter 6 What's this Stuff on the Left?
Chapter 6 What's this Stuff on the Left? Objectives Upon completion of this chapter you will be able to: Describe the SI instruction format as used with the MVI and CLI instructions, Describe the SS instruction
More informationCS:APP2e Web Aside ASM:X87: X87-Based Support for Floating Point
CS:APP2e Web Aside ASM:X87: X87-Based Support for Floating Point Randal E. Bryant David R. O Hallaron June 5, 2012 Notie The material in this doument is supplementary material to the book Computer Systems,
More informationZDT -A Debugging Program for the Z80
ZDT -A Debugging Program for the Z80 il I,, 1651 Third Ave.. New York, N.Y. 10028 (212) 860-o300 lnt'l Telex 220501 ZOT - A DEBUGGING PROGRAM FOR THE ZAO Distributed by: Lifeboat Assoiates 1651 Third Avenue
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationTotal 100
CS331 SOLUTION Problem # Points 1 10 2 15 3 25 4 20 5 15 6 15 Total 100 1. ssume you are dealing with a ompiler for a Java-like language. For eah of the following errors, irle whih phase would normally
More informationCompilation Lecture 11a. Register Allocation Noam Rinetzky. Text book: Modern compiler implementation in C Andrew A.
Compilation 0368-3133 Leture 11a Text book: Modern ompiler implementation in C Andrew A. Appel Register Alloation Noam Rinetzky 1 Registers Dediated memory loations that an be aessed quikly, an have omputations
More information'* ~rr' _ ~~ f' lee : eel. Series/1 []J 0 [[] "'l... !l]j1. IBM Series/1 FORTRAN IV. I ntrod uction ...
---- --- - ----- - - - --_.- --- Series/1 GC34-0132-0 51-25 PROGRAM PRODUCT 1 IBM Series/1 FORTRAN IV I ntrod ution Program Numbers 5719-F01 5719-F03 0 lee : eel II 11111111111111111111111111111111111111111111111
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationCOMP 181. Prelude. Intermediate representations. Today. Types of IRs. High-level IR. Intermediate representations and code generation
Prelude COMP 181 Intermediate representations and ode generation November, 009 What is this devie? Large Hadron Collider What is a hadron? Subatomi partile made up of quarks bound by the strong fore What
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationrepresent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to
Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat
More informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationAllocating Rotating Registers by Scheduling
Alloating Rotating Registers by Sheduling Hongbo Rong Hyunhul Park Cheng Wang Youfeng Wu Programming Systems Lab Intel Labs {hongbo.rong,hyunhul.park,heng..wang,youfeng.wu}@intel.om ABSTRACT A rotating
More informationGraphs in L A TEX. Robert A. Beeler. January 8, 2017
Graphs in L A TEX Robert A. Beeler January 8, 2017 1 Introdution This doument is to provide a quik and dirty guide for building graphs in L A TEX. Muh of the doument is devoted to examples of things that
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationAssembler Programming
31-Bit Mode - Assembler Programming... 13:3 4095 - Limit... 4:17 A ACB: Access Method Control Block...10:2-3 Access Method... 6:1 Add Instructions - A, AR, and AH... 4:8 Addressability... 1:9 Addressing...
More informationDirect-Mapped Caches
A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.
More informationOFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM S. SRIDARAN. Thesis submitted to the Faculty of the
OFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM by S. SRIDARAN Thesis submitted to the Faulty of the Virginia Polytehni Institute and State University in partial fulfillment
More informationDefect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing
Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,
More informationPage INTRODUCTION PART I - THE PLATO SYSTEM
INTRODUCTION PART I - THE PLATO SYSTEM Page A. General Desription - PLATO Ilardware............ B. Relationship of PLATO Hardware to Software....... C. System Operation by Student Input.... D. Relationship
More information13.1 Numerical Evaluation of Integrals Over One Dimension
13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied
More informationUCSB Math TI-85 Tutorials: Basics
3 UCSB Math TI-85 Tutorials: Basis If your alulator sreen doesn t show anything, try adjusting the ontrast aording to the instrutions on page 3, or page I-3, of the alulator manual You should read the
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationMATH STUDENT BOOK. 12th Grade Unit 6
MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE
More informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
More informationEXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Distribution Category UC-705 EXODUS II: A Finite Element Data Model Larry A. Shoof, Vitor R. Yarberry Computational Mehanis and Visualization Department
More informationPerformance Benchmarks for an Interactive Video-on-Demand System
Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department
More information1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.
C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion
More informationAssembler Language "Boot Camp" Part 3 - Assembly and Execution; Branching SHARE 115 in Boston August 3, 2009
Assembler Language "Boot Camp" Part 3 - Assembly and Execution; Branching SHARE 115 in Boston August 3, 2009 Introduction Who are we? John Ehrman, IBM Software Group Dan Greiner, IBM Systems & Technology
More informationPath Sharing and Predicate Evaluation for High-Performance XML Filtering*
Path Sharing and Prediate Evaluation for High-Performane XML Filtering Yanlei Diao, Mihael J. Franklin, Hao Zhang, Peter Fisher EECS, University of California, Berkeley {diaoyl, franklin, nhz, fisherp}@s.erkeley.edu
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationConnection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD
Connetion Guide Page 1 of 5 Connetion Guide Installing the printer loally (Windows) Note: If the Software and Doumentation CD does not support the operating system, you must use the Add Printer Wizard.
More informationAnd, the (low-pass) Butterworth filter of order m is given in the frequency domain by
Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationwith respect to the normal in each medium, respectively. The question is: How are θ
Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent
More informationtimestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else
3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and
More informationAssembler Language "Boot Camp" Part 2 - Instructions and Addressing. SHARE 118 in Atlanta Session March 12, 2012
Assembler Language "Boot Camp" Part 2 - Instructions and Addressing SHARE 118 in Atlanta Session 10345 March 12, 2012 1 Introduction Who are we? John Ehrman, IBM Software Group Dan Greiner, IBM Systems
More informationSAND Unlimited Release Printed November 1995 Updated November 29, :26 PM EXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Updated November 29, 2006 12:26 PM EXODUS II: A Finite Element Data Model Gregory D. Sjaardema (updated version) Larry A. Shoof, Vitor R. Yarberry Computational
More informationAssembler Language "Boot Camp" Part 2 - Instructions and Addressing SHARE 116 in Anaheim February 28, 2011
Assembler Language "Boot Camp" Part 2 - Instructions and Addressing SHARE 116 in Anaheim February 28, 2011 Introduction Who are we? John Ehrman, IBM Software Group John Dravnieks, IBM Software Group Dan
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationThe recursive decoupling method for solving tridiagonal linear systems
Loughborough University Institutional Repository The reursive deoupling method for solving tridiagonal linear systems This item was submitted to Loughborough University's Institutional Repository by the/an
More information1 The Knuth-Morris-Pratt Algorithm
5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on
More informationDepartment of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Test I Solutions
Department of Eletrial Engineering and Computer iene MAACHUETT INTITUTE OF TECHNOLOGY 6.035 Fall 2016 Test I olutions 1 I Regular Expressions and Finite-tate Automata For Questions 1, 2, and 3, let the
More informationAn Evaluation of Automatic and Interactive Parallel Programming Tools
An Evaluation of Automati and Interative Parallel Programming Tools Doreen Y Cheng Computer Siene Co NASA Ames Researh Center MS 258-6 Moffett Field, CA 9435 Douglas M Pase Formerly at NASA (CSC) Cray
More informationSYS-ED/COMPUTER EDUCATION TECHNIQUES, INC.
Chapter 1: Assembler Language: Introduction Differences between machine and assembler instructions. Macro instructions. Assembly and link editing. Assembler processing. Macro and copy libraries. Control
More informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationPASCAL 64. "The" Pascal Compiler for the Commodore 64. A Data Becker Product. >AbacusiII Software P.O. BOX 7211 GRAND RAPIDS, MICK 49510
PASCAL 64 "The" Pasal Compiler for the Commodore 64 A Data Beker Produt >AbausiII Software P.O. BOX 7211 GRAND RAPIDS, MICK 49510 7010 COPYRIGHT NOTICE ABACUS Software makes this pakage available for use
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationDesign Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis
Design Impliations for Enterprise Storage Systems via Multi-Dimensional Trae Analysis Yanpei Chen, Kiran Srinivasan, Garth Goodson, Randy Katz University of California, Berkeley, NetApp In. {yhen2, randy}@ees.berkeley.edu,
More informationCA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1
Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationScheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiprocessor
Sheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiproessor Orlando Moreira NXP Semiondutors Researh Eindhoven, Netherlands orlando.moreira@nxp.om Frederio Valente Universidade
More informationConnection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD
Page 1 of 7 Connetion Guide Installing the printer loally (Windows) Note: When installing a loally attahed printer, if the operating system is not supported y the Software and Doumentation CD, then the
More informationAdobe Certified Associate
Adobe Certified Assoiate About the Adobe Certified Assoiate (ACA) Program The Adobe Certified Assoiate (ACA) program is for graphi designers, Web designers, video prodution designers, and digital professionals
More informationReverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis
Reverse Engineering of Assembler Programs: A Model-Based Approah and its Logial Basis Tom Lake and Tim Blanhard, InterGlossa Ltd., Reading, UK Tel: +44 174 561919 email: {Tom.Lake,Tim.Blanhard}@glossa.o.uk
More informationCoupling of MASH-MORSE Adjoint Leakages with Spaceand Time-Dependent Plume Radiation Sources
ORNL/TM-2000/335 oupling of MASH-MORSE Adjoint Leakages with Spaeand Time-Dependent Plume Radiation Soures. O. Slater J. M. Barnes J. O. Johnson J. P. Renier R. T. Santoro DOUMENT AVAILABILITY Reports
More informationAn Event Display for ATLAS H8 Pixel Test Beam Data
An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now
More informationAN INTRODUCTION TO FORTRAN AND NUMERICAL MODELING
AN INTRODUCTION TO FORTRAN AND NUMERICAL MODELING Dr. L. W. Shwartz Department of Mehanial Engineering University of Delaware September, 2000 INTRODUCTION The first part of this short doument ontains a
More informationDesign Patterns. Patterns.mkr Page 223 Wednesday, August 25, :17 AM
Patterns.mkr Page 223 Wednesday, August 25, 1999 2:17 AM Design Patterns n the earlier hapters, we have seen that a entral goal of objet-oriented programming is the support of ode reuse. This hapter examines
More informationMultiple Assignments
Two Outputs Conneted Together Multiple Assignments Two Outputs Conneted Together if (En1) Q
More informationPROJECT PERIODIC REPORT
FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise
More informationRe-programming a many-to-many merge with Hash Objects
Re-programming a many-to-many merge with Hash Objets CS05 PhUSE 2012 Budapest D. J. Garbutt 17 Otober 2012 Why? 1 In this talk I will demonstrate how you an re-program a many-to-many merge using hash objets
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationRapid, accurate particle tracking by calculation of radial symmetry centers
Rapid, aurate partile traing by alulation of radial symmetry enters Raghuveer Parthasarathy Supplementary Text and Figures Supplementary Figures Supplementary Figure 1 Supplementary Figure Supplementary
More informationData I/O and Post- Processing Utilities
Chapter 10: Data I/O and Post-Proessing Utilities 10 Data I/O and Post- Proessing Utilities 10.1. ARPS History Data Format and I/O As desribed in Setion 3.7, ARPS supports a number of history data formats.
More informationAssembler Language "Boot Camp" Part 5 - Decimal and Logical Instructions. SHARE 117 in Orlando Session 9214 August 11, 2011
Assembler Language "Boot Camp" Part 5 - Decimal and Logical Instructions SHARE 117 in Orlando Session 9214 August 11, 2011 1 Introduction Who are we? John Ehrman, IBM Software Group Dan Greiner, IBM Systems
More informationEvolutionary Feature Synthesis for Image Databases
Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,
More informationStaircase Join: Teach a Relational DBMS to Watch its (Axis) Steps
Stairase Join: Teah a Relational DBMS to Wath its (Axis) Steps Torsten Grust Maurie van Keulen Jens Teubner University of Konstanz Department of Computer and Information Siene P.O. Box D 88, 78457 Konstanz,
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationSparse Certificates for 2-Connectivity in Directed Graphs
Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale
More informationExploiting Enriched Contextual Information for Mobile App Classification
Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center
More informationDefine - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations)
Global Iterative Solution Distributed proessing of the attitude updating L. Lindegren (21 May 2001) SAG LL 37 Abstrat. The attitude updating algorithm given in GAIA LL 24 (v. 2) is modified to allow distributed
More informationAutomated Test Generation from Vulnerability Signatures
Automated Test Generation from Vulneraility Signatures Adulaki Aydin, Muath Alkhalaf, and Tevfik Bultan Computer Siene Department University of California, Santa Barara Email: {aki,muath,ultan}@s.us.edu
More informationCA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0
Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer
More informationType RS Instruction Format This is a four byte instruction of the form OP R1,R3,D2(B2). Type Bytes Operands RS 4 R1,R3,D2(B2) OP R 1 R 3 B 2
Type RS Instruction Format This is a four byte instruction of the form OP R1,R3,D2(B2). Type Bytes Operands 1 2 3 4 RS 4 R1,R3,D2(B2) OP R 1 R 3 B 2 D 2 D 2 D 2 The first byte contains the 8 bit instruction
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationPHYS 3437: Computational Methods in Physics, Assignment 2
PHYS 3437: Computational Methods in Physis, Assignment 2 Set January 27th due Feb 26th NOTE: This assignment is potentially quite lengthy if you are urrently developing your programming skills. If so,
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationTavultesoft Keyboard Manager. User s Guide and Reference. Tavultesoft
Tavultesoft Keyboard Manager User s Guide and Referene VERSION 4.0 Tavultesoft This doumentation may be freely opied, but the opyright notie must not be altered or removed. No part of this doumentation
More informationPACKED DECIMAL ARITHMETIC
PACKED DECIMAL ARITHMETIC Packed decimal is a convenient format for doing many arithmetic calculations in assembly language for several reasons: 1) All computations occur in integer arithmetic (no decimals,
More informationTree Awareness for Relational DBMS Kernels: Staircase Join
Tree Awareness for Relational DBMS Kernels: Stairase Join Torsten Grust 1 and Maurie van Keulen 2 1 Department of Computer and Information Siene, University of Konstanz, P.O. Box D188, 78457 Konstanz,
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationSupplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features
Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed
More information