BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181221T160727Z
LOCATION:D168
DTSTART;TZID=America/Chicago:20181111T162100
DTEND;TZID=America/Chicago:20181111T162400
UID:submissions.supercomputing.org_SC18_sess165_ws_eduhpce108@linklings.co
 m
SUMMARY:Introducing Three Basic Concepts in Parallel Computation to 1st Ye
 ar Computer Science Students in a Simple and Effective Way
DESCRIPTION:Workshop\nDiversity, Education, Workshop Reg Pass\n\nIntroduci
 ng Three Basic Concepts in Parallel Computation to 1st Year Computer Scien
 ce Students in a Simple and Effective Way\n\nKundu, Kimm\n\nWhat are some 
 simple computation problems, with non-trivial applications, by which we ca
 n introduce the three basic concepts in parallel computation to 1st year C
 omputer Science students who have little programming experience and knowle
 dge of algorithms. Those three basic concepts are: (1) How parallel comput
 ation can reduce an algorithms completion-time, including methods to deter
 mine the completion-time for a given number of computing agents (people or
  CPUs, for simplicity). (2) How to identify parallelizable parts of an alg
 orithm given in a pseudocode form. (3) How to balance the computation-load
  of the agents, with perhaps some modification of the algorithm, to furthe
 r reduce the completion time. We present one such "ideal" computation prob
 lem, which has several simple intuitive solution algorithms and multiple w
 ays of parallelization. The results of a short quiz following 2 one hour l
 ectures covering one parallel algorithm of the ideal problem showed the st
 udents achieved a good understanding of the above three basic concepts. On
 e could cover a bit more material in one or two additional lectures. A ful
 l discussion of different parallelizations of our ideal problem and their 
 performance comparisons is fit for 2nd year and more advanced students.
URL:https://sc18.supercomputing.org/presentation/?id=ws_eduhpce108&sess=se
 ss165
END:VEVENT
END:VCALENDAR