DOCSLIB.ORG

Kdb+ and the Internet of Things/Big Data

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Kdb+ and the Internet of Things/Big Data InDetail Kdb+ and the Internet of Things/Big Data An InDetail Paper by Bloor Research Author : Philip Howard Publish date : August 2014 Kdb+ has proved itself in what is unarguably the most demanding big data market: financial trading and risk management. The company is now targeting other environments. Philip Howard Kdb+ and the Internet of Things/Big Data Executive summary Kdb+ is a column-based relational database Key findings with extensive in-memory capabilities, devel- oped and marketed by Kx Systems. Like all In the opinion of Bloor Research, the following such products, it is especially powerful when represent the key facts of which prospective it comes to supporting queries and analytics. users should be aware: However, unlike other products in this domain, kdb+ is particularly good (both in terms of • Data is stored in sequentially ordered performance and functionality) at processing, columns. Note that other column-based manipulating and analysing data (especially databases are not typically ordered in this numeric data) in real-time, alongside the fashion so you would expect performance for analysis of historical data. Moreover, it has operations such as sorts to be much faster extensive capabilities for supporting time- when using kdb+. As is usual with column- series data. For these reasons Kx Systems has based databases it is not necessary to define historically targeted the financial industry for indexes because columns are self-indexing trading analytics and black box trading based (and this even more true in this case, thanks on real-time and historic data, as well as real- to the sequential ordering). However, you time risk assessment; applications which may define indexes if you wish to. are particularly demanding in their perfor- mance requirements. The company has had • Kdb+ supports compression at comparable significant success in this market with over levels to other vendors. That is, up to around a hundred major financial institutions and 10x depending on the type of data. hedge funds deploying its technology. In this paper, however, we want to explore the use of • In-memory processing is genuinely kdb+ for big data and Internet of Things based in-memory: it is not just a cache. However, use cases. the system has been designed so that both pure in-memory and hybrid in-memory/disk Fast facts based processing are optimised. Kdb+ is a column-based, hybrid in-memory • The support for time series in kdb+ is espe- database with stream processing capabili- cially relevant to many Internet of Things ties, primarily designed for analytic work- applications such as smart metering, loads. In so far as in-memory capability is preventative maintenance and other envi- concerned, we refer to it as “hybrid” because ronments where large quantities of data it uses in-memory processing as much as it need to be collected at regular intervals and can but recognises that in some cases it may then analysed. Note that native support for be impracticable to load all relevant (typi- time series is extremely rare across data- cally historic) data into memory and that you base products. therefore need to employ techniques that will not only leverage memory-based processing • We are pleased to hear that Kx has recently but optimise performance when not all the implemented geospatial capabilities, as data can fit into memory. This is similar to many Internet of Things applications are the approach taken by IBM with its DB2 BLU both time and location based. Acceleration, as an example. The product’s stream processing capabilities (which means • The q language is significantly more efficient that you can analyse very large quantities of than other languages that you might use information in-flight, in real-time) arise from (both procedural and declarative) for anal- the fact that kdb+ is tightly integrated with ysis purposes. It allows very complex busi- the product’s development language, q. This ness logic to be developed quickly. However, is a vector (array) processing language that is its use does imply a learning curve. Alter- much more efficient than SQL and can be used natively there are specific C# and JavaScript to develop analytic applications as well as for interfaces that are provided as a part of query purposes. kdb+. There are interfacing capabilities for a host of other languages and environ- ments, including (but not limited to) Python, R, Matlab, Excel, and Mathematica. A Bloor InDetail Paper 1 © 2014 Bloor Research Kdb+ and the Internet of Things/Big Data Executive summary • Because programming is typically in q rather The bottom line than SQL, most business intelligence tools will not run natively with kdb+. However, Kx Kx Systems was founded more than 20 years Systems has partnered with Datawatch and ago, although the precursor to kdb+ (kdb) was that company’s Panopticon product can be not introduced until 1998. In the fifteen years used for visualisation purposes. In addition, since then the company and its product have a number of Kx’s partners have built busi- earned a well-deserved reputation in the finan- ness intelligence front-ends to the product. cial services market. That, in itself, speaks As a lowest common denominator, kdb+ volumes: hedge funds and other financial insti- supports ODBC. tutions have been processing ‘big data’ since before the term came into common parlance • Kdb+ is scalable, does not require a large and Kx Systems has been a leading provider investment in hardware, is relatively simple to that market. Today, Bloor Research believes to maintain, performs extremely well and is that the company is well placed to exploit the highly available. capabilities of kdb+ in other big data markets and, especially, with respect to the Internet of Things. In fact, Kx Systems has already started to make inroads in this area, as we will discuss (by means of case studies) in due course. Our view is that Kx Systems has, perhaps seren- dipitously, built a platform that makes it ideal for many big data analytic requirements. © 2014 Bloor Research 2 A Bloor InDetail Paper Kdb+ and the Internet of Things/Big Data The product Kdb+ runs on Solaris, Windows and Linux plat- Historically, there was an optional product forms and is currently in version 3.1. In addi- called kdb-tick that was specifically tion to the standard kdb+, which is 64-bit, designed for ingesting and analysing (stream there is also a free 32-bit version. This runs processing) stock tick information. However, on almost anything, including a Raspberry Pi! this has now been folded into kdb+. There is also a fast loading capability. The standard version has a parallel archi- tecture for deployment across multiple The solution supports commodity servers and partitions (and, notably, you can implement storage devices in any topology (local, remote, different indexes on different partitions) and SAN, NAS, flash, SSD, HDD), providing flex- has a distributed capability so that it can scale ibility in cost-effectively adding capacity when across a clustered environment. This archi- required. tecture helps to support the product’s failover capabilities, which are supplemented by full logging facilities and automatic recovery. Load balancing and replication are both provided. The product includes its own web server, which is used to support web-based queries that utilise either a standard URL link or which may derive from applications such as Micro- soft Excel. The results are returned to the user’s browser either in HTML or XML format, or they can be exported to an Excel spread- sheet. Unicode is supported. A Bloor InDetail Paper 3 © 2014 Bloor Research Kdb+ and the Internet of Things/Big Data Architecture There are really two parts to kdb+: the q with kdb+. Because of the conciseness of the language and the database. We will discuss code, programs tend to consist of relatively each in turn. few lines, which makes debugging relatively simple. Code is interpreted but the interpreter The q language takes up not much more than 100K and this makes it easy for the environment to support The origins of q lie in a programming language many simultaneous processes. This small called APL. This was a language used from the footprint not only means that installation is early days of computing, primarily to process very fast, it also reduces the risks and costs numerical data. In 1988, while he was at associated with upgrades and maintenance. Morgan Stanley, Arthur Whitney developed A+ as a replacement for APL in order to support The database non-mainframe environments. However, while this crunched numbers more efficiently As has already been stated data is stored than APL, it was a proprietary development in compressed format in a columnar data- on behalf of Morgan Stanley. So, in 1993, base. Enough has been written (by both Bloor Arthur co-founded Kx Systems and devel- Research and others) about the advantages oped a further and more powerful replace- of column-based databases for analytics that ment language, called k. This was extremely we do not need to reiterate those arguments efficient but equally terse and it was very diffi- here. However, it is worth commenting on the cult for non-experts to read or understand so, approach kdb+ takes to in-memory processing. during the first decade of this century Arthur There are, essentially, three methods of imple- developed a more verbose version of k, called menting so-called in-memory databases. One q. While you can still use k almost all kdb+ is essentially to take a cache-based strategy customers use q, which, while still implying and call it in-memory, which it isn’t. The a learning curve, is much easier to use and second is to assume that all relevant data understand: for example, it has common func- can fit into memory.
Load more

