CS3101
Due: 13-th of February 2015
Problem Set 1
CS3101
Submission instructions on last page
PROBBLEM 1. [70 points] Merge sort is a particularly good example of the divide
and conquer algorithmic paradigm. Merge sort is a recursive procedure that uses at
Parallel and Distributed Ccomputing with Julia
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS3101 (updated January 7, 2015)
Plan
1
Tasks: Concurrent Function Calls
2
Julias Prnciples for Parallel Computing
3
Tips on Moving Cod
Elements of correction for the exercises of
CS2101A Lab 2
Instructor: Marc Moreno Maza, TA: Li Zhang
Wednesday 24 September 2014
1
Exercise 1
function abs_value(x,y)
abs(x-y)
end
2
exercise 2
1.
function vectorsum(u,v)
n=length(u)
if length(v) != n
error(
Analysis of Divide and Conquer Algorithms
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS3101
(Moreno Maza)
Analysis of Divide and Conquer Algorithms
CS3101
1 / 23
Plan
1
Review of Complexity Notions
2
Divide-and-Conquer Recurr
Theory & Practice of High Performance Computing: CS3101.
UWO, March, 4, 2015.
Student name:
Student ID number:
Guidelines. The exam is closed book and all notes are forbidden. The duration is 1 hour 40 minutes.
There are 17 pages in the exam. The last thr
Elements of correction for the exercises of
CS2101A Lab 3
Instructor: Marc Moreno Maza, TA: Li Zhang
Wednesday, October 1, 2014
1
Exercise 1
@everywhere function fib(n)
if (n < 2) then
return n
else return fib(n-1) + fib(n-2)
end
end
function runningtime(
Analysis of Multithreaded Algorithms
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS4402-9535
(Moreno Maza)
Analysis of Multithreaded Algorithms
CS4402-9535
1 / 27
Plan
1
Matrix Multiplication
2
Merge Sort
3
Tableau Constructio
Plan
Issues with Multithreaded Parallelism on Multicore
Architectures
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS3101
(Moreno Maza)
Issues with Multithreaded Parallelism on Multicore Architectures
CS3101
1 / 35
Example 1: a
CS3101
Due: Wednesday 8-th of April 2015
Problem Set 3
CS3101
Submission instructions on last page
PROBBLEM 1. [25 points]
In this problem, we develop a divide-and-conquer algorithm for the following geometric
task, called the CLOSEST PAIR PROBLEM (CSP):
Introduction to Multicore Programming
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS 3101
(Moreno Maza)
Introduction to Multicore Programming
CS 3101
1 / 38
Plan
1
Multi-core Architecture
Multi-core processor
CPU Cache
CPU Coh
CS3101b: Quiz 3.
UWO, April 2, 2015.
Student ID number:
Student Last Name:
Guidelines. The quiz consists of four questions. All answers should be written
in the answer boxes. No justications for the answers are needed, unless explicitly
required. You are
CS3101: Quiz 1.
UWO, January 29, 2015.
Student ID number:
Student Last Name:
Guidelines. The quiz consists of two exercises and is a closed book test. All
answers should be written in the answer boxes. No justications for the answers
are needed, unless ex
CS3101b Theory of High-performance
Computing
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS3101
Plan
1
Hardware Acceleration Technologies
2
Distributed computing with Julia
3
Optimizing Code for Data Locality: A Case Study
4
M
CS3101
Due: Tuesday 10-th of March 2015
Problem Set 1
CS3101
PROBBLEM 1.
Submission instructions on last page
[70 points]
We consider a two-dimensional tableau (or matrix) T containing elements T [i, j] with
0 i n and 0 j n. We assume that the elements T
CS3101: Quiz 2.
UWO, February 26, 2015.
Student ID number:
Student Last Name:
Guidelines. The quiz consists of two exercises and is a closed book test. All
answers should be written in the answer boxes. No justications for the answers
are needed, unless e
Multithreaded Parallelism and Performance Measures
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS 3101
(Moreno Maza)
Multithreaded Parallelism and Performance Measures
CS 3101
1 / 52
Plan
1
Parallelism Complexity Measures
2
ci
Parallel Random-Access Machines
Marc Moreno Maza
University of Western Ontario, London, Ontario (Canada)
CS3101
(Moreno Maza)
Parallel Random-Access Machines
CS3101
1 / 69
Plan
1
The PRAM Model
2
Performance counters
3
Handling Shared Memory Access Conict