Download presentation
Presentation is loading. Please wait.
1
Some problems and more…
COMP28112 – Lecture 20 Some problems and more… 24-Nov-18 COMP28112 Lecture 20
2
The importance/usefulness of keeping logs of activity
24-Nov-18 COMP28112 Lecture 20
3
Messages to the server based on hour of the day (0-1, 1-2, …, 23-24)
2014 2013 2015 ( messages) 2016 (88718 messages)
4
(111710) Messages to the server based on hour of the day (0-1, 1-2, …, 23-24)
2017 ( messages) 24-Nov-18 COMP28112 Lecture 20
5
(106109) Messages to the server based on hour of the day (0-1, 1-2, …, 23-24)
2018 ( messages) 24-Nov-18 COMP28112 Lecture 20
6
What day of the week was busiest? (1: Mon, 7: Sun)
2013 2014 2015 2016 24-Nov-18 COMP28112 Lecture 20
7
What day of the week was busiest? (1: Mon, 7: Sun)
2017 24-Nov-18 COMP28112 Lecture 20
8
What day of the week was busiest? (1: Mon, 7: Sun)
2018 24-Nov-18 COMP28112 Lecture 20
9
Messages since 9 February (=day 1)
23rd April 2013 2014 4th March 2016 2015
10
Messages since 9/2/2017 (=day 1)
1 March 28 March 24-Nov-18 COMP28112 Lecture 20
11
Messages since 9/2/2018 (=day 1)
16 April 20 February 27 Feb. 20 Mar.
12
Some problems… Marking sessions for the labs: May 8, 9, 11
When is it best to execute two tasks on one machine as opposed to one task on one machine + communication (data transfer) and computation on another? How to design random values, which are not uniform? E.g., two-digit integer where the probability is: 0-9 (90%) and (10%) How to compute the average of streamed data? (related to lab exercise 3, where you have to compute the average over large values) Split the following loop, so that each of 4 threads takes the same amount of computation. Rewrite, in terms of t, where t is between 0 and 3. for(i=0;i<1000;i++) { some_computation_on_i; } Marking sessions for the labs: May 8, 9, 11 All your lab work should be marked by May 11!
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.