DOCSLIB.ORG

Computer Science (CS) 1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computer Science (CS) 1 Computer Science (CS) 1 CS 2133 Computer Science II COMPUTER SCIENCE (CS) Prerequisites: CS 1113 with a grade of "C" or better. Description: Recursive algorithms. Intermediate methods of searching CS 1003 Computer Proficiency and sorting. Mathematical analysis of space and time complexity, worst Description: For students with minimal personal computer skills. case, and average case performance. Course previously offered as CS Use of Internet and productivity software such as word processing, 3333. spreadsheets, databases, and presentation software. The ability to log on Credit hours: 3 to a personal computer, access the OSU network, and access OSU Web Contact hours: Lecture: 3 Contact: 3 sites is assumed. Previously offered as CS 1002. Levels: Undergraduate Credit hours: 3 Schedule types: Lecture Contact hours: Lecture: 3 Contact: 3 Department/School: Computer Science Levels: Undergraduate CS 2351 Unix Programming Schedule types: Lecture Prerequisites: CS 1113 or EET 2303 with a grade of "C" or better. Department/School: Computer Science Description: The UNIX programming system. The programming CS 1013 Computer Science Principles environment. The UNIX file system and the shell. Use of pipes and filters. Description: Computing as a creative human activity, abstraction to Course previously offered as CS 3451. reduce detail and focus on concepts relevant to understanding and Credit hours: 1 solving problems, describing data and information to facilitate the Contact hours: Lab: 2 Contact: 2 creation of knowledge, discuss algorithms as tools for developing and Levels: Undergraduate expressing solutions to computational problems, use programming is Schedule types: Lab a creative process that produces computational artifacts; and discuss Department/School: Computer Science digital devices, systems, and the networks that interconnect them. CS 2433 C/C++ Programming Credit hours: 3 Prerequisites: CS 1113 with a grade of "C" or better. Contact hours: Lecture: 3 Contact: 3 Description: C/C++ programming language types, operators, expressions, Levels: Undergraduate control flow, functions, structures, pointers, arrays, UNIX interface. Basic Schedule types: Lecture object oriented programming using C++ and the related language syntax Department/School: Computer Science and functionality. Previously offered as CS 2432. CS 1103 Computer Programming (A) Credit hours: 3 Prerequisites: MATH 1513 or higher, each with a grade of "C" or better. Contact hours: Lecture: 3 Contact: 3 Description: Introduction to computer programming using a high-level Levels: Undergraduate computer language, including subprograms and arrays. Principles of Schedule types: Lecture problem solving, debugging, documentation, and good programming Department/School: Computer Science practice. Elementary methods of searching and sorting. No prior CS 2570 Special Problems in Computer Science programming or computing experience needed. Previously offered as CS Prerequisites: Consent of instructor and freshman or sophomore 2103. standing. Credit hours: 3 Description: Current topics and applications of computer science. Contact hours: Lecture: 3 Contact: 3 Existing and new topics to computer science. Allows lower-division Levels: Undergraduate students to study topics not provided in existing classes. Can be Schedule types: Lecture individual study or a class with a new subject. Offered for variable credit, Department/School: Computer Science 1-3 credit hours, maximum of 6 credit hours. General Education and other Course Attributes: Analytical & Quant Credit hours: 1-3 Thought Contact hours: Contact: 1-3 Other: 1-3 CS 1113 Computer Science I (A) Levels: Undergraduate Prerequisites: MATH 1513 or higher, with a grade of "C" or better. Schedule types: Independent Study Description: Introduction to computer science using a block-structured Department/School: Computer Science high-level computer language, including subprograms, arrays, recursion, CS 3030 Industrial Practice in Computer Science records, and abstract data types. Principles of problem solving, Prerequisites: CS 3443 and MATH 2144, each with a grade of "C" or better, debugging, documentation, and good programming practice. Elementary junior standing, consent of departmental adviser. methods of sorting and searching. Use of operating system commands Description: Applied computing in industry. Topics vary with cooperating and utilities. Previously offered as CS 2113. employers. Written reports will be specified by adviser. Basic object Credit hours: 3 oriented programming using C++ and the related language syntax and Contact hours: Lecture: 2 Lab: 2 Contact: 4 functionality. Offered for variable credit, 1-6 credit hours, maximum of 9 Levels: Undergraduate credit hours. Schedule types: Lab, Lecture, Combined lecture and lab Credit hours: 1-6 Department/School: Computer Science Contact hours: Contact: 1-6 Other: 1-6 General Education and other Course Attributes: Analytical & Quant Levels: Undergraduate Thought Schedule types: Independent Study Department/School: Computer Science 2 Computer Science (CS) CS 3353 Data Structures and Algorithm Analysis I CS 3613 Theoretical Foundations of Computing Prerequisites: CS 2133 and CS 3653, each with a grade of "C" or better. Prerequisites: CS 2133 and CS 3653, each with a grade of "C" or better. Description: Storage, structures, data and information structures, list Description: Introduction to the classical theory of computer science. processing, trees and tree processing, graphs and graph processing, Sequential machines and their applications to devices, processes, and searching, and sorting. Previously offered as CS 4343 and CS 4344. programming. Models of computation: finite-state automata, push-down Credit hours: 3 automata, Turing machines. The role of non-determinism. Limits of digital Contact hours: Lecture: 3 Contact: 3 computation. Computability and unsolvability. The Church-Turing Thesis. Levels: Undergraduate Credit hours: 3 Schedule types: Lecture Contact hours: Lecture: 3 Contact: 3 Department/School: Computer Science Levels: Undergraduate CS 3363 Organization of Programming Languages Schedule types: Lecture Prerequisites: CS 2133 and (CS 3443 or ECEN 3213), each with a grade of Department/School: Computer Science "C" or better. CS 3653 Discrete Mathematics for Computer Science Description: Programming language constructs. Run time behavior of Prerequisites: MATH 2144 with a grade of "C" or better. programs. Language definition structure. Control structures and data flow Description: Theory and applications of discrete mathematical models programming paradigms. Previously offered as CS 4363. fundamental to analysis of problems in computer science. Set theory, Credit hours: 3 formal logic and proof techniques, relations and functions, combinatorics Contact hours: Lecture: 3 Contact: 3 and probability, undirected and directed graphs, Boolean algebra, Levels: Undergraduate switching logic. Schedule types: Lecture Credit hours: 3 Department/School: Computer Science Contact hours: Lecture: 3 Contact: 3 CS 3443 Computer Systems Levels: Undergraduate Prerequisites: CS 2133 with a grade of "C" or better. Schedule types: Lecture Description: Functional and register level description of computer Department/School: Computer Science systems, computer structures, addressing techniques, macros, linkage, CS 4143 Computer Graphics input-output operations. Introduction to file processing operations and Prerequisites: MATH 2163 and CS 3353, each with a grade of "C" or auxiliary storage devices. Programming assignments are implemented in better. assembly language. Description: Interactive graphics programming; graphics hardware; Credit hours: 3 geometrical transformation; data structures for graphic representations; Contact hours: Lecture: 3 Contact: 3 viewing in three dimensions; representation of 3D shapes; hidden edge Levels: Undergraduate and hidden surface removal algorithms; shading models. May not be Schedule types: Lecture used for degree credit with CS 5143. Department/School: Computer Science Credit hours: 3 CS 3513 Numerical Methods for Digital Computers Contact hours: Lecture: 3 Contact: 3 Prerequisites: MATH 2153 with a grade of "C" or better; MATH 3013 with Levels: Undergraduate a grade of "C" or better, or concurrent enrollment; or MATH 3263 with a Schedule types: Lecture grade of "C" or better and knowledge of programming. Department/School: Computer Science Description: Errors, floating point numbers and operations, interpolation CS 4153 Mobile Applications Development and approximation, solution of nonlinear equations and linear systems, Prerequisites: CS 2133 or 2433, each with a grade of "C" or better. condition and stability, acceleration methods, numerical differentiation Description: The history of mobile apps and their implication on and integration. Course previously offered as CS 3223. computing in general. Survey of the various platforms and approaches Credit hours: 3 used for mobile apps. Examine the differences between "conventional" Contact hours: Lecture: 3 Contact: 3 programs and mobile apps. Learn tools and techniques to develop mobile Levels: Undergraduate apps, and demonstrate proficiency through development assignments. Schedule types: Lecture May not be used for degree credit with CS 5153. Department/School: Computer Science Credit hours: 3 CS 3570 Special Problems in Computer Science Contact hours: Lecture: 3 Contact: 3 Prerequisites: Junior standing and consent of instructor. Levels: Undergraduate Description: Existing and new topics to computer science.
Load more

