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:20230124T171525Z
LOCATION:D220
DTSTART;TZID=America/Chicago:20221114T164000
DTEND;TZID=America/Chicago:20221114T165000
UID:submissions.supercomputing.org_SC22_sess459_ws_eduhpca105@linklings.co
 m
SUMMARY:Hill Climbing with Montecarlo: An Assignment for OpenMP, MPI, and 
 CUDA/OpenCL
DESCRIPTION:Workshop\n\nHill Climbing with Montecarlo: An Assignment for O
 penMP, MPI, and CUDA/OpenCL\n\nGonzalez-Escribano, Torres, Carratalá-Sáez\
 n\nWe present the fifth example in a series of assignments used in a Paral
 lel Computing course to teach the approaches to the same problem in differ
 ent parallel programming models. It targets concepts of shared-memory prog
 ramming, distributed-memory programming, and/or GPU programming. This assi
 gnment is based on a Montecarlo probabilistic approach for a Hill Climbing
  algorithm, in order to locate the maximum values of a two dimensional fun
 ction. The program is designed to be simple, easy to understand by student
 s, and to include specific parallelization and optimization opportunities.
  It maintains the same core concepts used in four previously presented ass
 ignments, with a different design approach. It focus on dealing with non-d
 eterminism during execution, the impact of randomization on load-balance, 
 and new relevant optimization challenges. This assignment has been success
 fully used in parallel programming contests during an optional Parallel Pr
 ogramming course in the third year of Computer Engineering degree.\n\nSess
 ion Format: Recorded\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR