DOCSLIB.ORG

Am29050 Micro RISC Microprocessor with On-Chip Floating-Point Unit Devices

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

FINAL Advanced Am29050 Micro RISC Microprocessor with On-Chip Floating-Point Unit Devices DISTINCTIVE CHARACTERISTICS 64-entry Memory Management Unit (MMU) with region mapping Full 32-bit, three-bus architecture 1024-byte branch target cache 55 million instructions per second (MIPS) sustained at 40 MHz 4-entry physical address cache On-chip double-precision floating-point Demultiplexed and pipelined address, arithmetic unit instruction, and data buses 80-megaflop peak floating-point execution 192 general-purpose registers at 40 MHz Three-address instruction architecture 40-, 33-, 25-, and 20-MHz operating frequencies On-chip byte-alignment support allows CMOS technology/TTL compatible optional byte/half-word accesses 4-Gbyte virtual address space Pin and bus compatibility with Am29000 and with demand paging Am29005 microprocessors Concurrent instruction and data accesses Binary compatibility with all 29K microprocessors and microcontrollers Burst-mode access support Advanced debugging support SIMPLIFIED BLOCK DIAGRAM AddressAm29050 Data RISC Microprocessor 32 32 32 Instruction ROM Instruction Instruction Memory Data Memory Publication# 15039 Rev. B Amendment /0 Issue Date: December 1994. WWW: 5/4/95 AMD A D V A N C E I N F O R M A T I O N DISTINCTIVE CHARACTERISTICS 1 SIMPLIFIED BLOCK DIAGRAM 1 GENERAL DESCRIPTION 3 RELATED AMD PRODUCTS 3 29K FAMILY DEVELOPMENT SUPPORT PRODUCTS 3 THIRD-PARTY DEVELOPMENT SUPPORT PRODUCTS 3 ORDERING INFORMATION 4 LOGIC SYMBOL 5 KEY FEATURES AND BENEFITS 6 PERFORMANCE OVERVIEW 8 CONNECTION DIAGRAM 12 169-LEAD PGA 12 PGA Pin Designations by Pin Number 13 PGA Pin Designations by Pin Name 14 PIN DESCRIPTIONS 15 ABSOLUTE MAXIMUM RATINGS 19 OPERATING RANGES 19 DC CHARACTERISTICS over COMMERCIAL and INDUSTRIAL Operating Ranges 19 CAPACITANCE 19 SWITCHING CHARACTERISTICS over COMMERCIAL Operating Range 21 SWITCHING CHARACTERISTICS over INDUSTRIAL Operating Range 22 SWITCHING WAVEFORMS 25 CAPACITIVE OUTPUT DELAYS 28 SWITCHING TEST CIRCUIT 28 THERMAL CHARACTERISTICS 29 PHYSICAL DIMENSIONS 30 CGX 169 30 2 Am29050 Microprocessor AMD GENERAL DESCRIPTION and imaging applications with fast 3D performance and gives printers the highest performance page description The Am29050 RISC microprocessor is a high-perfor- language (PDL) possible. mance, general-purpose, 32-bit microprocessor imple- mented in CMOS technology. It supports a variety of The Am29050 microprocessor instruction set has been applications by virtue of a flexible architecture and rapid influenced by the results of high-level language, optimiz- execution of simple instructions that are common to a ing compiler research. It is appropriate for a variety of lan- wide range of tasks. guages because it efficiently executes operations that are common to all languages. Consequently, the Am29050 The Am29050 microprocessor meets the demanding microprocessor is an ideal target for high-level languages requirements of floating-point intensive embedded ap- such as C, FORTRAN, Pascal, Ada, and COBOL. plications such as X terminals, signal processing, and digital communications. Because it excels at complex The processor is available in a 169-lead pin grid array math operations required for fast matrix transforma- (PGA) package. The PGA has 141 signal pins, 27 power tions, the Am29050 microprocessor provides graphics and ground pins, and 1 alignment pin. RELATED AMD PRODUCTS 29K Family Devices Part No. Description Am29000 32-bit RISC microprocessor Am29005 Low-cost 32-bit RISC microprocessor with no MMU and no branch target cache Am29030 32-bit RISC microprocessor with 8-Kbyte instruction cache Am29035 32-bit RISC microprocessor with 4-Kbyte instruction cache Am29040 32-bit RISC microprocessor with 8-Kbyte instruction cache and 4-Kbyte data cache Am29200 32-bit RISC microcontroller Am29205 Low-cost 32-bit RISC microcontroller with 16-bit bus interface Am29240 32-bit RISC microcontroller with 4-Kbyte instruction cache and 2-Kbyte data cache Am29243 32-bit RISC data microcontroller with instruction and data caches and DRAM parity Am29245 Low-cost 32-bit RISC microcontroller with 4-Kbyte instruction cache 29K FAMILY DEVELOPMENT SUPPORT PRODUCTS Contact your local AMD representative for information Assembler and utility packages on the complete set of development support tools. The Source- and assembly-level software debuggers following software and hardware development products are available on several hosts: Target-resident development monitors Simulators Optimizing compilers for common high-level Demonstration and evaluation systems languages THIRD-PARTY DEVELOPMENT SUPPORT PRODUCTS The Fusion29K Program of Partnerships for Applica- Modeling/simulation tools tion Solutions provides the user with a vast array of prod- Software development tools ucts designed to meet critical time-to-market needs. Products and solutions available from the AMD Fu- Real-time operating systems (RTOS) sion29K Partners include Application-specific hardware and software Silicon products Board-level products Emulators Manufacturing and prototyping support Hardware and software debuggers Custom support and training Am29050 Microprocessor 3 AMD ORDERING INFORMATION Standard Products AMD standard products are available in several packages and operating ranges. Valid order numbers are formed by a combination of the elements below. AM29050 –25G C SHIPPING OPTION Blank = Standard Processing B = Burn-in TEMPERATURE RANGE C = Commercial (TC =0°C to +85°C) I = Industrial (TC = –40°C to +125°C *) * TC =TJ = 125°C max PACKAGE TYPE G = 169-Lead Pin Grid Array (CG169) SPEED OPTION –40 = 40 MHz –33 = 33 MHz –25 = 25 MHz –20 = 20 MHz DEVICE NUMBER/DESCRIPTION Am29050 RISC Microprocessor with On-Chip Floating-Point Unit Valid Combinations Comments Valid Combinations Valid Combinations list configurations AM29050–40 With heat sink planned to be supported in volume for AM29050–33 With heat sink GC this device. Consult the local AMD sales AM29050–25 Without heat sink office to confirm availability of specific AM29050–20 Without heat sink valid combinations and to check on newly released combinations. AM29050–33 With heat sink AM29050–25 GI Without heat sink AM29050–20 Without heat sink 4 Am29050 Microprocessor AMD LOGIC SYMBOL BREQ BGRT PEN BINV IRDY R/W IERR SUP/US IBACK LOCK 2 DRDY MPGM1–MPGM0 DERR IREQ DBACK PDA CDA DBREQ 2 WARN DREQT1–DREQT0 4 INTR2–INTR0 MSERR 2 CNTL1–CNTL0 RESET OPT2–OPT0 3 TEST STAT2–STAT0 3 INCLK IREQT 2 TRAP1–TRAP0 PIA 32 I31–I0 IBREQ PWRCLK A31–A0 32 SYSCLK D31–D0 Am29050 Microprocessor 5 AMD KEY FEATURES AND BENEFITS The Am29050 microprocessor extends the 29K Family table that contains the most recently used address of processors with a high-performance, pipelined, on- translations for the processor. TLB entries are modified chip floating-point unit. The floating-point unit performs directly by processor instructions. A TLB entry consists IEEE-compatible, single-precision and double-preci- of 64 bits and appears as two word-length TLB registers sion arithmetic at a peak rate of 80 million floating-point that can be inspected and modified by instructions. operations per second (MFLOPS) at 40 MHz. The Am29050 microprocessor also has features to improve In addition to page-by-page address translation, the the performance of loads and branches, allowing sus- Am29050 microprocessor supports translation for vari- tained integer performance of 55 million instructions per able-sized regions. The region mapping units map virtu- second (MIPS) at 40 MHz. al regions of variable size ranging from 64 Kbyte to 2 Gbyte into regions of physical memory. Each region The Am29050 microprocessor provides a powerful up- mapping unit consists of two protected special-purpose grade to the Am29000 microprocessor. It can be used in registers. Any virtual address not mapped by the region existing Am29000 processor applications without hard- mapping units is translated by the TLB. ware or software modifications, bringing a dramatic in- crease in performance to floating-point-intensive Branch Target Cache applications, particularly graphics and laser-printer ap- The branch target cache on the Am29050 microproces- plications. sor allows fast access to instructions fetched nonse- quentially. This keeps the instruction pipeline full until Added features include a pipelined floating-point arith- the processor can establish a new instruction-prefetch metic unit, region mapping for virtual-to-physical ad- stream from the external instruction memory. A branch dress translation, a monitor mode for debugging instruction can execute in a single cycle if the branch tar- supervisor code, and instruction breakpoints for en- get is in the branch target cache. hanced debugging. Specific performance enhance- ments to the Am29000 microprocessor include a larger The branch target cache is a 1-Kbyte storage array that branch target cache, a physical address cache, an early contains blocks of instructions from recently taken address generator, and instruction forwarding logic. branches. To improve the proportion of successful searches, the branch target cache is organized as a On-Chip Floating-Point Arithmetic Unit two-way set-associative memory. The branch target An on-chip floating-point unit performs single- and cache can be configured under software control to double-precision floating-point operations in accor- cache either two or four instructions for each branch. dance with the IEEE Standard for Binary Floating-Point Each of the two sets in the branch target cache contains Arithmetic (ANSI/IEEE Standard 754-1985).
Recommended publications
  • Common Object File Format (COFF)

    Common Object File Format (COFF)

    Application Report SPRAAO8–April 2009 Common Object File Format ..................................................................................................................................................... ABSTRACT The assembler and link step create object files in common object file format (COFF). COFF is an implementation of an object file format of the same name that was developed by AT&T for use on UNIX-based systems. This format encourages modular programming and provides powerful and flexible methods for managing code segments and target system memory. This appendix contains technical details about the Texas Instruments COFF object file structure. Much of this information pertains to the symbolic debugging information that is produced by the C compiler. The purpose of this application note is to provide supplementary information on the internal format of COFF object files. Topic .................................................................................................. Page 1 COFF File Structure .................................................................... 2 2 File Header Structure .................................................................. 4 3 Optional File Header Format ........................................................ 5 4 Section Header Structure............................................................. 5 5 Structuring Relocation Information ............................................... 7 6 Symbol Table Structure and Content........................................... 11 SPRAAO8–April 2009
  • Virtual Memory - Paging

    Virtual Memory - Paging

    Virtual memory - Paging Johan Montelius KTH 2020 1 / 32 The process code heap (.text) data stack kernel 0x00000000 0xC0000000 0xffffffff Memory layout for a 32-bit Linux process 2 / 32 Segments - a could be solution Processes in virtual space Address translation by MMU (base and bounds) Physical memory 3 / 32 one problem Physical memory External fragmentation: free areas of free space that is hard to utilize. Solution: allocate larger segments ... internal fragmentation. 4 / 32 another problem virtual space used code We’re reserving physical memory that is not used. physical memory not used? 5 / 32 Let’s try again It’s easier to handle fixed size memory blocks. Can we map a process virtual space to a set of equal size blocks? An address is interpreted as a virtual page number (VPN) and an offset. 6 / 32 Remember the segmented MMU MMU exception no virtual addr. offset yes // < within bounds index + physical address segment table 7 / 32 The paging MMU MMU exception virtual addr. offset // VPN available ? + physical address page table 8 / 32 the MMU exception exception virtual address within bounds page available Segmentation Paging linear address physical address 9 / 32 a note on the x86 architecture The x86-32 architecture supports both segmentation and paging. A virtual address is translated to a linear address using a segmentation table. The linear address is then translated to a physical address by paging. Linux and Windows do not use use segmentation to separate code, data nor stack. The x86-64 (the 64-bit version of the x86 architecture) has dropped many features for segmentation.
  • Address Translation

    Address Translation

    CS 152 Computer Architecture and Engineering Lecture 8 - Address Translation John Wawrzynek Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~johnw http://inst.eecs.berkeley.edu/~cs152 9/27/2016 CS152, Fall 2016 CS152 Administrivia § Lab 2 due Friday § PS 2 due Tuesday § Quiz 2 next Thursday! 9/27/2016 CS152, Fall 2016 2 Last time in Lecture 7 § 3 C’s of cache misses – Compulsory, Capacity, Conflict § Write policies – Write back, write-through, write-allocate, no write allocate § Multi-level cache hierarchies reduce miss penalty – 3 levels common in modern systems (some have 4!) – Can change design tradeoffs of L1 cache if known to have L2 § Prefetching: retrieve memory data before CPU request – Prefetching can waste bandwidth and cause cache pollution – Software vs hardware prefetching § Software memory hierarchy optimizations – Loop interchange, loop fusion, cache tiling 9/27/2016 CS152, Fall 2016 3 Bare Machine Physical Physical Address Inst. Address Data Decode PC Cache D E + M Cache W Physical Memory Controller Physical Address Address Physical Address Main Memory (DRAM) § In a bare machine, the only kind of address is a physical address 9/27/2016 CS152, Fall 2016 4 Absolute Addresses EDSAC, early 50’s § Only one program ran at a time, with unrestricted access to entire machine (RAM + I/O devices) § Addresses in a program depended upon where the program was to be loaded in memory § But it was more convenient for programmers to write location-independent subroutines How
  • Lecture 12: Virtual Memory Finale and Interrupts/Exceptions 1 Review And

    Lecture 12: Virtual Memory Finale and Interrupts/Exceptions 1 Review And

    EE360N: Computer Architecture Lecture #12 Department of Electical and Computer Engineering The University of Texas at Austin October 9, 2008 Disclaimer: The contents of this document are scribe notes for The University of Texas at Austin EE360N Fall 2008, Computer Architecture.∗ The notes capture the class discussion and may contain erroneous and unverified information and comments. Lecture 12: Virtual Memory Finale and Interrupts/Exceptions Lecture #12: October 8, 2008 Lecturer: Derek Chiou Scribe: Michael Sullivan and Peter Tran Lecture 12 of EE360N: Computer Architecture summarizes the significance of virtual memory and introduces the concept of interrupts and exceptions. As such, this document is divided into two sections. Section 1 details the key points from the discussion in class on virtual memory. Section 2 goes on to introduce interrupts and exceptions, and shows why they are necessary. 1 Review and Summation of Virtual Memory The beginning of this lecture wraps up the review of virtual memory. A broad summary of virtual memory systems is given first, in Subsection 1.1. Next, the individual components of the hardware and OS that are required for virtual memory support are covered in 1.2. Finally, the addressing of caches and the interface between the cache and virtual memory are described in 1.3. 1.1 Summary of Virtual Memory Systems Virtual memory automatically provides the illusion of a large, private, uniform storage space for each process, even on a limited amount of physically addressed memory. The virtual memory space available to every process looks the same every time the process is run, irrespective of the amount of memory available, or the program’s actual placement in main memory.
  • CS 351: Systems Programming

    CS 351: Systems Programming

    Virtual Memory CS 351: Systems Programming Michael Saelee <[email protected]> Computer Science Science registers cache (SRAM) main memory (DRAM) local hard disk drive (HDD/SSD) remote storage (networked drive / cloud) previously: SRAM ⇔ DRAM Computer Science Science registers cache (SRAM) main memory (DRAM) local hard disk drive (HDD/SSD) remote storage (networked drive / cloud) next: DRAM ⇔ HDD, SSD, etc. i.e., memory as a “cache” for disk Computer Science Science main goals: 1. maximize memory throughput 2. maximize memory utilization 3. provide address space consistency & memory protection to processes Computer Science Science throughput = # bytes per second - depends on access latencies (DRAM, HDD) and “hit rate” Computer Science Science utilization = fraction of allocated memory that contains “user” data (aka payload) - vs. metadata and other overhead required for memory management Computer Science Science address space consistency → provide a uniform “view” of memory to each process 0xffffffff Computer Science Science Kernel virtual memory Memory (code, data, heap, stack) invisible to 0xc0000000 user code User stack (created at runtime) %esp (stack pointer) Memory mapped region for shared libraries 0x40000000 brk Run-time heap (created by malloc) Read/write segment ( , ) .data .bss Loaded from the Read-only segment executable file (.init, .text, .rodata) 0x08048000 0 Unused address space consistency → provide a uniform “view” of memory to each process Computer Science Science memory protection → prevent processes from directly accessing
  • Chapter 9: Memory Management

    Chapter 9: Memory Management

    Chapter 9: Memory Management I Background I Swapping I Contiguous Allocation I Paging I Segmentation I Segmentation with Paging Operating System Concepts 9.1 Silberschatz, Galvin and Gagne 2002 Background I Program must be brought into memory and placed within a process for it to be run. I Input queue – collection of processes on the disk that are waiting to be brought into memory to run the program. I User programs go through several steps before being run. Operating System Concepts 9.2 Silberschatz, Galvin and Gagne 2002 Binding of Instructions and Data to Memory Address binding of instructions and data to memory addresses can happen at three different stages. I Compile time: If memory location known a priori, absolute code can be generated; must recompile code if starting location changes. I Load time: Must generate relocatable code if memory location is not known at compile time. I Execution time: Binding delayed until run time if the process can be moved during its execution from one memory segment to another. Need hardware support for address maps (e.g., base and limit registers). Operating System Concepts 9.3 Silberschatz, Galvin and Gagne 2002 Multistep Processing of a User Program Operating System Concepts 9.4 Silberschatz, Galvin and Gagne 2002 Logical vs. Physical Address Space I The concept of a logical address space that is bound to a separate physical address space is central to proper memory management. ✦ Logical address – generated by the CPU; also referred to as virtual address. ✦ Physical address – address seen by the memory unit. I Logical and physical addresses are the same in compile- time and load-time address-binding schemes; logical (virtual) and physical addresses differ in execution-time address-binding scheme.
  • One Physical Address Space Per Machine – the Size of a Physical Address Determines the Maximum Amount of Addressable Physical Memory

    One Physical Address Space Per Machine – the Size of a Physical Address Determines the Maximum Amount of Addressable Physical Memory

    Virtual Memory 1 Virtual and Physical Addresses • Physical addresses are provided directly by the machine. – one physical address space per machine – the size of a physical address determines the maximum amount of addressable physical memory • Virtual addresses (or logical addresses) are addresses provided by the OS to processes. – one virtual address space per process • Programs use virtual addresses. As a program runs, the hardware (with help from the operating system) converts each virtual address to a physical address. • the conversion of a virtual address to a physical address is called address translation On the MIPS, virtual addresses and physical addresses are 32 bits long. This limits the size of virtual and physical address spaces. CS350 Operating Systems Winter 2011 Virtual Memory 2 What is in a Virtual Address Space? 0x00400000 − 0x00401b30 text (program code) and read−only data growth 0x10000000 − 0x101200b0 stack high end of stack: 0x7fffffff data 0x00000000 0xffffffff This diagram illustrates the layout of the virtual address space for the OS/161 test application testbin/sort CS350 Operating Systems Winter 2011 Virtual Memory 3 Simple Address Translation: Dynamic Relocation • hardware provides a memory management unit which includes a relocation register • at run-time, the contents of the relocation register are added to each virtual address to determine the corresponding physical address • the OS maintains a separate relocation register value for each process, and ensures that relocation register is reset on each context
  • CS61 Section Notes Week 7 (Fall 2010) Virtual Memory We Are Given a System with the Following Properties

    CS61 Section Notes Week 7 (Fall 2010) Virtual Memory We Are Given a System with the Following Properties

    CS61 Section Notes Week 7 (Fall 2010) Virtual Memory We are given a system with the following properties: • The memory is byte addressable. • Memory accesses are to 4-byte words • Physical addresses are 16 bits wide. • Virtual addresses are 20 bits wide. • The page size is 4096 bytes. • The TLB is 4-way set associative with 16 total entries. In the following tables, all numbers are given in hexadecimal. The contents of the TLB and the page table for the first 32 pages are as follows: TLB Page Table Index Tag PPN Valid VPN PPN Valid VPN PPN Valid 03 B 1 00 7 1 10 6 0 07 6 0 01 8 1 11 7 0 0 28 3 1 02 9 1 12 8 0 01 F 0 03 A 1 13 3 0 31 0 1 04 6 0 14 D 0 12 3 0 05 3 0 15 B 0 1 07 E 1 06 1 0 16 9 0 0B 1 1 07 8 0 17 6 0 2A A 0 08 2 0 18 C 1 11 1 0 09 3 0 19 4 1 2 1F 8 1 0A 1 1 1A F 0 07 5 1 0B 6 1 1B 2 1 07 3 1 0C A 1 1C 0 0 3F F 0 0D D 0 1D E 1 3 10 D 0 0E E 0 1E 5 1 32 0 0 0F D 1 1F 3 1 Question 1a: The box below shows the format of a virtual address. Indicate (by labeling the diagram) the fields that would be used to determine the following: 1 VPO The virtual page offset VPN The virtual page number TLBI The TLB index TLBT The TLB tag 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 VPN VPO TLBT TLBI Question 1b: The box below shows the format of a physical address.
  • Datasheet-AMD-Am29202.Pdf

    Datasheet-AMD-Am29202.Pdf

    Advance Information Advanced Am29202 Micro Low-Cost RISC Microcontroller with Devices IEEE-1284-Compliant Parallel Interface DISTINCTIVE CHARACTERISTICS Completely integrated system for IEEE Std 1284-1994-compliant parallel port cost-sensitive embedded applications interface (peripheral-side only) supports fast requiring high performance bidirectional data transfers. Full 32-bit RISC architecture offers faster — Compatibility, Nibble, Byte, and ECP modes instruction execution and higher performance. — Supports Microsoft Windows Printing System — 32-bit instruction/data bus Bidirectional bit serializer/deserializer for direct — 22-bit address bus connection to raster input and output devices — 192 general-purpose registers 12-line programmable I/O port — Fully pipelined, three-address instruction (8 lines interruptible) architecture DRAM page-mode support improves memory — 104-Mbyte address space access time. — 12-, 16-, and 20-MHz operating frequencies On-chip DRAM mapping reduces memory — 16 VAX MIPS sustained at 20 MHz requirements. Glueless system interfaces with on-chip wait Advanced debugging support state control lower total system cost. — IEEE Std 1149.1-1990-compliant Standard — ROM controller supports four banks of ROM, Test Access Port and Boundary Scan Architec- each separately programmable for 8-, 16-, or ture (JTAG) for testing system hardware 32-bit-wide interface. — Instruction tracing — DRAM controller supports four banks of — UART serial port DRAM, each separately programmable for Software and hardware development tools
  • AMD's Early Processor Lines, up to the Hammer Family (Families K8

    AMD's Early Processor Lines, up to the Hammer Family (Families K8

    AMD’s early processor lines, up to the Hammer Family (Families K8 - K10.5h) Dezső Sima October 2018 (Ver. 1.1) Sima Dezső, 2018 AMD’s early processor lines, up to the Hammer Family (Families K8 - K10.5h) • 1. Introduction to AMD’s processor families • 2. AMD’s 32-bit x86 families • 3. Migration of 32-bit ISAs and microarchitectures to 64-bit • 4. Overview of AMD’s K8 – K10.5 (Hammer-based) families • 5. The K8 (Hammer) family • 6. The K10 Barcelona family • 7. The K10.5 Shanghai family • 8. The K10.5 Istambul family • 9. The K10.5-based Magny-Course/Lisbon family • 10. References 1. Introduction to AMD’s processor families 1. Introduction to AMD’s processor families (1) 1. Introduction to AMD’s processor families AMD’s early x86 processor history [1] AMD’s own processors Second sourced processors 1. Introduction to AMD’s processor families (2) Evolution of AMD’s early processors [2] 1. Introduction to AMD’s processor families (3) Historical remarks 1) Beyond x86 processors AMD also designed and marketed two embedded processor families; • the 2900 family of bipolar, 4-bit slice microprocessors (1975-?) used in a number of processors, such as particular DEC 11 family models, and • the 29000 family (29K family) of CMOS, 32-bit embedded microcontrollers (1987-95). In late 1995 AMD cancelled their 29K family development and transferred the related design team to the firm’s K5 effort, in order to focus on x86 processors [3]. 2) Initially, AMD designed the Am386/486 processors that were clones of Intel’s processors.
  • Vysoké Učení Technické V Brně Návrh Řídicí Jednotky

    Vysoké Učení Technické V Brně Návrh Řídicí Jednotky

    VYSOKÉ UČENÍ TECHNICKÉ V BRNĚ BRNO UNIVERSITY OF TECHNOLOGY FAKULTA STROJNÍHO INŽENÝRSTVÍ ÚSTAV AUTOMATIZACE A INFORMATIKY FACULTY OF MECHANICAL ENGINEERING INSTITUTE OF AUTOMATION AND COMPUTER SCIENCE NÁVRH ŘÍDICÍ JEDNOTKY PRO AUTONOMNÍ MOBILNÍ ROBOT DESIGN OF CONTROL BOARD FOR AUTONOMOUS MOBILE ROBOT BAKALÁŘSKÁ PRÁCE BACHELOR'S THESIS AUTOR PRÁCE PETR MAŠEK AUTHOR VEDOUCÍ PRÁCE ING. STANISLAV VĚCHET, PH.D. SUPERVISOR BRNO 2010 Strana 3 Vysoké učení technické v Brně, Fakulta strojního inženýrství Ústav automatizace a informatiky Akademický rok: 2009/2010 ZADÁNÍ BAKALÁŘSKÉ PRÁCE student(ka): Petr Mašek který/která studuje v bakalářském studijním programu obor: Aplikovaná informatika a řízení (3902R001) Ředitel ústavu Vám v souladu se zákonem č.111/1998 o vysokých školách a se Studijním a zkušebním řádem VUT v Brně určuje následující téma bakalářské práce: Návrh řídicí jednotky pro autonomní mobilní robot v anglickém jazyce: Design of control board for autonomous mobile robot. Stručná charakteristika problematiky úkolu: Cílem práce je návrh a výroba základní řídicí jednotky autonomního mobilního robotu. Účelem této jednotky je zpracování informací z infračervených senzoru vzdálenosti a jejich vyhodnocení. Dále pak řízení aktuátorů. Řídicí jednotka musí být dostatečně výkonná pro zpracování základních navigačních tzv. “bug” algoritmů. Cíle bakalářské práce: Prostudujte možnosti řízení konstrukčně podobných robotů Navrhněte nejvhodnější strukturu řídicí jednotky Tuto řídicí jednotku vyrobte Výsledný produkt prakticky otestujte Strana 4 Seznam odborné literatury: www.robotika.cz www.megarobot.net www.hobbyrobot.cz Vedoucí bakalářské práce: Ing. Stanislav Věchet, Ph.D. Termín odevzdání bakalářské práce je stanoven časovým plánem akademického roku 2009/2010. V Brně, dne L.S. _______________________________ _______________________________ Ing. Jan Roupec, Ph.D. prof. RNDr.
  • CS420: Operating Systems Paging and Page Tables

    CS420: Operating Systems Paging and Page Tables

    CS420: Operating Systems Paging and Page Tables YORK COLLEGE OF PENNSYLVANIA YORK COLLEGE OF PENNSYLVANIA YORK COLLEGE OF PENNSYLVANIA YORK COLLEGE OF PENNSYLVANIA 'GHI<GJHK&L<MNK'GHI<GJHK&L<MNK 'GONJHK&P@JJHG 'GONJHK&P@JJHG MFIF&'<IJ@QH&'@OK MFIF&'<IJ@QH&'@OK !<GR%&'@ !<GR%&'@ James Moscola 'HGPOJ&N<F&012 'HGPOJ&N<F&012 !"#$%&'())*+,-.)/.&0123454670!"#$%&'())*+,-.)/.&0123454670 YORK COLLEGE OF PENNSYLVANIA Department of Physical Sciences 'GHI<GJHK&L<MNK 8.9:;*&<:(#.="#>&1015?26511??8.9:;*&<:(#.="#>&1015?26511?? @A9/**/")*&<B!&C(>&1015?2D50633@A9/**/")*&<B!&C(>&1015?2D50633'GONJHK&P@JJHG York College of Pennsylvania 05?3352775?30? 05?3352775?30? MFIF&'<IJ@QH&'@OK EEEF+C:F(A; EEEF+C:F(A; !<GR%&'@ 'HGPOJ&N<F&012 !""#$%%&'$#()*$&+$,-$%.$"!""#$%%&'$#()*$&+$,-$%.$" !"#$%&'())*+,-.)/.&0123454670 8.9:;*&<:(#.="#>&1015?26511?? @A9/**/")*&<B!&C(>&1015?2D50633 05?3352775?30? EEEF+C:F(A; !""#$%%&'$#()*$&+$,-$%.$" CS420: Operating Systems Based on Operating System Concepts, 9th Edition by Silberschatz, Galvin, Gagne COLLEGE CATALOG 2009–2011 COLLEGE CATALOG COLLEGE CATALOG 2009–2011 COLLEGE CATALOG COLLEGE CATALOG 2009–2011 COLLEGE CATALOG College Catalog 2009–2011College Catalog 2009–2011 College Catalog 2009–2011 !""#$%&'()*+,--.../ 012$1$"..."34#3$4.56 !""#$%&'()*+,--.../ 012$1$"..."34#3$4.56 !""#$%&'()*+,--.../ 012$1$"..."34#3$4.56 Paging • Paging is a memory-management scheme that permits the physical address space of a process to be noncontiguous - Avoids external fragmentation - Avoids the need for compaction - May still have internal fragmentation