21. Smita Bakshi - Abstract, Department Of Computer Science The tasks of component selection, functional partitioning and pipelining are interdependentand it is necessary to consider the effects of one on the other for http://www.cs.ucdavis.edu/department/colloquia/97-98/bakshi.html

COLLOQUIUM Home Department 1997-1998 Colloquia "Synthesis of High-Performance Hardware/Software Systems" Smita Bakshi UC Davis Thursday, February 12, 1998 1131 Engineering II Abstract: In this talk, I will present an environment and a design flow for selecting system-level components, and then partitioning and pipelining a throughput constrained specification amongst the components. This is performed to best satisfy the throughput constraint at minimal hardware cost. Our ability to incorporate partitioning with pipelining at several levels of granularity, enables us to attain high throughput designs. The environment also allows designers to rapidly explore a large design space, and hence obtain a better understanding of the system under design. Home Grads Undergrads Courses ... http://www.cs.ucdavis.edu/

22. 2001-2002 Graduate Catalog - Christopher Newport University Architectural simulation using VERILOG. pipelining. computer arithmeticand vector processors. CPSC 570. Theoretical computer science, (33-0). http://www.cnu.edu/public/grad2001/gradstud/pcse/cscourse.html

Table of Contents Teaching Physics and Computer Science Psychology ... CNU Home Computer Science CPSC 501. Prerequisites: Grad. standing or permission of the instructor. Fall The management, specification, design, implementation and documentation of complex software systems. A major project is to be done in the last half of the course. A paper or class presentation based on independent reading of research papers concerning new developments in software engineering are required. Students are expected to learn to use software systems such as CASE tools. CPSC 502. Communications I Prerequisites: Graduate standing and ability to program in C, or permission of the instructor. Summer A comprehensive view of data communications with an emphasis on computer networks. Baseband and broadband local area networks, OSI model, logical link protocols, media with an emphasis on fiber-based interfaces, topology, and routing/flow control. TCP/IP protocols and socket-based application development are emphasized. CPSC 510. Artificial Intelligence I Prerequisites: Graduate standing within the department. Fall

23. Citation of pipelining in the ARM2 RISC microprocessor. In Digest of the IEEE InternationalHigh Level Design Validation and Test Workshop. IEEE computer science Press http://portal.acm.org/citation.cfm?id=296333.296345&coll=portal&dl=ACM&idx=J776&

24. Citation and architectures toc 1997 , Newport, Rhode Island, United States pipelining withfutures Symposium on Foundations of computer science, pages 540545, 1989. http://portal.acm.org/citation.cfm?id=258517&dl=ACM&coll=portal&CFID=11111111&CF

25. Computer Science 624 computer science 624 Advanced Topics in computer Architecture. covers advanced trendsin computer architecture. would cover advanced pipelining techniques VLIW http://www.cs.iastate.edu/~tyagi/624.html

Computer Science 624 Advanced Topics in Computer Architecture Spring Semester, 1998 M W F, 2:10 - 3:00 pm, 217 Atanasoff Instructor Akhilesh Tyagi office hours: 233 Atanasoff Hall, Th 1-2PM, F 10-11AM tyagi@cs.iastate.edu Assignments Assignment #1.(ps) Assignment #2.(ps) List of Projects Suggested Projects Check this list often as it is being updated. Please contact me ASAP if you have thought about a project. Course Description This course covers advanced trends in computer architecture. Here is an outline of topics to be covered in this course this semester. About half the course would cover advanced pipelining techniques: VLIW, superscalar, multiscalar, general scheduling methods and compiler techniques targeted towards instruction-level parallelism. We will also discuss counterflow pipeline, a different kind of pipeline proposed by Sproull and Sutherland. The rest of the course would be about newer architectures and technologies (most likely topics: reconfigurable computing and intelligent DRAM (IRAM) architectures). Textbook D. J. L. Hennessy and A. Patterson

26. COMPUTER SCIENCE GRADUATE COURSE DESCRIPTIONS set design, basic processor implementation techniques, pipelining, memory design thefundamental models and analytical methods of theoretical computer science. http://www.cs.iastate.edu/grad-info/courses.html

