81. CSU Chico - Engineering, Computer Science, & Technology - CSUC ECST Computer Sci Software solutions pipeline scheduling, loop unrolling, looplevel parallelism; College of Engineering, computer science, Technology California State http://www.ecst.csuchico.edu/__depts/csci/MS_Computer_Science/Thesis_Project_Exa

ECT Home Page ECT Computing Campus Resources Computer Science ... Distance Program Core CSCI 380 syllabus CSCI 380: Computer Architecture (3 credit hours) Syllabus approved Mmmm YYYY Course Objectives The objectives of this course are to: introduce students to the main topics in computer architecture that address various aspects of concurrent computation foster an appreciation of architectural differences relative to a computer system's overall performance and capabilities/limitations in adapting to different applications; and help students understand various representations and classifications of high performance architectures. Prerequisites CSCI 171 and classified status or faculty permission. Catalog Description Provides a thorough and fundamental treatment of the art of computer architecture. Topics include concepts of von Neumann architectures, methods of evaluating CPU performance, instruction-set design and examples, compiler issues, instruction pipelining, superscalar processors, methods for reduction of branch penalty, memory hierarchies, I/O systems, floating-point arithmetic, and current issues in parallel processing. Approach Study architecture by topics, using relevant portions of various real computers to illustrate each topic. Study implementation chiefly through the detailed examination of one simple, complete computer. Supplement the textbook with selected readings from the literature. Do not emphasize programming or hardware laboratory.

82. Miami University School Of Engineering & Applied Science Computer Science concepts; synchronization of pipeline stages; measuring performance. categorization of computers SISD, SIMD, MISD of Engineering Applied science Oxford, Ohio http://www.eas.muohio.edu/csa/courseDescriptions/278.html