Recommended publications
  • IBM Research Report Proceedings of the IBM Phd Student Symposium at ICSOC 2006
    RC24118 (W0611-165) November 28, 2006 Computer Science IBM Research Report Proceedings of the IBM PhD Student Symposium at ICSOC 2006 Ed. by: Andreas Hanemann (Leibniz Supercomputing Center, Germany) Benedikt Kratz (Tilburg University, The Netherlands) Nirmal Mukhi (IBM Research, USA) Tudor Dumitras (Carnegie Mellon University, USA) Research Division Almaden - Austin - Beijing - Haifa - India - T. J. Watson - Tokyo - Zurich Preface Service-Oriented Computing (SoC) is a dynamic new field of research, creating a paradigm shift in the way software applications are designed and delivered. SoC technologies, through the use of open middleware standards, enable collab- oration across organizational boundaries and are transforming the information- technology landscape. SoC builds on ideas and experiences from many different fields to produce the novel research needed to drive this paradigm shift. The IBM PhD Student Symposium at ICSOC provides a forum where doc- toral students conducting research in SoC can present their on-going dissertation work and receive feedback from a group of well-known experts. Each presentation is organized as a mock thesis-defense, with a committee of 4 mentors providing extensive feedback and advice for completing a successful PhD thesis. This for- mat is similar to the one adopted by the doctoral symposia associated with ICSE, OOPSLA, ECOOP, Middleware and ISWC. The closing session of the symposium is a panel discussion where the roles are reversed, and the mentors answer the students’ questions about research careers in industry and academia. The symposium agenda also contains a keynote address on writing a good PhD dissertation, delivered by Dr. Priya Narasimhan, Assistant Professor at Carnegie Mellon University and member of the ACM Doctoral Dissertation Committee.
    [Show full text]
  • Design and Architectures for Signal and Image Processing
    EURASIP Journal on Embedded Systems Design and Architectures for Signal and Image Processing Guest Editors: Markus Rupp, Dragomir Milojevic, and Guy Gogniat Design and Architectures for Signal and Image Processing EURASIP Journal on Embedded Systems Design and Architectures for Signal and Image Processing Guest Editors: Markus Rupp, Dragomir Milojevic, and Guy Gogniat Copyright © 2008 Hindawi Publishing Corporation. All rights reserved. This is a special issue published in volume 2008 of “EURASIP Journal on Embedded Systems.” All articles are open access articles distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Editor-in-Chief Zoran Salcic, University of Auckland, New Zealand Associate Editors Sandro Bartolini, Italy Thomas Kaiser, Germany S. Ramesh, India Neil Bergmann, Australia Bart Kienhuis, The Netherlands Partha S. Roop, New Zealand Shuvra Bhattacharyya, USA Chong-Min Kyung, Korea Markus Rupp, Austria Ed Brinksma, The Netherlands Miriam Leeser, USA Asim Smailagic, USA Paul Caspi, France John McAllister, UK Leonel Sousa, Portugal Liang-Gee Chen, Taiwan Koji Nakano, Japan Jarmo Henrik Takala, Finland Dietmar Dietrich, Austria Antonio Nunez, Spain Jean-Pierre Talpin, France Stephen A. Edwards, USA Sri Parameswaran, Australia Jurgen¨ Teich, Germany Alain Girault, France Zebo Peng, Sweden Dongsheng Wang, China Rajesh K. Gupta, USA Marco Platzner, Germany Susumu Horiguchi, Japan Marc Pouzet, France Contents
    [Show full text]
  • Middleware-Based Database Replication: the Gaps Between Theory and Practice
    Appears in Proceedings of the ACM SIGMOD Conference, Vancouver, Canada (June 2008) Middleware-based Database Replication: The Gaps Between Theory and Practice Emmanuel Cecchet George Candea Anastasia Ailamaki EPFL EPFL & Aster Data Systems EPFL & Carnegie Mellon University Lausanne, Switzerland Lausanne, Switzerland Lausanne, Switzerland [email protected] [email protected] [email protected] ABSTRACT There exist replication “solutions” for every major DBMS, from Oracle RAC™, Streams™ and DataGuard™ to Slony-I for The need for high availability and performance in data Postgres, MySQL replication and cluster, and everything in- management systems has been fueling a long running interest in between. The naïve observer may conclude that such variety of database replication from both academia and industry. However, replication systems indicates a solved problem; the reality, academic groups often attack replication problems in isolation, however, is the exact opposite. Replication still falls short of overlooking the need for completeness in their solutions, while customer expectations, which explains the continued interest in developing new approaches, resulting in a dazzling variety of commercial teams take a holistic approach that often misses offerings. opportunities for fundamental innovation. This has created over time a gap between academic research and industrial practice. Even the “simple” cases are challenging at large scale. We deployed a replication system for a large travel ticket brokering This paper aims to characterize the gap along three axes: system at a Fortune-500 company faced with a workload where performance, availability, and administration. We build on our 95% of transactions were read-only. Still, the 5% write workload own experience developing and deploying replication systems in resulted in thousands of update requests per second, which commercial and academic settings, as well as on a large body of implied that a system using 2-phase-commit, or any other form of prior related work.
    [Show full text]
  • Scheduling Many-Task Workloads on Supercomputers: Dealing with Trailing Tasks
    Scheduling Many-Task Workloads on Supercomputers: Dealing with Trailing Tasks Timothy G. Armstrong, Zhao Zhang Daniel S. Katz, Michael Wilde, Ian T. Foster Department of Computer Science Computation Institute University of Chicago University of Chicago & Argonne National Laboratory [email protected], [email protected] [email protected], [email protected], [email protected] Abstract—In order for many-task applications to be attrac- as a worker and allocate one task per node. If tasks are tive candidates for running on high-end supercomputers, they single-threaded, each core or virtual thread can be treated must be able to benefit from the additional compute, I/O, as a worker. and communication performance provided by high-end HPC hardware relative to clusters, grids, or clouds. Typically this The second feature of many-task applications is an empha- means that the application should use the HPC resource in sis on high performance. The many tasks that make up the such a way that it can reduce time to solution beyond what application effectively collaborate to produce some result, is possible otherwise. Furthermore, it is necessary to make and in many cases it is important to get the results quickly. efficient use of the computational resources, achieving high This feature motivates the development of techniques to levels of utilization. Satisfying these twin goals is not trivial, because while the efficiently run many-task applications on HPC hardware. It parallelism in many task computations can vary over time, allows people to design and develop performance-critical on many large machines the allocation policy requires that applications in a many-task style and enables the scaling worker CPUs be provisioned and also relinquished in large up of existing many-task applications to run on much larger blocks rather than individually.
    [Show full text]
  • Runtime Monitoring of Web Service Choreographies Using Streaming XML
    Runtime Monitoring of Web Service Choreographies Using Streaming XML ∗ Sylvain Hall´e Roger Villemaire University of California, Santa Barbara Universit´edu Qu´ebec `aMontr´eal Department of Computer Science C.P. 8888, Succ. Centre-ville Santa Barbara, CA 9310-65110 Montreal, Canada H3C 3P8 [email protected] [email protected] ABSTRACT web services. Since most web services exchange XML mes- A wide range of web service choreography constraints on sages, one can refer to a recorded trace as an XML “docu- the content and sequentiality of messages can be translated ment” that can be analyzed using standard XML tools, us- into Linear Temporal Logic (LTL). Although they can be ing for example the XML Query Language (XQuery) [19,28]. checked statically on abstractions of actual services, it is However, most works attempting to tap on the resources desirable that violations of these specifications be also de- available in XQuery engines operate in a post mortem fash- tected at runtime. In this paper, we show that, given a ion: an instance of a choreography must be finished be- suitable translation of LTL formulæ into XQuery expres- fore analysis can take place on a complete XML document. sions, such runtime monitoring of choreography constraints While in some cases, a post mortem analysis on recorded is possible by feeding the trace of messages to a streaming traces is appropriate, there exist situations where violations XQuery processor. The forward-only fragment of LTL is in- of a specification must be addressed as soon as they are troduced; it represents the fragment of LTL supported by discovered.
    [Show full text]
  • Advanced Digital Broadcast Holdings S.A. Annual Report
    ADVANCED DIGITAL BROADCAST HOLDINGS S.A. ANNUAL REPORT 2006 Art Director: Ireneusz Golka Contents To Our Shareholders ……………… 6 Business, Operations and Strategy … 9 Corporate Governance …………… 29 Consolidated Financial Statements … 57 Statutory Financial Statements … 101 2006 : a technology year Business Highlights Revenue growing 5% to US$ 262 million Record half-year revenue at US$ 164.3 million 6 new Set-Top Box customers Hansenet (Germany, IPTV), Island Media (US, Satellite), ITI Neovision (Poland, Satellite), Telefonica O2 Czech Republic (Czech Republic, IPTV), Telecom Project 5 (Russia, Terrestrial), Jazztel (Spain, IPTV) Shift to high-end: HD-MPEG4 products at 20% of 2006 Revenue First significant sales in Americas 6% of the Group’s full-year revenue Long-term strategic partnership with ITI Neovision of Poland encompassing full-fledge collaboration, exclusivity and financial arrangements IPTV up 41%, Satellite up 140%, SW & Services up 220% compensated weak Italian DTT market and technical delays Awarded in Europe’s 500 - Entrepreneurs for Growth ranked 173 of 500 companies selected amongst 28 countries, for having achieved 58% annual compound average growth rate and the creation of more than 190 jobs, primarily in Europe, over 2002-2005 4 o ADB HOLDINGS o ANNUAL REPORT 2006 Strengthening ADB Group : High-End Focus a technology leader IN % OF 2006 DIGITAL TV EQUIPMENT SEGMENT REVENUE HD products in Italian RAI and UK BBC HD trials n MPEG2 SD, Others 62% n MPEG4 SD 16% World’s first hybrid, single-chip, n MPEG4 HD 22% advanced video coding,
    [Show full text]
  • Web Services, CORBA and Other Middleware
    Web Services, CORBA and other Middleware © Copyright IONA Technologies 2002 Dr. Seán Baker IONA Technologies Web Services For The Integrated Enterprise, OMG Workshop, Munich Feb 2003 Overview • There a number of different types of middleware – So what does Web Services offer? © Copyright IONA Technologies 2002 IONA © Copyright 2 2 Middleware • Middleware enables integration, but there are multiple – competing – choices: –CORBA –J2EE –.NET © Copyright IONA Technologies 2002 IONA © Copyright – Various MoM & EAI proprietary middleware – Web Sevices – the new kid on the block. 3 3 There’s lots of choice • Some based on technical grounds, including: – RPC versus message passing – Java specific versus multi-language – Direct versus indirect communication – Permanent versus occasional connection © Copyright IONA Technologies 2002 IONA © Copyright – Platform versus integration middleware • Some based on personal choice 4 4 Intra-enterprise versus inter-enterprise • Most middleware has been designed for intra- enterprise • Inter-enterprise adds at least two challenges – Firewalls ( & inter-enterprise security in general) © Copyright IONA Technologies 2002 IONA © Copyright – Different middleware may be used at the two ends • As well as different operating system, languages, etc 5 5 Web Services • Aims to address both of these issues – Its protocol is layered on HTTP • So it can flow through a firewall • This “cheat” raises security and other concerns, but ones that need to be addressed in any case – It uses XML to format messages © Copyright IONA
    [Show full text]
  • Operating System Vs. Middleware
    What is Middleware? Application Application Middleware Middleware Operating System Operating System Software that functions as a conversion or translation layer. • It is also a consolidator and integrator. – Custom-programmed middleware solutions have been developed for decades to enable one application to communicate with another that either runs on a different platform or comes from a different vendor or both. • Today, there is a diverse group of products that offer packaged middleware solutions. AP 04/07 Operating System vs. Middleware Application Middleware Operating System AP 04/07 1 The Middleware Layer Distributed Application Distributed Application Middleware API Middleware API Middleware Middleware Operating System API Operating System API Operating System Operating System (Processes, Communication, (Processes, Communication, Memory Management) Memory Management) Network AP 04/07 Purpose and Origin • Middleware is connectivity software that consists of a set of enabling services that allow multiple processes running on one or more machines to interact across a network. • Middleware is essential to migrating mainframe applications to client/server applications and to providing for communication across heterogeneous platforms. – This technology has evolved during the 1990s to provide for interoperability in support of the move to client/server architectures (see Client/Server Software Architectures). • The most widely-publicized middleware initiatives are the – Open Software Foundation's Distributed Computing Environment (DCE), – Object Management Group's Common Object Request Broker Architecture (CORBA), and – Microsoft's COM/DCOM (Component Object Model) AP 04/07 2 Technical Detail • Middleware servi ces are set s of di st rib ut ed soft ware that exist between the application and the operating system and network services on a system node in the network.
    [Show full text]
  • Middleware Technologies
    A. Zeeshan A middleware approach towards Web (Grid) Services 06 January 2006 A Middleware road towards Web (Grid) Services Zeeshan Ahmed Department of Intelligent Software Systems and Computer Science, Blekinge Institute of Technology, Box 520, S-372 25 Ronneby, Sweden [email protected] In Student Workshop on Architectures and Research in Middleware Blekinge Institute of Information Technology (BIT 2006), 06.01.2006, Romney Sweden A. Zeeshan A middleware approach towards Web (Grid) Services 06 January 2006 ABSTRACT: 2. MIDDLEWARE TECHNOLOGIES (MDLW TECH) Middleware technologies is a very big field, containing a strong already done research as well as the currently This is one of the new and hottest topics in the field of running research to confirm already done research’s the computer science which encompasses of many results and the to have some new solution by theoretical technologies to connects computer systems and provide a as well as the experimental (practical) way. This protocol to interact with each other to share the document has been produced by Zeeshan Ahmed information between them. The term Middleware carries (Student: Connectivity Software Technologies Blekinge the meaning to mediate between two or more already Institute of Technologies). This describes the research existing separate software applications to exchange the already done in the field of middleware technologies data. including Web Services, Grid Computing, Grid Services and Open Grid Service Infrastructure & Architecture. Middleware technologies reside inside complex, This document concludes with the overview of Web distributed and online application by hiding their self in (Grid) Service, Chain of Web (Grid) Services and the the form operating system, database and network details, necessary security issue.
    [Show full text]
  • Emergent Computing Joint ERCIM Actions: ‘Beyond the Horizon’ Anticipating Future and Emerging Information Society Technologies
    European Research Consortium for Informatics and Mathematics Number 64, January 2006 www.ercim.org Special: Emergent Computing Joint ERCIM Actions: ‘Beyond the Horizon’ Anticipating Future and Emerging Information Society Technologies European Scene: Routes to Open Access Publishing CONTENTS JOINT ERCIM ACTIONS THE EUROPEAN SCENE 4 Fourth ERCIM Soft Computing Workshop The Routes to Open Access by Petr Hajek, Institute of Computer Science, Academy of 16 Open Access: An Introduction Sciences / CRCIM, Czech Republic by Keith G Jeffery, Director IT, CCLRC and ERCIM president 4 Cor Baayen Award 2006 18 Publish or Perish — Self-Archive to Flourish: The Green Route to Open Access 5 Second ERCIM Workshop ‘Rapid Integration of Software by Stevan Harnad, University of Southampton, UK Engineering Techniques’ by Nicolas Guelfi, University of Luxembourg 19 The Golden Route to Open Access by Jan Velterop 5 Grid@Asia: European-Asian Cooperation Director of Open Access, Springer in Grid Research and Technology by Bruno Le Dantec , ERCIM Office 20 ERCIM Statement on Open Access 6 GFMICS 2005 — 10th International Workshop on Formal 21 Managing Licenses in an Open Access Community Methods for Industrial Critical Systems by Renato Iannella National ICT Australia by Mieke Massink and Tiziana Margaria 22 W3C at the Forefront of Open Access Beyond-The-Horizon Project by Rigo Wenning, W3C 7 Bits, Atoms and Genes Beyond the Horizon 23 Cream of Science by Dimitris Plexousakis, ICS-FORTH, Greece by Wouter Mettrop, CWI, The Netherlands 8 Thematic Group 1: Pervasive Computing and Communications SPECIAL THEME: by Alois Ferscha, University of Linz, Austria EMERGENT COMPUTING 24 Introduction to the Special Theme 9 Thematic Group 2: by Heather J.
    [Show full text]
  • HPC File Systems and Scalable I/O: Suggested Research and Development Topics for the Fiscal 2005-2009 Time Frame
    HPC File Systems and Scalable I/O: Suggested Research and Development Topics for the fiscal 2005-2009 time frame DOE Office of Science Rob Ross ANL Evan Felix PNL DOE NNSA Bill Loewe LLNL Lee Ward SNL Gary Grider LANL DOD Rob Hill, NSA Executive Summary............................................................................................................ 2 Background......................................................................................................................... 4 Purpose................................................................................................................................ 4 Frequently used terms......................................................................................................... 5 Historical perspective..........................................................................................................6 The early 1990’s ............................................................................................................. 6 The mid 1990’s ............................................................................................................... 6 The late 1990’s to present............................................................................................... 7 Key areas of possible future research, development, and standards work........................ 11 Conclusion ........................................................................................................................ 21 HPC File Systems and Scalable I/O: Suggested Research
    [Show full text]
  • Operating Systems and Middleware: Supporting Controlled Interaction
    Operating Systems and Middleware: Supporting Controlled Interaction Max Hailperin Gustavus Adolphus College Revised Edition 1.1 July 27, 2011 Copyright c 2011 by Max Hailperin. This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-sa/3.0/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA. Bibliography [1] Atul Adya, Barbara Liskov, and Patrick E. O’Neil. Generalized iso- lation level definitions. In Proceedings of the 16th International Con- ference on Data Engineering, pages 67–78. IEEE Computer Society, 2000. [2] Alfred V. Aho, Peter J. Denning, and Jeffrey D. Ullman. Principles of optimal page replacement. Journal of the ACM, 18(1):80–93, 1971. [3] AMD. AMD64 Architecture Programmer’s Manual Volume 2: System Programming, 3.09 edition, September 2003. Publication 24593. [4] Dave Anderson. You don’t know jack about disks. Queue, 1(4):20–30, 2003. [5] Dave Anderson, Jim Dykes, and Erik Riedel. More than an interface— SCSI vs. ATA. In Proceedings of the 2nd Annual Conference on File and Storage Technology (FAST). USENIX, March 2003. [6] Ross Anderson. Security Engineering: A Guide to Building Depend- able Distributed Systems. Wiley, 2nd edition, 2008. [7] Apple Computer, Inc. Kernel Programming, 2003. Inside Mac OS X. [8] Apple Computer, Inc. HFS Plus volume format. Technical Note TN1150, Apple Computer, Inc., March 2004. [9] Ozalp Babaoglu and William Joy. Converting a swap-based system to do paging in an architecture lacking page-referenced bits.
    [Show full text]