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:20260522T150126Z
LOCATION:C141/143/149
DTSTART;TZID=America/Chicago:20181114T133000
DTEND;TZID=America/Chicago:20181114T150000
UID:submissions.supercomputing.org_SC18_sess177@linklings.com
SUMMARY:Clouds and Distributed Computing
DESCRIPTION:Dynamically Negotiating Capacity Between On-Demand and Batch C
 lusters\n\nIn the era of rapid experimental expansion data analysis needs 
 are rapidly outpacing the capabilities of small institutional clusters and
  looking to integrate HPC resources into their workflow. We propose one wa
 y of reconciling on-demand needs of experimental analytics with the batch 
 managed HPC res...\n\n\nFeng Liu (University of Minnesota), Kate Keahey (A
 rgonne National Laboratory), Pierre Riteau (University of Chicago), and Jo
 n Weissman (University of Minnesota)\n---------------------\nA Reference A
 rchitecture for Datacenter Scheduling: Design, Validation, and Experiments
 \n\nDatacenters act as cloud-infrastructure to stakeholders across industr
 y, government, and academia. To meet growing demand yet operate efficientl
 y, datacenter operators employ increasingly more sophisticated scheduling 
 systems, mechanisms, and policies. Although many scheduling techniques alr
 eady exi...\n\n\nGeorgios Andreadis (Delft University of Technology, Vrije
  University Amsterdam); Laurens Versluis (Vrije University Amsterdam); Fab
 ian Mastenbroek (Delft University of Technology); and Alexandru Iosup (Vri
 je University Amsterdam, Delft University of Technology)\n----------------
 -----\nA Lightweight Model for Right-Sizing Master-Worker Applications\n\n
 When running a parallel application at scale, a resource provisioning poli
 cy should minimize over-commitment (idle resources) and under-commitment (
 resource contention). However, users seldom know the quantity of resources
  to appropriately execute their application. Even with such knowledge, ove
 r- a...\n\n\nNathaniel Kremer-Herman, Benjamin Tovar, and Douglas Thain (U
 niversity of Notre Dame)\n\nTag: Clouds and Distributed Computing, Resourc
 e Management, Scheduling\n\nRegistration Category: Tech Program Reg Pass\n
 \nSession Chair: Shantenu Jha (Rutgers University; PPPL, Princeton Univers
 ity)
END:VEVENT
END:VCALENDAR