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:20181221T160906Z LOCATION:C145 DTSTART;TZID=America/Chicago:20181114T150000 DTEND;TZID=America/Chicago:20181114T170000 UID:submissions.supercomputing.org_SC18_sess468@linklings.com SUMMARY:ACM Student Research Competition DESCRIPTION:ACM Student Research Competition, Poster\nStudent Program, Tec h Program Reg Pass, ACM Student Research Competition\n\nStudying the Impac t of Power Capping on MapReduce-Based, Data-Intensive Mini-Applications on Intel KNL and KNM Architectures\n\nDavis\n\nIn this poster, we quantitati vely measure the impacts of data movement on performance in MapReduce-base d applications when executed on HPC systems. We leverage the PAPI ‘powerca p’ component to identify ideal conditions for execution of our application s in terms of (1) dataset characteristics (i.e., ...\n\n------------------ ---\nAccelerating DNA Long Read Mapping with Emerging Technologies\n\nKapl an\n\nDNA sequencing technologies output only short fragments of a genome, called reads. New single-molecule real-time sequencing technologies can p roduce long reads, up to tens of thousands base pairs, within minutes. How ever, these long reads may contain up to 15% errors.\n\nTo construct a gen ome from DNA...\n\n---------------------\nSimFS: A Simulation Data Virtual izing File System Interface\n\nDi Girolamo\n\nIn the big (simulation) data era, simulations often produce petabytes of data to be stored in parallel filesystems or large-scale databases. This data is accessed, often by tho usands of analysts and scientists, over the course of decades. However, st oring these volumes of data for long time periods ...\n\n----------------- ----\nMeasuring Swampiness: Quantifying Chaos in Large Heterogeneous Data Repositories\n\nJung, Whitaker\n\nAs scientific data repositories and file systems grow in size and complexity, they become increasingly disorganized . The coupling of massive quantities of data with poor organization makes it challenging for scientists to locate and utilize relevant data, thus sl owing the process of analyzing data of...\n\n---------------------\nRecurs ive Algebraic Coloring Engine\n\nAlappat\n\nMany iterative numerical metho ds for sparse systems and building blocks of sparse linear algebra are dif ficult to parallelize due to data dependencies. These may be loop-carried dependencies as they occur in solvers like Gauss-Seidel or write conflicts as in symmetric sparse matrix vector. Most of ...\n\n------------------- --\nModeling Single-Source Shortest Path Algorithm Dynamics to Control Per formance and Power Tradeoffs\n\nKaramati, Young, Vuduc\n\nThis work presen ts a new methodology to improve the performance of parallel algorithms by tuning the amount of available parallelism for execution throughout the ru ntime. As such, we expose key parameters controlling the performance and p arallelism of the algorithm and build a software-based control...\n\n----- ----------------\nAccelerating Microscope Data Analysis Using Parallel Com puting\n\nRavi\n\nSingle-Molecule Localization Microscopy (SMLM) technique s deal with the diffraction limit of fluorescent microscopy by localizing single molecules with high precision by stochastically switching molecules on and off. Thousands of camera frames containing subsets of blinking mol ecules are recorded to...\n\n---------------------\nUsing Integrated Proce ssor Graphics to Accelerate Concurrent Data and Index Structures\n\nFuente s\n\nWith the advent of computing systems with on-die integrated processor graphics (iGPU), new programming challenges have emerged from these heter ogeneous systems. We proposed different data and index structure algorithm s that can benefit from the Intel's iGPU architecture and the C for Media (CM) prog...\n\n---------------------\nAccelerating 2D FFT: Exploit GPU Te nsor Cores through Mixed-Precision\n\nCheng, Sorna\n\nThe two-dimensional Fourier Transform is a widely-used computational kernel in many HPC applic ations. The popular NVIDIA cuFFT library provides a simple interface to co mpute 2D FFT on GPUs, but it's yet to utilize the recent hardware advancem ent in half-precision floating-point arithmetic. In this p...\n END:VEVENT END:VCALENDAR