81. UNL, Computer Science & Engineering Assumes basic knowledge of pipelined scalar processors, and covers the Vector, computer science computer Engineering - JD Edwards Honors Program http://cse.unl.edu/undergrads/coursedesc.php?Course=432/832

82. Instruction Pipeline -- Facts, Info, And Encyclopedia Article Instruction pipeline. Categories computer architecture, computer terminology The R locations are ((computer science) memory device that is the part http://www.absoluteastronomy.com/encyclopedia/i/in/instruction_pipeline.htm

Instruction pipeline [Categories: Computer architecture, Computer terminology] An instruction pipeline is a technology used on (Integrated circuit semiconductor chip that performs the bulk of the processing and controls the parts of a system) microprocessor s to enhance their performance. Pipelining greatly improves (Output relative to input; the amount passing through a system from input to output (especially of a computer program over a period of time)) throughput Instructions consist of a number of steps. Practically every ((computer science) the part of a computer (a microprocessor chip) that does most of the data processing; the CPU and the memory form the central part of a computer to which the peripherals are attached) CPU ever manufactured is driven by a central clock. Each step requires at least one clock cycle. Each step of an instruction is performed by a different piece of ((computer science) the mechanical, magnetic, electronic, and electrical components making up a computer system) hardware on the ((computer science) the part of a computer (a microprocessor chip) that does most of the data processing; the CPU and the memory form the central part of a computer to which the peripherals are attached)

83. Stevens Institute | Computer Science computer science and computer Engineering students who complete CS 182 are exempt An introduction to the functional level structure of modern pipelined http://www.cs.stevens.edu/Courses/Undergraduate_Courses.shtml

Admissions Search People Finder CALENDAR OF EVENTS ... Computer Science UNDERGRADUATE COURSES CS 181 Introduction to Computer Science Honors I (3-2-4) In-depth introduction to programming in Java and to Computer Science in general. The course emphasizes structured programming techniques. Included is a discussion of computer systems from the hardware and systems software point of view. The Java programming concepts covered include: standard data types; structure of a Java program; input and output; graphical user interfaces; arithmetic and Boolean operations; assignment operations; standard functions; branching statements (if/else and switch statements); iteration operations (while, do/while and for statements); functions; value and reference parameters, local variables; scope of variables and constants, function prototypes and overloading; arrays; pointers; and structures. By invitation only. CS 182 Introduction to Computer Science Honors II (3-0-4) Advanced programming concepts covering classical data structures and object-oriented programming. Emphasis is on building a collection of re-usable software components that will form the basis of future programming efforts. The data structures covered include lists, stacks, queues, trees, binary search trees and balanced search trees. The object-oriented features of Java covered include classes, templates, inheritance, polymorphism and run-time binding. Also included is a discussion of the analysis of asymptotic running times of algorithms. Computer Science and Computer Engineering students who complete

84. CSU Chico - Engineering, Computer Science, & Construction Management - CSUC ECC computer science Students Planning a Project. ECC Home Page. Department of computerscience Basics notations, speedup, classification of pipelines http://www.ecst.csuchico.edu/__depts/csci/MS_Computer_Science/Thesis_Project_Exa

ECC Home Page ECC 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 Catalog Description 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. Current Instructor Dr. Benjoe Juliano Current Course Website http://www.ecst.csuchico.edu/~juliano/Teaching/syllabus380.html

85. Lincoln University - Home Page computer science. CS 10 INTRODUCTION TO computer science*. An introduction tothe principles and concepts of computer science and its applications. http://www.lincolnuca.edu/index.php?pageId=319

86. CSU Computer Science Courses An introduction to Colorado State University and the computer science Department . Pipelined CPU design. Superscalar architectures, and instruction level http://www.cs.colostate.edu/cstop/csacademics/cscourses.html

People Academics Research Activities ... Facilities Academics Degrees Courses Schedules Scholarships ... Apply to CSU Courses Click on a course number listed below to jump to the course description. Other CS/EE658 CS/EE670 CS/EE674 ... CS110: Personal Computing Prerequisite: None Introduction to personal computing: hardware/software concepts, operating system commands, word processing, spreadsheets, programming. No credit toward Computer Science major. CS115: Computer Science Concepts and Practices Prerequisite: HS Algebra, experience with PC's. Development of computer science in the 20th Century. Central concepts of computer science: algorithm, recursion, implications of autonomous computation, limits of computability. Examples using programming. No credit toward Computer Science major. CSCC150: Interactive Programming with Java Prerequisite: some familiarity with PC's. Introduction to object-oriented programming with Java; problem-solving, cre ating applets for Web pages, and graphical user interfaces. No credit toward Computer Science major requirements. CSCC153: Introduction to Java Prerequisite: M121 or M118. Credit not allowed for both CS153 and CS154.

87. 1.1 Definition And Historical Perspectives Computational science should not be confused with computer science. The CDC7600, with its pipelined functional units, is considered to be the first http://www.aspire.cs.uah.edu/textbook/compsci1002.html

1.1 Definition and Historical Perspectives Computational Science Computational science is a relatively new discipline, and there is currently no consensus on a precise definition of what computational science actually is. In broad terms, computational science involves using computers to study scientific problems and complements the areas of theory and experimentation in traditional scientific investigation. Computational science seeks to gain understanding of science principally through the use and analysis of mathematical models on high performance computers. Computational science should not be confused with computer science. Computational science focuses on a scientific or engineering problem and draws from computer science and mathematics to gain an improved understanding of the problem. Computer science focuses on the computer itself. Even though the areas are quite distinct, many of the topics typically considered to be in the domain of computer science are of much value in computational science. Generations of Computer Technology The evolution of digital computing is often divided into generations, characterized by computer technology, architecture and available compilers and algorithms. Throughout most of the development of computing, new generations appeared roughly on a ten year cycle. More recently, with the proliferation of architecturally diverse massively parallel computers, this cycle appears to habve been compressed somewhat.

88. CSA604 computer Technology (continuation option). Minors. computer science. All Courses concepts; synchronization of pipeline stages; measuring performance http://www.eas.muohio.edu/csa/courseDescriptions/604.html

var utmdn="eas.muohio.edu"; HOME SEARCH SITEMAP CONTACTS ... Printer Friendly Email This Page Email this page Your email address Friend's email address Your Message CSA 604 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. Prerequisites: Graduate standing in the Certificate in Software Development program, or permission of instructor. Objectives: Describe basic concepts of a computer system. Describe the organization and structuring of the major hardware components of computers. Describe basic computer architecture. Describe the interrelationships between a computer's architecture and an assembly language executed on the computer. Describe the interrelationships between a machine-level language and higher-level languages. Describe the assembly process.

89. Computer Science Course Information computer science Course Information Handson experience designing a simplepipelined computer on screen and using CAD tools such as Cadence or ViewLogic http://web.njit.edu/cs/cs_courses/index.php?cno=11&s=SUMMER_2005

90. Rice Course Schedule, Fall 2003: Computer Science (COMP) computer science (COMP). Rice Course Schedule as of 11/06/2003. Advancedpipelining, including dynamic scheduling and precise interrupt handling. http://www.rice.edu/projects/courses/2003fall/COMP.html

Back to Contents Course Schedules More Course Info Registrar Rice Course Schedule, Fall 2003 Computer Science (COMP) Rice Course Schedule as of 11/06/2003. This schedule is maintained by the Office of the Registrar ( reg@rice.edu See also: Building Codes Registration Information NOTE: Course web pages are available for some COMP courses. * DISTRIBUTION COURSE: GROUP III Introduction to computer organization, operating systems, programming languages, artificial intelligence, and programming. Not intended for science-engineering students. May not be taken for credit after any other programming course. Enrollment is limited to 35. 001 DH SYM LAB - MWF 11:00AM - 11:50AM Nguyen, Dung Enr: 31 Max: 35 COMP 110 COMPUTATION IN SCIENCE AND ENGINEERING Credits 3.00 Fall 03 * DISTRIBUTION COURSE: GROUP III The course introduces basic techniques for problem solving and visualization using computational environments such as Mathematica and Matlab. Class will consist of a mixture of traditional lectures held in classrooms and self-paced modules covering topics in science and engineering that will be completed in Symonds II. No previous experience is required or expected. Also offered as NSCI 230. 001 SYM LAB II - MW 01:00PM - 02:30PM Goldman, Ronald N. Enr: 21 Max: * DISTRIBUTION COURSE: GROUP III Programming methodology and problem solving in a functional programming language. Data abstraction, procedural abstraction, reduction rules, use of control and state. Students will learn the practical skills to write and modify programs. A student may not receive credit for COMP 211 after taking COMP 210. 001 DH 1064 - MWF 10:00AM - 10:50AM Greiner, John D. Enr: 73 Max: Wong, Stephen

91. Cannot Connect To Server Theses Dept. of Electrical Engineering and computer Sciences Title,Efficient pipelining of nested loops unroll-and-squash http://hdl.handle.net/1721.1/16861

Error - Cannot Connect to Server The handle you requested cannot be found. Please contact hdladmin@cnri.reston.va.us if you wish to report this error. Please include information regarding where you found the handle Handle System Web Site

92. E0 COMPUTER SCIENCE E0 computer science AUTOMATION Rogers DF,and Adams, J., Mathematical Elementsfor computer Graphics, McGrawHill, 1976. E0 284 (AUG) 21 http://www.iisc.ernet.in/soi/e0.htm

93. Computer Science (C S) Course Descriptions Introduction to ethics in computer science, including philosophical ethics theories . Review of linear algebra, serial, pipelined vector processors, http://www.ou.edu/bulletins/courses/computer_science_courses.htm

Computer Science (C S) 1313 Programming for Nonmajors. Prerequisite: Mathematics 1523 or equivalent. Introduction to the design and implementation of computer programs. Emphasis on problem solving. (F, Sp) 1323 Introduction to Computer Programming. Prerequisite: Mathematics 1523 or equivalent. Introduction to the design and implementation of computer software with an emphasis on abstraction and program organization. (F, Sp) 2281 Engineering Co-Op Program (Crosslisted with AME, CH E, C E, ECE, ENGR, EPHY, E S, G E, I E, P E 2281). Prerequisite: student participation in the program. The Co-Op program provides student placement in jobs outside the University, but in a position related to the student's major. On completion of a semester work period, the student submits a brief written report. One hour of credit (elective) granted for each work period, with a maximum credit of six hours. (F, Sp, Su) 2334 Programming Structures and Abstractions. Prerequisite: 1323 and Mathematics 1823. Application of software engineering principles with examples from central areas of computer science. Use of abstract data types such as stacks, queues, lists, and trees. File processing. Introduction to ethics in computer science, including philosophical ethics theories. Discussion of intellectual property rights and privacy. (F, Sp) 2413 Data Structures.

94. Computer Science - BU 2005/2006 Undergraduate Bulletin The first course for computer science, mathematics, and physical science Topics include pipeline, superscalar, vector, and parallel processors; http://www.bu.edu/bulletins/und/item13d17.html

College of Arts and Sciences Computer Science Concentration in Computer Science (0701) Minor in Computer Science (0701) Joint Concentration in Mathematics and Computer Science (1721) BA/MA in Computer Science (0701) ... Computer Science Courses Chairman Azer Bestavros Professors Bestavros, Gacs, Homer, Kfoury, Levin, Teng Associate Professors Benson, Betke, Crovella, Matta, Sclaroff, Snyder Assistant Professors Byers, Itkis, Kollios, Reyzin, West, Xi Professor Emerita Freidman Students wishing to combine their interests in computer science with other disciplines may pursue joint concentrations under the BUCOP framework. Those wishing to cap their undergraduate studies with advanced coursework may elect the combined BA/MA program. For additional information about the department and its programs, please visit Computer Science Department TOP OF PAGE Concentration in Computer Science (0701) Students must earn a minimum grade of C in all courses taken toward a concentration in computer science. Fifteen courses are required. The following three categories are used in the specification of concentration requirements. The assignment of a given course to one of these categories is determined by the bulletin listing in effect at the time of a student's enrollment in the course.

95. References 3 Bell, G. The Future of High Performance Computers in science and Engineering,Comm. The Architecture of Pipelined Computers. McGrawHill, 1981. http://csep1.phy.ornl.gov/ca/node32.html

Next: About this document Up: CA Chapter Previous: 4 Exercises References Amdahl, G., The Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities , AFIPS Conf. Proc. 30, pp. 483-485, 1967. Andrews, G., and Schneider,F., Concepts and Notations for Concurrent Programming , Computing Surveys, Vol. 15, pp. 3-43, 1983. Bell, G. The Future of High Performance Computers in Science and Engineering , Comm. ACM, Vol. 32, pp. 1091-1101, 1989. Bhuyan, L., Yang, Q., and Agrawal, D., Performance of Multiprocessor Interconnection Networks, Computer , Vol. 22, No. 2, pp. 25-37, 1989. Bouknight, W.J., et al., The ILLIAC-IV System . Proc. IEEE, April 1972, pp. 369-388. (reprinted in CSPE) Buzbee, B., Remarks for the IFIP Congress '83 Panel on How to Obtain High Performance for High Speed Processors, Los Alamos National Laboratory Report LA-UR-84-1392, Los Alamos, NM, 1983. Denning, P. and Tichy, W., Highly Parallel Computation , RIACS Report TR-90.35, NASA Ames Research Center, Moffet Field, CA, August, 1990.

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-95 of 95    Back | 1  | 2  | 3  | 4  | 5