COMPUTER SCIENCE GRADUATE COURSE DESCRIPTIONS Each course states the number of semester credits assigned to the course, preceded in parentheses by the number of hours in class (contact hours) expected of the student. The first of the two contact-hour numbers indicates the number of lecture or recitation class hours per week for the semester. The second is the number of laboratory or studio hours required per week. Within each course description may be found one or more of the following letters: F. S. SS., indicating which term fall, spring, summer session of the academic year the course is offered. All 600 level Com S courses (excluding Com S 610) will be offered on an alternate year basis. A course number followed by a "DL" means the course is dual listed with the indicated course. Numerical Solution of Ordinary Differential Equations. (Math 507) (3-0) Cr. 3 F.SS. Prereq. 415, 465, or 481; knowledge of FORTRAN or C. One step methods for initial value problems, one-step methods for systems, multi-step methods, boundary-value problems. Examples using university computers. Computational Methods of Linear Algebra.

27. Research Papers Available in SpringerVerlag Lecture Notes in computer science Series. ImprovingSoftware pipelining with Unroll-and-Jam , S. Carr, C. Ding and P. Sweany, in http://www.cs.rochester.edu/~cding/publications.html

Research Papers " Compiler-Directed Run-Time Monitoring of Program Data Access ", Chen Ding and Yutao Zhong, to appear in the first ACM SIGPLAN Workshop on Memory System Performance , Berlin, Germany, June 2002. The proceedings will be published by ACM as an issue of SIGLAN Notices. " Reuse Distance Analysis for Scientific Programs ", Yutao Zhong, Chen Ding, and Ken Kennedy, in Proceedings of 6th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers , Washington D.C., March 2002. Available in Springer-Verlag Lecture Notes in Computer Science Series. "Instruction Balance and its Relation to Program Energy Consumption" , Tao Li and Chen Ding, in Proceedings of International Workshop on Languages and Compilers for Parallel Computing , Cumberland Falls, Kentucky, August 2001. Available in Springer-Verlag Lecture Notes in Computer Science Series. "Improving Effective Bandwidth through Compiler Enhancement of Global Cache Reuse" , Chen Ding and Ken Kennedy, in Proceedings of 2001 International Parallel and Distribute Processing Symposium , San Francisco, California, April 2001.

28. Publications Improving Software pipelining with Unrolland-Jam and Memory-Reuse Analysis , MichiganTechnological University, Department of computer science, June 1996. http://www.cs.unt.edu/~sweany/Publications.html

Publications Journal Papers P. Sweany, B.L. Huber and S. Carr. "Global Instruction Scheduling Without Copies", Digital Technical Journal 10(1), December 1998, pp. 58-70. V. Allan, S. Beaty, B. Su and P. Sweany. "Building a Retargetable Local Instruction Scheduler", 28(3), March 1998, pp. 249-283. R.A. Mueller, M.R. Duda, P.H. Sweany and J.S. Walicki. "Horizon: A Retargetable Compiler for Horizontal Microarchitectures", IEEE Transactions on Software Engineering 14(5), May 1988. Conference Papers J. Hiser, S. Carr and P. Sweany. "Global Register Partitioning", To appear in Proceedings of the 2000 International Conference on Parallel Architectures and Compiler Techniques, Philadelphia, PA, October 15-19, 2000. J. Hiser, S. Carr, P. Sweany, S.J. Beaty. "Register Assignment for Software Pipelining with Partitioned Register Banks", To appear in Proceedings of the 2000 International Parrallel and Distributed Processing Symposium , Cancun, Mexico, May 1-4, 2000. P. Sweany and S. Beaty. "Instruction Scheduling using Simulated Annealing", In Proceedings of the Third International Conference on Massively Parallel Computing Systems , Colorado Springs, Colorado, April 1998 S. Jang, S. Carr, P. Sweany, and D. Kuras, "

29. Computer Science Advanced topics in computer architecture, including pipelining, superpipelining,VLIW, superscalar, branch prediction, and speculative computer science Faculty. http://ar.byu.edu/catalog/undergrad_cat/2001/departments/Computer_Science.html

UNDERGRADUATE CATALOG 2001–2002 Brigham Young University Computer Science Tony R. Martinez, Chair 3361 TMCB, (801) 378-3027 College of Physical and Mathematical Sciences Advisement Center N-179 ESC, (801) 378-6270 Admission to Degree Program The degree programs in the Department of Computer Science carry special enrollment limitations. Please see the college advisement center for specific details. The Discipline Computer science, even though it is a relatively new field, touches virtually every area of human endeavor. It is the systematic study of the algorithmic processes—their theory, analysis, design, efficiency, implementation, and application. Fundamentally, computer science is a science of abstraction—creating the right model for a problem and devising the right computer manipulations to solve it. The BS curriculum is accredited by the Computer Science Accreditation Commission of the Computing Sciences Accreditation Board (CSAB). The degree programs in computer science concentrate on the fundamental techniques and knowledge used in designing and implementing information processing systems, with emphasis on systems software design and computer organization. Career Opportunities Graduates from the Computer Science Department find ready employment in almost any area of computer use.

