BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20200129T163557Z
LOCATION:505
DTSTART;TZID=America/Denver:20191118T105500
DTEND;TZID=America/Denver:20191118T112000
UID:submissions.supercomputing.org_SC19_sess128_ws_ia121@linklings.com
SUMMARY:Extending a Work-Stealing Framework with Priorities and Weights
DESCRIPTION:Workshop\n\nExtending a Work-Stealing Framework with Prioritie
 s and Weights\n\nNakashima, Yoritaka, Yasugi, Hiraishi, Umatani\n\nThis pa
 per proposes priority- and weight-based steal strategies for an idle worke
 r (thief) to select a victim worker in work-stealing frameworks. Typical w
 ork-stealing frameworks employ uniformly random victim selection. We imple
 mented the proposed strategies on a work-stealing framework called Tascell
 ; Tascell programmers can let each worker estimate and declare, as a real 
 number, the amount of remaining work required to complete its current task
  so that declared values are used as priorities or weights in the enhanced
  Tascell framework. To reduce the total task-division cost, the proposed s
 trategies avoid stealing small tasks. With a priority-based strategy, a th
 ief selects the victim that has the highest known priority at that point i
 n time. With a weight-based non-uniformly random strategy, a thief uses th
 e relative weights of victim candidates as their selection probabilities. 
 The proposed selection strategies outperformed uniformly random victim sel
 ection. Our evaluation uses a parallel implementation of the "highly seria
 l'' version of the Barnes-Hut force-calculation algorithm in a shared memo
 ry environment and five benchmark programs in a distributed memory environ
 ment.\n\nTag: Workshop Reg Pass, Algorithms, Architectures, Irregular Appl
 ications\n\nRegistration Category: Workshop Reg Pass, Algorithms, Architec
 tures, Irregular Applications
URL:https://sc19.supercomputing.org/presentation/?id=ws_ia121&sess=sess128
END:VEVENT
END:VCALENDAR