Faculty of Mathematics and Computer science




Скачать 69.48 Kb.
НазваниеFaculty of Mathematics and Computer science
Дата23.12.2012
Размер69.48 Kb.
ТипДокументы
syllabus

1. Information regarding the programme

1.1 Higher education institution

Babes_Bolyai” University

1.2 Faculty

Faculty of Mathematics and Computer science

1.3 Department

Department of Computer Science

1.4 Field of study

Informatics(Computer Science)

1.5 Study cycle

Master

1.6 Study programme / Qualification

Computer Science



2. Information regarding the discipline

2.1 Name of the discipline

Advanced Programming Methods

2.2 Course coordinator

Assoc.Prof.PhD. Niculescu Virginia

2.3 Seminar coordinator

Assoc.Prof.PhD. Niculescu Virginia

2.4. Year of study

1

2.5 Semester

1

2.6. Type of evaluation

E.

2.7 Type of discipline

Mandatory



3. Total estimated time (hours/semester of didactic activities)

3.1 Hours per week

3

Of which: 3.2 course

2

3.3 seminar/laboratory

1 sem.

3.4 Total hours in the curriculum

42

Of which: 3.5 course

28

3.6 seminar/laboratory

14

Time allotment:

hours

Learning using manual, course support, bibliography, course notes

20

Additional documentation (in libraries, on electronic platforms, field documentation)

10

Preparation for seminars/labs, homework, papers, portfolios and essays

23

Tutorship

7

Evaluations

20

Other activities: ..................

-

3.7 Total individual study hours

80

3.8 Total hours per semester

150

3.9 Number of ECTS credits

6



4. Prerequisites (if necessary)

4.1. curriculum

  • Algorithmics, Object-oriented and functional programming

4.2. competencies

  • Programming skills and basic abilities for dealing with abstractions



5. Conditions (if necessary)

5.1. for the course

  • projector

5.2. for the seminar

  • projector



6. Specific competencies acquired

Professional competencies

  • Knowledge, understanding of the basic concepts of parallel programming.

  • Ability to work independently and/or in a team in order to solve problems in defined professional contexts (models).

  • Knowledge, understanding of the theoretical foundations of parallel algorithms construction.

Transversal competencies

    • Ability to solve problems using parallel programming.

    • Ability to do research work in the domain of the parallel programming by studing a particular model of parallel computation.



7. Objectives of the discipline (outcome of the acquired competencies)

7.1 General objective of the discipline


  • Each student has to prove that (s)he acquired an acceptable level of knowledge and understanding of the subject, that (s)he is capable of stating these knowledge in a coherent form, that (s)he has correct habits of analysis, design, and implementation using different models of parallel computation.




7.2 Specific objective of the discipline


  • To present the basic paradigms of parallel programming .

  • To offer different models of parallel programs development and understanding their necessity and their advantages.

  • To create the ability to correctly develop parallel algorithms using different models of parallel computation (algorithms from linear algebra, numerical analysis, graph, searching and sorting algorithms)..



8. Content

8.1 Course

Teaching methods

Remarks



General Introduction to parallel programming:

  • reasons for using parallel programming;

  • problems and difficulties in parallel programming;

  • the necessity of using models

Parallel Computer Architectures - Taxonomies

Exposure: description, explanation, examples, discussion of case studies




  1. Types of parallelism

  • Implicit parallelism

  • Explicit Parallelism

  • Data-parallel model

  • Message-passing model

  • Shared-variable model

Exposure: description, explanation, examples, discussion of case studies




  1. General presentation of the existing parallel computation models (PCM).

    • Requierements for PCM

    • Classification:

- implicit parallelism

- implicit decomposition

- explicit decomposition

- explicit mapping

-explicit communication

- everything explicit


Exposure: description, explanation, examples, discussion of case studies




  1. Phases in parallel programs development (PCAM)

  • Partitioning, Communication, Agglomeration, Mapping




Exposure: description, explanation, examples, discussion of case studies






Decomposition

  • functional (task decomposition)

  • of the domain(geometrical)

  • data-distributions




Exposure: description, explanation, examples, discussion of case studies




  1. Task Dependency Graph, Task Interaction Graph, Degree of Concurrency, Granularity, Mapping




Exposure: description, explanation, examples, discussion of case studies






Parallel programming paradigms

- Master-slaves

- Task-Farm

- Work-Pool

- Divide &Conquer

- Pipeline


Exposure: description, explanation, examples, discussion of case studies




  1. PRAM models

Computational networks

Brent Theorem


Exposure: description, explanation, examples, discussion of case studies






Analytical Modeling of Parallel Systems


Exposure: description, explanation, examples, discussion of case studies




  1. UNITY "Unbounded Nondeterministic Iterative Transformations"

UNITY programs notation, Prooving rules, Mapping, Examples

-

Exposure: description, explanation, examples, discussion of case studies




  1. Bird-Meertens Formalism (BMF).

  • List Homomorphisms

  • Categorical Data Types

Examples

Exposure: description, explanation, examples, discussion of case studies









Pares – A Model for Parallel Recursive Programs.

  • Special data structures of parallel recursion: PowerLists, ParLists, PLists

Exposure: description, explanation, examples, discussion of case studies









Bulk Synchronous Parallel programming