@import url(http://www.eas.muohio.edu/csses/cat.css); Home Search Contacts News Undergraduate Majors Computer Eng. Computer Science Systems Analysis Combined BS/MS Degree Graduate Program Certificate Master's Degree Associate Degree Major Computer Technology (continuation option) Minors Computer Eng. Computer Science All Courses Descriptions Course Text Books Academics Administrative Offices ... Thematic Sequences CSA 278 Computer Architecture (3 credits) Catalog description: Principles of Von Neumann computer architecture. Data representation and computer arithmetic. Memory hierarchy. CPU structure and instruction sets. Assembly language programming to better understand and illustrate computer architecture concepts. Performance considerations and alternative computer architectures. Prerequisite: CSA 271 or equivalent Course Objectives: Describe basic concepts of a computer system. Describe the organization and structuring the major hardware components of computers. Describe basic computer architecture. Describe the interrelationships between a computer's architecture and an assembly language executed on that computer. Describe the interrelationships between a machine-level language and higher-level languages. Describe the assembly process. Program effectively in an assembly language. Required topics (approximate weeks allocated): Overview of computer architecture (1) components of a computer registers (instruction register, instruction pointer, memory address register, etc.) and their uses

83. Research At Rensselaer Computer Science Department Experiment with the pipeline depth and number of instructions issued simultaneously. Extensions to a graphics package used in computer science I. Data Mining. http://www.cs.rpi.edu/undergrad/research.html

84. Rensselaer Computer Science Colloquium Series -- February 26 (Thursday) (CII 405 http://www.cs.rpi.edu/~drinep/colloquium/index_5.html

Improving Microprocessor Performance and Energy-efficiency by Exploiting OS-aware Architecture Design February 26 (Thursday) (CII 4050; Refreshments at 9:30am; Talk at 10am) Tao Li, UT Austin Improving Microprocessor Performance and Energy-efficiency by Exploiting OS-aware Architecture Design The Operating System (OS) which manages both hardware and software resources, constitutes a major component of today's complex systems. Many modern and emerging workloads (e.g., database, web servers and file/e-mail applications) exercise the OS significantly. However, microprocessor designs and (performance/power) optimizations have largely been driven by the user-level applications. In this talk, I will present the advantages and benefits of integrating OS component in processor architecture design. In the first part of my talk, I will show how control flow prediction hardware, which is critically to deliver instruction level parallel (ILP) and pipelining performance on today's highly-speculative and deeply-pipelined machine, can be cost-effectively adapted to significantly improve its speculation accuracy on the exception-driven, intermittent OS execution. In the second part of my talk, I will address the adaptations of processor resources to reduce OS power on today's high-complexity processors, which exploit aggressive hardware design to maximize the performance across a wide range of targeted applications. Tao Li is currently a Ph.D. candidate (in Computer Engineering) at the Electrical and Computer Engineering Department, University of Texas at Austin. His research interests include computer and system architecture, operating systems, energy-efficient design, modeling, simulation and evaluation of computer systems and hardware system prototyping.

85. MTU Department Of Computer Science memory computing, partitioning strategies, pipelined computation, synchronous computation, and load balancing. Traditional computer science applications, such http://www.cs.mtu.edu/html/undergrad/CS.BS.sem.upper.html

Upper Level Course Descriptions (Effective Fall 2004) (This list only has 4000-level courses. The 1000-, 2000- and 3000-level courses are listed as lower level undergraduate courses .) Up to 16 credits at the 4000 level may be taken for graduate credit. CS 4000: Senior Seminar CS 4090: Special Topics in Computer Science CS 4099: Directed Study in Computer Science CS 4121: Programming Languages ... CS 4811: Artificial Intelligence CS 4000 Senior Seminar (0-3-0) f,s 3 Topics include ethical models: legal issues: privacy and security: social responsibility: professional responsibility and service: and the future of computing. Students will complete the ETS MFT assessment exam. Prerequisite: and Senior Standing. CS 4090 Special Topics in Computer Science (On Demand) 1-4 Special topics in computer science offered on occasion based on student and faculty demand and interest. CS 4099 Directed Study in Computer Science f,s,su 1-4 Students study one or more special topics in computer science under the direction of one or more faculty members. May be repeated to a maximum of 6 credits. CS 4121 Programming Languages (0-3-0) f,s 3

86. WPI 2004-2005 Undergraduate Catalog - Computer Science Course Descriptions of the 3D graphics pipeline, including clipping, projection, arbitrary viewing, hidden surface removal and shading. Intended audience computer science majors http://www.wpi.edu/Pubs/Catalogs/Ugrad/Current/cscourses.html

Download the entire catalog in Adobe PDF (5 MB) Introduction to WPI Section 1: The WPI Plan Section 2: Department and Program Descriptions Section 3: Course Descriptions ... SUPPLEMENT Computer Science Course Descriptions CS 1101. INTRODUCTION TO PROGRAM DESIGN. Cat. I This course introduces principles of computation and programming with an emphasis on program design. Topics include design and implementation of programs that use a variety of data structures (such as records, lists, and trees), functions, conditionals, and recursion. Students will be expected to design, implement, and debug programs in a functional programming language. Intended audience: students desiring an introduction to programming and program design. Recommended background: none. Either CS 1101 or CS 1102 provide sufficient background for further courses in the CS department. Undergraduate credit may not be earned for both this course and CS 1102 . Undergraduate credit may not be earned both for this course and for CS 2135 CS 1102. ACCELERATED INTRODUCTION TO PROGRAM DESIGN. Cat. I

87. {Computer Science 6727 Outline} data and resource dependencies; hazards and exceptions; exploiting pipeline techniques. computer Systems Architecture , by J. Baer, computer science Press (1980 http://web.cs.mun.ca/~paul/cs6727/outline.html

CS 6727 - Introduction to High Performance Computer Systems Instructor: Paul Gillard Office: EN 2021-a Class Schedule: Tuesday 9:00 - 10:30 AM in EN 2022 Thursday 9:00 - 10:30 AM in EN 2022 Evaluation: Final Exam Monday, April 17, 2:00 PM Project Due Wednesday, April 5 Assignments There will be approximately five assignments, usually one on each of the major sections indicated in the outline. The final assignment and the project will be due in the last two weeks of the semester. Text: High Performance Computer Architecture , by H. Stone, Addison Wesley (1993) ISBN 0-201-52688-3 QA 76.9.A73S76 1993 Course outline: Review of classical vonNeuman architecture Chapter 5 from the first reference below (Patterson and Hennessy) Foundations of high speed computation - Instruction set parallelism Chapter 6 from the first reference below (Patterson and Hennessy), and Chapter 3 from the text pipelining data and resource dependencies hazards and exceptions exploiting pipeline techniques Memory system organization and architecture the memory hierarchy cache memory virtual memory Characteristics of numerical applications the grand challenge problems continuum models particle models Vector processors internal parallelism memory organization algorithm and data structure design Multiprocessor systems internal parallelism - vector processors tightly coupled systems loosely coupled systems Multiprocessor algorithms synchronization cache coherence algorithm and data structure design

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 5     81-87 of 87    Back | 1  | 2  | 3  | 4  | 5