Recommended publications
  • An Array-Oriented Language with Static Rank Polymorphism
    An array-oriented language with static rank polymorphism Justin Slepak, Olin Shivers, and Panagiotis Manolios Northeastern University fjrslepak,shivers,[email protected] Abstract. The array-computational model pioneered by Iverson's lan- guages APL and J offers a simple and expressive solution to the \von Neumann bottleneck." It includes a form of rank, or dimensional, poly- morphism, which renders much of a program's control structure im- plicit by lifting base operators to higher-dimensional array structures. We present the first formal semantics for this model, along with the first static type system that captures the full power of the core language. The formal dynamic semantics of our core language, Remora, illuminates several of the murkier corners of the model. This allows us to resolve some of the model's ad hoc elements in more general, regular ways. Among these, we can generalise the model from SIMD to MIMD computations, by extending the semantics to permit functions to be lifted to higher- dimensional arrays in the same way as their arguments. Our static semantics, a dependent type system of carefully restricted power, is capable of describing array computations whose dimensions cannot be determined statically. The type-checking problem is decidable and the type system is accompanied by the usual soundness theorems. Our type system's principal contribution is that it serves to extract the implicit control structure that provides so much of the language's expres- sive power, making this structure explicitly apparent at compile time. 1 The Promise of Rank Polymorphism Behind every interesting programming language is an interesting model of com- putation.
    [Show full text]
  • Kx for Manufacturing Flyer
    Kx for At a Glance Powered by the world’s fastest Manufacturing time-series database, Kx enables manufacturers to improve performance at tool, factory and Accelerate Your Evolution Into Industry 4.0 user analytic levels. Kx is able to handle millions of events and Kx is the world’s fastest time-series database and analytics platform for measurements per second, manufacturing. It is a high-performance, cost-effective and low latency solution for gigabytes to petabytes of historical ingesting, processing, and analyzing real-time, streaming and historical data from data, with nanosecond resolution, industrial equipment sensors and factory systems. more efficiently and cost-effectively than any available alternatives. Kx is a single integrated software platform enabling quick, easy implementation and low total cost of ownership. It can be deployed on premises, in the cloud or as a hybrid configuration. The Kx Advantage • Ingest and process over 30 million sensor measurements per second • Supports any sensor measurement, frequency, tags and attributes with nanosecond precision • Stream processing platform with in-built Complex Event Processing • Augment existing systems to support massive increase in sensor data volumes • Ability to capture, store and Performance process 10TBs of data per day Featuring a superior columnar-structured time-series database, kdb+, Kx can scale • Deploy on-premises, in anywhere from thousands to hundreds of millions of sensors, at any measurement the cloud or as a hybrid frequency whilst maintaining extreme levels of performance. configuration • Rich customizable visualization Kx has the ability to ingest and process over 30 million sensor measurements per through integrated dashboards second using just one server.
    [Show full text]
  • To the Members of First Derivatives Plc
    First Derivatives plc First Derivatives plc Annual report and accounts 2019 Annual report and accounts 2019 AT THE CORE OF DATA SCIENCE FD’s world-leading analytics technology and data science expertise are disrupting industries, helping our clients to generate more revenue and increase their operational efficiency See more online at: firstderivatives.com and kx.com STRATEGIC REPORT CORPORATE GOVERNANCE FINANCIAL STATEMENTS 01 Highlights 24 Board of Directors 41 Independent auditor’s report 02 At a glance 26 Chairman’s governance 47 Consolidated statement 04 Chairman’s review statement of comprehensive income 06 Business model 27 Governance framework 49 Consolidated balance sheet 08 Business review 29 Report of the Audit Committee 50 Company balance sheet 14 Strategy 32 Report of the Nomination 51 Consolidated statement 15 Financial review Committee of changes in equity 20 Principal risks and uncertainties 34 Report of the Remuneration 53 Company statement of changes 22 People strategy Committee in equity 38 Directors’ report 55 Consolidated cash flow 40 Statement of Directors’ statement responsibilities 56 Company cash flow statement 57 Notes 116 Directors and advisers IBC Global directory Highlights FINANCIAL HIGHLIGHTS Report Strategic Revenue £m Operating profit £m £217.4m £18.7m 18.7 217.4 14.7 186.0 151.7 Corporate Governance 12.2 2017 2018 2019 2017 2018 2019 Adjusted diluted EPS p Net debt £m 83.2p £16.5m Financial Statements Financial 16.5 16.2 83.2 72.2 13.5 61.3 2017 2018 2019 2017 2018 2019 OPERATIONAL HIGHLIGHTS • FinTech
    [Show full text]
  • Compendium of Technical White Papers
    COMPENDIUM OF TECHNICAL WHITE PAPERS Compendium of Technical White Papers from Kx Technical Whitepaper Contents Machine Learning 1. Machine Learning in kdb+: kNN classification and pattern recognition with q ................................ 2 2. An Introduction to Neural Networks with kdb+ .......................................................................... 16 Development Insight 3. Compression in kdb+ ................................................................................................................. 36 4. Kdb+ and Websockets ............................................................................................................... 52 5. C API for kdb+ ............................................................................................................................ 76 6. Efficient Use of Adverbs ........................................................................................................... 112 Optimization Techniques 7. Multi-threading in kdb+: Performance Optimizations and Use Cases ......................................... 134 8. Kdb+ tick Profiling for Throughput Optimization ....................................................................... 152 9. Columnar Database and Query Optimization ............................................................................ 166 Solutions 10. Multi-Partitioned kdb+ Databases: An Equity Options Case Study ............................................. 192 11. Surveillance Technologies to Effectively Monitor Algo and High Frequency Trading ..................
    [Show full text]
  • APL Literature Review
    APL Literature Review Roy E. Lowrance February 22, 2009 Contents 1 Falkoff and Iverson-1968: APL1 3 2 IBM-1994: APL2 8 2.1 APL2 Highlights . 8 2.2 APL2 Primitive Functions . 12 2.3 APL2 Operators . 18 2.4 APL2 Concurrency Features . 19 3 Dyalog-2008: Dyalog APL 20 4 Iverson-1987: Iverson's Dictionary for APL 21 5 APL Implementations 21 5.1 Saal and Weiss-1975: Static Analysis of APL1 Programs . 21 5.2 Breed and Lathwell-1968: Implementation of the Original APLn360 25 5.3 Falkoff and Orth-1979: A BNF Grammar for APL1 . 26 5.4 Girardo and Rollin-1987: Parsing APL with Yacc . 27 5.5 Tavera and other-1987, 1998: IL . 27 5.6 Brown-1995: Rationale for APL2 Syntax . 29 5.7 Abrams-1970: An APL Machine . 30 5.8 Guibas and Wyatt-1978: Optimizing Interpretation . 31 5.9 Weiss and Saal-1981: APL Syntax Analysis . 32 5.10 Weigang-1985: STSC's APL Compiler . 33 5.11 Ching-1986: APL/370 Compiler . 33 5.12 Ching and other-1989: APL370 Prototype Compiler . 34 5.13 Driscoll and Orth-1986: Compile APL2 to FORTRAN . 35 5.14 Grelck-1999: Compile APL to Single Assignment C . 36 6 Imbed APL in Other Languages 36 6.1 Burchfield and Lipovaca-2002: APL Arrays in Java . 36 7 Extensions to APL 37 7.1 Brown and Others-2000: Object-Oriented APL . 37 1 8 APL on Parallel Computers 38 8.1 Willhoft-1991: Most APL2 Primitives Can Be Parallelized . 38 8.2 Bernecky-1993: APL Can Be Parallelized .
    [Show full text]
  • Application and Interpretation
    Programming Languages: Application and Interpretation Shriram Krishnamurthi Brown University Copyright c 2003, Shriram Krishnamurthi This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 United States License. If you create a derivative work, please include the version information below in your attribution. This book is available free-of-cost from the author’s Web site. This version was generated on 2007-04-26. ii Preface The book is the textbook for the programming languages course at Brown University, which is taken pri- marily by third and fourth year undergraduates and beginning graduate (both MS and PhD) students. It seems very accessible to smart second year students too, and indeed those are some of my most successful students. The book has been used at over a dozen other universities as a primary or secondary text. The book’s material is worth one undergraduate course worth of credit. This book is the fruit of a vision for teaching programming languages by integrating the “two cultures” that have evolved in its pedagogy. One culture is based on interpreters, while the other emphasizes a survey of languages. Each approach has significant advantages but also huge drawbacks. The interpreter method writes programs to learn concepts, and has its heart the fundamental belief that by teaching the computer to execute a concept we more thoroughly learn it ourselves. While this reasoning is internally consistent, it fails to recognize that understanding definitions does not imply we understand consequences of those definitions. For instance, the difference between strict and lazy evaluation, or between static and dynamic scope, is only a few lines of interpreter code, but the consequences of these choices is enormous.
    [Show full text]
  • Kx for Sensors
    KxKx forfor SensorsSensors AtAt aa GlanceGlance KxKx forfor SensorsSensors isis anan integratedintegrated VEEVEE Enable, Combine, Integrate and Action your data Enable,Enable, Combine,Combine, IntegrateIntegrate andand ActionAction youryour datadata andand AnalyticsAnalytics solutionsolution forfor ingesting,ingesting, validating,validating, estimatingestimating andand analyzinganalyzing The Industrial Internet of Things (IIoT) is the concept of connected objects and TheThe IndustrialIndustrial InternetInternet ofof ThingsThings (IIoT)(IIoT) isis thethe conceptconcept ofof connectedconnected objectsobjects andand massivemassive amountsamounts ofof streamingstreaming devices, everything from manufacturing equipment, automobiles, jet engines to smart devices,devices, everythingeverything fromfrom manufacturingmanufacturing equipment,equipment, automobiles,automobiles, jetjet enginesengines toto smartsmart (real-time)(real-time) andand historicalhistorical datadata fromfrom meters. Many analysts predict that there will be over 20 billion connected devices by meters.meters. ManyMany analystsanalysts predictpredict thatthat therethere willwill bebe overover 2020 billionbillion connectedconnected devicesdevices byby sensors,sensors, devices,devices, andand otherother datadata 2020. 2020.2020. sources.sources. TheseThese devicesdevices areare equippedequipped withwith sensorssensors thatthat capturecapture informationinformation aboutabout thethe device,device, service,service, weather,weather, location,location, vibration,vibration, motion,motion,
    [Show full text]
  • Handout 16: J Dictionary
    J Dictionary Roger K.W. Hui Kenneth E. Iverson Copyright © 1991-2002 Jsoftware Inc. All Rights Reserved. Last updated: 2002-09-10 www.jsoftware.com . Table of Contents 1 Introduction 2 Mnemonics 3 Ambivalence 4 Verbs and Adverbs 5 Punctuation 6 Forks 7 Programs 8 Bond Conjunction 9 Atop Conjunction 10 Vocabulary 11 Housekeeping 12 Power and Inverse 13 Reading and Writing 14 Format 15 Partitions 16 Defined Adverbs 17 Word Formation 18 Names and Displays 19 Explicit Definition 20 Tacit Equivalents 21 Rank 22 Gerund and Agenda 23 Recursion 24 Iteration 25 Trains 26 Permutations 27 Linear Functions 28 Obverse and Under 29 Identity Functions and Neutrals 30 Secondaries 31 Sample Topics 32 Spelling 33 Alphabet and Numbers 34 Grammar 35 Function Tables 36 Bordering a Table 37 Tables (Letter Frequency) 38 Tables 39 Classification 40 Disjoint Classification (Graphs) 41 Classification I 42 Classification II 43 Sorting 44 Compositions I 45 Compositions II 46 Junctions 47 Partitions I 48 Partitions II 49 Geometry 50 Symbolic Functions 51 Directed Graphs 52 Closure 53 Distance 54 Polynomials 55 Polynomials (Continued) 56 Polynomials in Terms of Roots 57 Polynomial Roots I 58 Polynomial Roots II 59 Polynomials: Stopes 60 Dictionary 61 I. Alphabet and Words 62 II. Grammar 63 A. Nouns 64 B. Verbs 65 C. Adverbs and Conjunctions 66 D. Comparatives 67 E. Parsing and Execution 68 F. Trains 69 G. Extended and Rational Arithmeti 70 H. Frets and Scripts 71 I. Locatives 72 J. Errors and Suspensions 73 III. Definitions 74 Vocabulary 75 = Self-Classify - Equal 76 =. Is (Local) 77 < Box - Less Than 78 <.
    [Show full text]
  • Dyalog User Conference Programme
    Conference Programme Sunday 20th October – Thursday 24th October 2013 User Conference 2013 Welcome to the Dyalog User Conference 2013 at Deerfield Beach, Florida All of the presentation and workshop materials are available on the Dyalog 2013 Conference Attendee website at http:/conference.dyalog.com/. Details of the username and password for this site can be found in your conference registration pack. This website is available throughout the conference and will remain available for a short time afterwards – it will be updated as and when necessary. We will be recording the presentations with the intention of uploading the videos to the Internet. For this reason, please do not ask questions during the sessions until you have been passed the microphone. It would help the presenters if you can wait until the Q&A session that concludes each presentation to ask your questions. If your question can't wait, or if the presenter specifically states that questions are welcome throughout, then please raise your hand to indicate that you need the microphone. All of Dyalog's presenters are happy to answer specific questions relating to their topics at any time after their presentation. Scavenger Hunt Have fun and get to know the other delegates by participating in the scavenger hunt that is running throughout Dyalog '13. The hunt runs until 18:30 on Wednesday and prizes will be awarded at the Banquet. Team assignments, rules and the scavenger hunt list will be handed out at registration. Guests are welcome to join in as well as conference delegates. Good luck and happy hunting! For practical information, see the back cover If you have any questions not related to APL, please ask Karen.
    [Show full text]
  • A Guide to PL/M Programming
    INTEL CORP. 3065 Bowers Avenue, Santa Clara, California 95051 • (408) 246-7501 mcs=a A Guide to PL/M programming PL/M is a new high level programming language designed specifically for Intel's 8 bit microcomputers. The new language gives the microcomputer systems program­ mer the same advantages of high level language programming currently available in the mini and large computer fields. Designed to meet the special needs of systems programming, the new language will drastically cut microcomputer programming time and costs without sacrifice of program efficiency. in addition, training, docu­ mentation, program maintenance and the inclusion of library subroutines will all be made correspondingly easier. PL/M is well suited for all microcomputer program­ ming applications, retaining the control and efficiency of assembly language, while greatly reducing programming effort The PL/M compiler is written in ANSI stand­ ard Fortran I V and thus will execute on most machines without alteration. SEPTEMBER 1973 REV.1 © Intel Corporation 1973 TABLE OF CONTENTS Section Page I. INTRODUCTION TO PL/M 1 II. A TUTORIAL APPROACH TO PL/M ............................ 2 1. The Organization of a PL/M Program ........................ 2 2. Basic Constituents of a PL/M Program ....................... 4 2.1. PL/M Character Set ................................ 4 2.2. Identifiers and Reserved Words ....................... 5 2.3. Comments . 7 3. PL/M Statement Organization . 7 4. PL/M Data Elements . 9 4.1. Variable Declarations ............................... 9 4.2. Byte and Double Byte Constants. .. 10 5. Well-Formed Expressions and Assignments . 11 6. A Simple Example. 15 7. DO-Groups. 16 7.1. The DO-WHILE Group ...........
    [Show full text]
  • Visual Programming Language for Tacit Subset of J Programming Language
    Visual Programming Language for Tacit Subset of J Programming Language Nouman Tariq Dissertation 2013 Erasmus Mundus MSc in Dependable Software Systems Department of Computer Science National University of Ireland, Maynooth Co. Kildare, Ireland A dissertation submitted in partial fulfilment of the requirements for the Erasmus Mundus MSc Dependable Software Systems Head of Department : Dr Adam Winstanley Supervisor : Professor Ronan Reilly June 30, 2013 Declaration I hereby certify that this material, which I now submit for assessment on the program of study leading to the award of Master of Science in Dependable Software Systems, is entirely my own work and has not been taken from the work of others save and to the extent that such work has been cited and acknowledged within the text of my work. Signed:___________________________ Date:___________________________ Abstract Visual programming is the idea of using graphical icons to create programs. I take a look at available solutions and challenges facing visual languages. Keeping these challenges in mind, I measure the suitability of Blockly and highlight the advantages of using Blockly for creating a visual programming environment for the J programming language. Blockly is an open source general purpose visual programming language designed by Google which provides a wide range of features and is meant to be customized to the user’s needs. I also discuss features of the J programming language that make it suitable for use in visual programming language. The result is a visual programming environment for the tacit subset of the J programming language. Table of Contents Introduction ............................................................................................................................................ 7 Problem Statement ............................................................................................................................. 7 Motivation..........................................................................................................................................
    [Show full text]
  • Frederick Phillips Brooks, Jr
    Frederick Phillips Brooks, Jr. Biography Frederick P. Brooks, Jr., was born in 1931 in Durham NC, and grew up in Greenville NC. He received an A.B. summa cum laude in physics from Duke and a Ph.D. in computer science from Harvard, under Howard Aiken, the inventor of the early Harvard computers. He joined IBM, working in Poughkeepsie and Yorktown, NY, 1956-1965. He was an architect of the Stretch and Harvest computers and then was the project manager for the development of IBM's System/360 family of computers and then of the Operating System/360 software. For this work he received a National Medal of Technology jointly with Bob O. Evans and Erich Bloch Brooks and Dura Sweeney in 1957 patented an interrupt system for the IBM Stretch computer that introduced most features of today's interrupt systems. He coined the term computer architecture. His System/360 team first achieved strict compatibility, upward and downward, in a computer family. His early concern for word processing led to his selection of the 8-bit byte and the lowercase alphabet for the System/360, engineering of many new 8-bit input/output devices, and introduction of a character-string datatype in the PL/I programming language. In 1964 he founded the Computer Science Department at the University of North Carolina at Chapel Hill and chaired it for 20 years. Currently, he is Kenan Professor of Computer Science. His principal research is in real-time, three-dimensional, computer graphics—“virtual reality.” His research has helped biochemists solve the structure of complex molecules and enabled architects to “walk through” structures still being designed.
    [Show full text]