Exposure: description, explanation, examples, discussion of case studies






Comparisons of the models for parallel computation.


Exposure: description, explanation, examples, discussion of case studies




Bibliography

  1. Rob H. Bisseling. Parallel Scientific Computation: A Structured Approach using BSP and MPI, Oxford University Press, March 2004. 324 pages.

  2. Ian Foster. Designing and Building Parallel Programs, Addison-Wesley 1995.

  3. Grama, A. Gupta, G. Karypis, V. Kumar. Introduction to Parallel Computing, Addison Wesley, 2003.

  4. K.M. Chandy, J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.

  5. J. Misra. PowerList: A structure for parallel recursion.ACM Transactions on Programming Languages and Systems, 16(6):1737-1767, November 1994.

  6. V. Niculescu. Calcul Paralel. Proiectare si dezvoltare formala a programelor paralele. Presa Univ. Clujana, 2006.

  7. V. Niculescu. PARES - A Model for Parallel Recursive Programs, Romanian Journal of Information Science and Technology (ROMJIST), Ed. Academiei Romane, Volume 14(2011), No. 2,  pp. 159–182, 2011

  8. D. Skillicorn. Foundations of Parallel Programming, Cambridge International Series on Parallel Computations, 1994

  9. D.B. Skillicorn, Jonathan Hill, W. F. McColl, Questions and answers about BSP (1996)

  10. D.B. Skillicorn, D. Talia. Models and Languages for Parallel Computation. ACM Computer Surveys, 30(2) pg.123-136, June 1998.




8.2 Seminar

Teaching methods

Remarks

  1. Simple examples of parallel programs.

Explanation, dialogue, case studies

The seminar is structured as 2 hours classes every second week

  1. Tehniques used in parallel programs construction.




Dialogue, debate, case studies, examples, proofs




  1. PRAM - examples

Dialogue, debate, case studies, examples, proofs




  1. MPI and OpenMP examples




Dialogue, debate, explanation, examples




  1. Student presentations




Dialogue, debate, explanation, examples




  1. Student presentations




Dialogue, debate, explanation, examples




  1. Student presentations




Dialogue, debate, explanation, examples




Bibliography


  1. C. A. R. Hoare. Communicating Sequential Processes was first published in by Prentice Hall International, 2004(revised). [http://www.usingcsp.com/cspbook.pdf]

  2. D. Grigoras. Calculul Paralel. De la sisteme la programarea aplicatiilor. Computer Libris Agora, 2000.

  3. V. Niculescu, Modele de elaborare a algoritmilor paraleli, PhD. Thesis, Univ. Babes-Bolyai, 2002.

  4. Roscoe, A. W. (Revised 2005), The Theory and Practice of Concurrency, Prentice Hall, ISBN 0-13-674409-5

  5. Parallel Programming Model Watch [http://view.eecs.berkeley.edu/wiki/Parallel_Programming_Model_Watch]






9. Corroborating the content of the discipline with the expectations of the epistemic community, professional associations and representative employers within the field of the program





  • The course respects the IEEE and ACM Curricula Recommendations for Computer Science studies;

  • The course exists in the studying program of all major universities in Romania and abroad;






10. Evaluation

Type of activity

10.1 Evaluation criteria

10.2 Evaluation methods

10.3 Share in the grade (%)

10.4 Course

- know the basic principles and paradigms of the domain;

- to be able to use the presented models for solving problems

Written exam


40%


10.5 Seminar

- a written paper (research) that presents a model of parallel computation

-presentation

-discussion


60%

10.6 Minimum performance standards

  • At least grade 5 (from a scale of 1 to 10) at both written exam and research paper.



Date Signature of course coordinator Signature of seminar coordinator

.......................... ...............Niculescu Virginia....................Niculescu Virginia


Date of approval Signature of the head of department

........................................... ...........…............................

Похожие:

Faculty of Mathematics and Computer science iconFaculty of Mathematics and Computer science

Faculty of Mathematics and Computer science iconFaculty of Mathematics and Computer Science

Faculty of Mathematics and Computer science iconFaculty of Mathematics and Computer Science

Faculty of Mathematics and Computer science iconFaculty of Mathematics and Computer Science

Faculty of Mathematics and Computer science iconMathematics and Computer Science in Hungarian

Faculty of Mathematics and Computer science iconDidactics of Mathematics and Computer Science

Faculty of Mathematics and Computer science iconPh. D. Mathematics with concentration in Computer Science

Faculty of Mathematics and Computer science iconComputer Science and applied mathematics

Faculty of Mathematics and Computer science iconКнига является завершением более чем 5-тысячелетнего периода в развитии «Учения о гармонии»
В 2009 г международное издательство “World Scientific” опубликовало книгу: A. P. Stakhov. The Mathematics of Harmony. From Euclid...
Faculty of Mathematics and Computer science iconКнига является завершением более чем 5-тысячелетнего периода в развитии «Учения о гармонии»
В 2009 г международное издательство “World Scientific” опубликовало книгу: A. P. Stakhov. The Mathematics of Harmony. From Euclid...
Разместите кнопку на своём сайте:
Библиотека


База данных защищена авторским правом ©lib.znate.ru 2014
обратиться к администрации
Библиотека
Главная страница