Postgraduate Course: Parallel Design Patterns (PGPH11071)
Course Outline
School | School of Physics and Astronomy |
College | College of Science and Engineering |
Course type | Standard |
Availability | Not available to visiting students |
Credit level (Normal year taken) | SCQF Level 11 (Postgraduate) |
Credits | 10 |
Home subject area | Postgraduate (School of Physics and Astronomy) |
Other subject area | None |
Course website |
None |
Taught in Gaelic? | No |
Course description | This module will present a foundation of a pattern language for parallel programming.
Computational patterns are discussed only briefly as many of them are described in detail in other modules of the MSc programme. This module will focus on parallel algorithm strategy patterns:
&· Task Parallelism
&· Recursive Splitting
&· Geometric Decomposition
&· Pipeline
&· Discrete Event
And implementation Strategy Patterns:
&· Master/Worker
&· Loop Parallelism
&· Fork/Join
&· Shared Queue
&· Actors
Patterns are described on an abstract level and their implementations are explored in the tutorials. Tutorials put emphasis on creation of reusable generic implementations.
Codes will be written which demonstrate the separation of application details from the parallelisation strategy.
Programming exercises use C and Fortran. The course does not go into the details of language-specific issues, but examples are presented in C, Fortran and Java.
|
Entry Requirements (not applicable to Visiting Students)
Pre-requisites |
|
Co-requisites | |
Prohibited Combinations | |
Other requirements | None |
Additional Costs | None |
Course Delivery Information
|
Delivery period: 2011/12 Semester 2, Not available to visiting students (SS1)
|
WebCT enabled: Yes |
Quota: None |
Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
King's Buildings | Lecture | | 1-11 | 11:10 - 12:00 | | | | | King's Buildings | Lecture | | 1-11 | | | | 11:10 - 12:00 | | King's Buildings | Tutorial | | 1-11 | | 10:00 - 10:50 | | | |
First Class |
Week 1, Monday, 11:10 - 12:00, Zone: King's Buildings. Room 5327 JCMB |
No Exam Information |
Summary of Intended Learning Outcomes
On completion of this course students should be able to:
&· Recognise algorithm strategy patterns for the problem at hand.
&· Choose the most appropriate implementation pattern.
&· Design and write reusable parallel code.
&· Have awareness of features provided by the Java concurrency utilities package.
&· Understand the fundamentals of the API design.
|
Assessment Information
100% Coursework |
Special Arrangements
None |
Additional Information
Academic description |
Not entered |
Syllabus |
Not entered |
Transferable skills |
Not entered |
Reading list |
Not entered |
Study Abroad |
Not entered |
Study Pattern |
Not entered |
Keywords | PDP |
Contacts
Course organiser | Dr Judy Hardy
Tel: (0131 6)50 6716
Email: j.hardy@ed.ac.uk |
Course secretary | Yuhua Lei
Tel: (0131 6) 517067
Email: yuhua.lei@ed.ac.uk |
|
© Copyright 2011 The University of Edinburgh - 16 January 2012 6:35 am
|