BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260724T151410Z
LOCATION:Bldg. 6 - 102
DTSTART;TZID=Europe/Stockholm:20260629T113000
DTEND;TZID=Europe/Stockholm:20260629T123000
UID:submissions.pasc-conference.org_PASC26_sess169@linklings.com
SUMMARY:AP1D - ACM Papers: HPC Software & Systems
DESCRIPTION:Access the recording\n\nMulti-Artifact Analysis of Self-Admitt
 ed Technical Debt in Scientific Software\n\nContext: Self-admitted technic
 al debt (SATD) occurs when developers acknowledge shortcuts in code. In sc
 ientific software (SSW), such debt poses unique risks to the validity and 
 reproducibility of results. Objective: This study aims to identify, catego
 rize, and evaluate scientific debt, a specialize...\n\n\nEric Melin (Boise
  State University, Oak Ridge National Laboratory); Nasir Eisty (University
  of Tennessee); Gregory Watson (Oak Ridge National Laboratory); and Addi M
 alviya-Thakur (Oak Ridge National Laboratory, University of Tennessee)\n--
 -------------------\nXOR Bidding and Knapsack Formulations for HPC Network
  Resource Allocation\n\nModern High Performance Computing (HPC) centers fa
 ce growing challenges in ingesting large and diverse data streams. These i
 ssues often create bottlenecks that limit bandwidth use and delay scientif
 ic progress. Traditional static allocation and simple queuing methods are 
 not sufficient. This paper p...\n\n\nAbrar Hossain and Kishwar Ahmed (Univ
 ersity of Toledo)\n\nDomain: Engineering, Computational Methods and Applie
 d Mathematics\n\nSession Chair: Razvan Vass (Max Planck Society)
END:VEVENT
END:VCALENDAR