ece254b-2000-06 - ece_254b_old ECE 254B: Information on...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ece_254b_old[3/30/2009 4:03:58 PM] ECE 254B: Information on Previous Offerings Behrooz Parhami: 2008/08/27 || E-mail: parhami at || Other contact info at: Bottom of this page Go up to: B. Parhami's course syllabi or his home page Link to the most recent offering of ECE 254B: Parallel Processing Previous offerings of the course ECE 254B: Spring Quarter 2006 ECE 254B: Spring Quarter 2005 ECE 254B: Winter Quarter 2004 ECE 254B: Winter Quarter 2003 ECE 254B: Winter Quarter 2002 ECE 254B: Spring Quarter 2001 ECE 254B: Spring Quarter 2000 Return to: Top of this page ECE 254B: Spring Quarter 2006 Course: ECE 254B – Advanced Computer Architecture: Parallel Processing, University of California, Santa Barbara, Spring 2006, Enrollment Code 10835 Catalog entry: 254B. Advanced Computer Architecture: Parallel Processing. (4) PARHAMI. Prerequisite: ECE 254A. Lecture, 4 hours. The nature of concurrent computations. Idealized models of parallel systems. Practical realization of concurrency. Interconnection networks. Building-block parallel algorithms. Algorithm design, optimality, and efficiency. Mapping and scheduling of computations. Example multiprocessors and multicomputers. (S) Instructor: Behrooz Parhami, Room 5155 Engineering I, Phone 805-893-3211, parhami at ece dot ucsb dot edu Meetings: MW 10:00-11:30, Phelps Hall, Room 1431 Consultation: Open office hours, held in Room 5155 Engineering I – M 11:30-1:00, W 3:30-5:00 Motivation: The ultimate efficiency in parallel systems is to achieve a computation speedup factor of p with p processors. Although often this ideal cannot be achieved, some speedup is generally possible by using multiple processors in a concurrent (parallel or distributed) system. The actual speed gain depends on the system’s architecture and the algorithm run on it. This course focuses on the interplay of architectural and algorithmic speedup techniques. More specifically, the problem of algorithm design for “general-purpose” parallel systems and its “converse”, the incorporation of architectural features to help improve algorithm efficiency and, in the extreme, the design of algorithm-based special-purpose parallel architectures, are dealt with. The foregoing notions will be covered in sufficient detail to allow extensions and applications in a variety of contexts, from network processors, through desktop computers, game boxes, Web server farms, multiterabyte storage systems, and mainframes, to high-end supercomputers. Prerequisite: Basic computer architecture at the level of ECE 154; an advanced architecture course, such as ECE 254A, would be helpful but can be waived. References:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/29/2011 for the course ECE 254b taught by Professor Parhami,b during the Fall '08 term at UCSB.

Page1 / 17

ece254b-2000-06 - ece_254b_old ECE 254B: Information on...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online