30. COMPUTER SCIENCE & ENGINEERING instruction set design and processor implementation (pipelining, multiple issue CSE590 Special Topics in computer science (*) Several offerings each quarter http://www.washington.edu/students/crscat/cse.html

Search Directories Reference Tools UW Home ... Student Guide Course Catalog Glossary Search Course Catalog UW Bothell Course Catalog UW Tacoma Course Catalog COLLEGE OF ENGINEERING Detailed course offerings (Time Schedule) are available for Spring Quarter 2003 Summer Quarter 2003 To see the detailed Instructor Class Description, click on the underlined instructor name following the course description. CSE 100 Fluency in Information Technology (5) QSR Introduces skills, concepts, and capabilities necessary to effectively use information technology. Includes logical reasoning, managing complexity, operation of computers and networks, and contemporary applications such as effective Web searching and database manipulation, ethical aspects, and social impacts of information technology. Not available for credit to students who have completed CSE 142 or ENGR 142. Offered: jointly with INFO 100. Instructor Course Description: Martin Dickey CSE 142 Computer Programming I (4) NW, QSR Basic programming-in-the-small abilities and concepts. Highlights include procedural and functional abstraction with simple built-in data type manipulation. Basic abilities of writing, executing, and debugging programs. Offered: AWSpS. Instructor Course Description: Martin Dickey CSE 143 Computer Programming II (5) NW, QSR

31. Home Page For Dr. Vicki Allan reprinted as VH Allan and MV Kolesar, Teaching computer science A Problem KM Reddy,Petri Net versus Modulo Scheduling for Software pipelining, Proceedings of http://www.cs.usu.edu/~allanv/Vicki/vicki.html

Education Utah State University, B.S. (Mathematics-Computer Science-Statistics) 1973, Summa Cum Laude Utah State University, M.M. (Mathematics) 1974 Colorado State University, M.S. (Computer Science) 1984 Colorado State University, Ph.D. (Computer Science) 1986 Areas of Emphasis Agents Code Reuse Java Automated Code Generation Parallel Algorithms Instruction level parallelism Program optimization Analysis of algorithms Programming Languages Theory Experience 1992-Present Utah State University, Associate Professor, Computer Science Department 1986-1992 Utah State University, Assistant Professor, Computer Science Department 1985-1986 Colorado State University, Research Assistant, Computer Science Department 1984-1985 Denelcor, Inc., Research Assistant 1979-1982 Colorado State University, Instructor, Department of Computer Science Honors Phi Kappa Phi Colorado Fellowship 1982-83 Colorado Fellowship 1983-84 Best Presentation 1987, Micro20 Invited participant of NSF workshop to enhance options for women in CS, Oct. 1992. Computer Science Advisor of the Year, 1994.

32. UMASS Boston Department Of Computer Science University of Massachusetts, Boston computer science Colloquium. Monday, 12 March2001, 230 PM S/2/063. pipelining LU Decomposition Automatically Transforming http://www.cs.umb.edu/News_Events/Lectures_Seminars/Colloquiums/talk03-12-01.htm

Colloquiums/Seminars University of Massachusetts, Boston Computer Science Colloquium Monday, 12 March 2001, 2:30 PM S/2/063 Pipelining LU Decomposition: Automatically Transforming Loop Computations for Distributed-Memory Machines Carl D. Offner Gem Compiler Group, Compaq Computer Corporation There are two big issues that a compiler encounters when generating code for a distributed-memory machine (or more generally, for a multi-processor machine with non-uniform memory access): 1. Distribute data over the memories of the machine, and distribute computations over the processors of the machine in such a way that the processor executing a particular computation is near the memory holding the data it accesses. 2. Schedule the execution of computations with respect to each other for maximum parallelism while respecting the semantics of the original program. One way of dealing with the first problem is to have the programmer specify an appropriate mapping of data to memories. Given this mapping, the compiler can generally do a pretty good job of mapping computations to processors so that as many computations as possible use only local, as opposed to remote, memory references.

33. Columbia Computer Science: Academics - Course Info : Bulletin programming, implementations of basic computer under various clocking assumptions,pipelining. major of an appropriate problem in computer science carried out http://www.cs.columbia.edu/home/academics/bulletin.html

text-only webmaster quick search Academics - Course Info back to course info Computer Science Course Bulletin COMS W1001x and y Introduction To Computers 3 pts. Intended primarily for students in the humanities and not available to engineering students. General introduction to computer science, including the design of algorithms and computer hardware, as well as hands-on experinece with applications such as spreadsheets, databases, and the World Wide Web. Introductory programming in Java. Please see the 100x footnote about taking 100x courses for credit. COMS W1003x or y Introduction To Computer Programming In C 3 pts. Internded primarily for engineering students. General introduction to computing. Structured program design. Taught in C. Note: Due to signficant overlap, students may receive credit for only one of the following five courses: COMS W1003, W1004, W1005, W1007, and COMS W1004 Inroduction To Computer Programming In Java 3 pts. Intended primarily for engineering students. General introduction to computer programming. Structured program design. Note: Due to signficant overlap, students may receive credit for only one of the following five courses: COMS W1003, W1004, W1005, W1007

34. Welcome To Adobe GoLive 4 Areas of computer science that are being applied to focused on the development ofcomputer algorithms and PH Sweany, Improving Software pipelining with Unroll http://www.mtu.edu/level3/9596pub/cs.html

Computer Science Research in the Department of Computer Science encompasses a breadth of areas. These include core computer science areas as well as those that support other computationally intensive research in other scientific and engineering disciplines. Core computer science research in the Department includes compiler optimization and architecture, both of which focus on instruction-level parallel architectures. Software engineering research is focused on identifying measurable attri-butes of software and software processes. Areas of computer science that are being applied to scientific and engineering disciplines include: artificial intelligence and expert systems, parallel algorithms, in particular parallel communication algorithms, geometric modeling including the representations and manipulations of geometric objects and the design of efficient and robust computation algorithms. Finally, research in computational biology is focused on the development of computer algorithms and software for the analysis of genomic DNA sequences. Carr, Steven M.

35. Computer Science, Rutgers University: [198:505 ] Advanced Computer Architecture Objectives Core material for computer science degree candidates. Advanced topicsare covered such as pipelining, parallel architecture, and communication. http://www.cs.rutgers.edu/cs/academics/graduate/courses/node11.html

Search CS site Search WWW Maintained by web@cs.rutgers.edu [198:505 ] Advanced Computer Architecture Credits: Instructor: S. Levy, M. Murdocca, M. Paull, or staff Schedule: Fall and Spring semesters Objectives Core material for Computer Science degree candidates. The course is designed to provide a solid understanding of the architecture, organization, and design of digital systems. The emphasis is on theoretical issues rather than on the physical hardware. Advanced topics are covered such as pipelining, parallel architecture, and communication. Prerequisites Entrance requirements, and a course that covers fundamentals of computer architecture such as combinational and sequential logic design, data representation, memory management, assembly language, and microprogramming. Outline Advanced computer arithmetic Performance Pipelining Vector processing I/O and communication Parallel architecture Expected Work There will be regular homework problems, and two or three exams. References Computer Architecture: A Quantitative Approach , Morgan Kaufmann Publishers, 1990.

36. UniMelb UGHB96 : 433-313 Computer Design Content Memory hierarchy, processor implementation, pipelining, instruction sets,multiprocessors 1. computer science, Faculty of Engineering (v4, p106) Next http://www.unimelb.edu.au/HB/1996/Eng/433/433-313.html

Handbook 1996 Faculty of Engineering (Volume 4 page 106) Computer Science subject : Next: Search Help 433-313 "Computer Design" appears differently in several places - choose the one you want: Computer Science , Faculty of Engineering. Computer Science , Faculty of Science. Geomatics , Faculty of Engineering. Computer Science , Faculty of Engineering (v4, p106) : Next: Geomatics , Faculty of Engineering (v4, p118) : Next: 433-313 Computer Design Credit points: 12.5 Coordinator: Dr. Z. Somogyi Prerequisite: Prerequisites: Computer Science or Electrical Engineering Computer Science, and Contact: 26 hours of lectures (two per week) and approximately 17 hours of practice classes Timetable: Second semester Objectives: On successful completion of this subject students should: be able to describe the components of current computer systems as well as their interactions be able to evaluate the suitability of a given computer for a given task be able to analyse the effects of architectural features on the efficiency of a given program and of programs in general understand the process of computer design Content: Memory hierarchy, processor implementation, pipelining, instruction sets, multiprocessors, input/output, performance measurement, the design process.

37. Computer Science undergraduate program has included a substantial computer science content will PoehlmanTraditional performance enhancement techniques pipelining, RISC, VLIW http://www.mcmaster.ca/graduate/2000-2001/compsci.htm

COMPUTER SCIENCE The Department of Computing and Software offers a research-oriented program leading to the M.Sc. degree in Computer Science. Applications will be considered from candidates holding bachelor's degrees in Computer Science or Computer Engineering. Candidates with degrees in other disciplines who have included a substantial Computer Science component in their programs are also encouraged to apply. Full-time study is preferred, but part-time study is a possible option. Enquiries: 905 525-9140 Ext. 27863 E-mail: gsec@cas.mcmaster.ca Website: http://www.cas.mcmaster.ca/cas/graduate/admissions.html Staff / Fall 2000 PROFESSORS Robert L. Baber, B.Sc., M.Sc. (M.I.T.), Doktor-Ingenieur (Technical Universoty of Darmstadt), C.Eng., Eur.Ing. Frantisek Franek, M.Sc., RNDr. (Charles, Prague), Ph.D. (Toronto) Ryszard Janicki, M.Sc. (Warsaw), Ph.D., D.Hab. (Polish Academy of Sciences) / Graduate Student Advisor Tao Jiang, B.Sc. (Univ. of Sci. and Tech. of China, Hefei), Ph.D. (Minnesota) P.Eng. Sanzheng Qiao, B.S., M.S. (Shanghai Teacher's College), M.S., Ph.D. (Cornell) Patrick J. Ryan, B.Sc. (Toronto), Ph.D. (Brown)

38. Department Of Computer Science And Engineering and design; datapath, control (hardwired, microprogrammed), pipelining, input/output. 355Introduction to Theoretical computer science.(3), Section A Section B. http://www.eas.asu.edu/~csedept/academic/courses.html

Computer Science and Engineering Academic Programs People Research ... Students Student Profile Student Demographics People Faculty Electrical Aerospace Bioengineering ... Construction Research Research Centers Research Services Opportunities Resources University Resources College Resources Industry Highlights Student Profile People Research ... Degree Programs Internships Leadership Program IMES Academic Programs Undergraduate Graduate Academics Highlights Student Profile People Research ... Degree Programs People Faculty Faculty Associates Staff Research Research Centers Research Groups Research Areas Just For Students Student Organizations Forms Quick Link CSE Job Resource Scholarships Computer Science And Engineering Course Web Pages *Please note that some instructors maintain their web pages through the myASU Portal and the web page links for those courses are no longer maintained on this page.

39. Computer Science Course Listing assemblers and assembly language programming, memory hierarchies, caches, RISC architectures,and pipelining. Prerequisite computer science 127 or consent of http://www.mathcs.carleton.edu/courses/cs.html

The Structure of the Internet Introduction to Computer Science Data Structures Parallel Computing ... Integrative Exercise (Senior Examination) The Structure of the Internet An introduction to computer science through the study of the architecture of the Internet. Protocols, clients and servers, the TCP/IP protocol suite, HTTP, HTML, database-driven Web page programming, network security, distributed algorithms, and the history and administrative structure of the Internet. This course is designed for students who have never previously taken a programming course. Students who have taken Computer Science 127 may not enroll in Computer Science 107. 6 credits, MS Introduction to Computer Science Elements of procedure-oriented languages. Problem solving and implementation of algorithms. Program design and documentation. Measures of efficiency and complexity. Iterative and recursive techniques. Non-numerical and numerical applications. Files, pointers and linked structures. 6 credits, MS Data Structures An introduction to abstract data types, recursion, searching, sorting, stacks, queues, linked lists, trees and graphs.

40. MDC Researchers Field computer science and Engineering. Research Interests CMOS wavepipelining;Low-power systems architecture; pipelining in DSP processors; Selective http://www.ceis.rochester.edu/CEIS/MDC/MDC_Page/Researchers/researchers.html

MDC P.I. Directory 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 Bocko, Mark University of Rochester Field : Electrical and Computer Engineering Research Interests : Sensor interface electronics and analog to digital converters; Super conducting and quantum coherent electronics; Signal processing in audio and music View Profile Chin, Shiu-Kai Syracuse University Field : Electrical Engineering and Computer Science Research Interests : Formal specification, verification and design methods applied to the high confidence design of hardware, software and security architectures View Profile Friedman, Eby University of Rochester Field : Electrical and Computer Engineering Research Interests : Digital and mixed-signal microelectronic design and analysis; Integrated circuit and CMOS circuit design, lock distribution networks; Pipelining/retiming and speed/power/area trade-offs in CMOS circuits View Profile Back to top Hong, Sangjin

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 2     21-40 of 87    Back | 1  | 2  | 3  | 4  | 5  | Next 20