{"title":"Message from the IPDPS 2023 Workshops Chair and Vice-chair","authors":"","doi":"10.1109/ipdpsw59300.2023.00007","DOIUrl":"https://doi.org/10.1109/ipdpsw59300.2023.00007","url":null,"abstract":"","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125032337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"JSSPP Preface and Committees","authors":"","doi":"10.1109/ipdpsw59300.2023.00109","DOIUrl":"https://doi.org/10.1109/ipdpsw59300.2023.00109","url":null,"abstract":"","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126034271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Utilizing batched solver ideas for efficient solution of non-batched linear systems","authors":"Pratik Nayak, H. Anzt","doi":"10.1109/IPDPSW59300.2023.00113","DOIUrl":"https://doi.org/10.1109/IPDPSW59300.2023.00113","url":null,"abstract":"The techniques used in batched methods have shown great promise in reducing latency, increasing the memory throughput and maximizing the occupancy of the GPU. In this paper, we adapt these techniques to solve monolithic linear systems and showcase their advantages. We implement this in our production-ready software library, Ginkgo 1 and analyze the performance of batched and non-batched iterative solvers on two generations of AMD and NVIDIA GPUs and for AMD and Intel multi-core CPUs. We demonstrate that for relatively small problem sizes, utilizing these techniques for monolithic problems can provide significant performance advantages.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123557584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Echo Chambers as Gravity Wells","authors":"Jeremy E. Thompson, Eugene Santos","doi":"10.1109/ipdpsw59300.2023.00141","DOIUrl":"https://doi.org/10.1109/ipdpsw59300.2023.00141","url":null,"abstract":"Fake news has become a bane to modern society on numerous fronts, from politics to medicine. To improve the automatic detection of fake news, we propose a generic model for echo chambers which will allow the simulation of social media groups across a variety of platforms. We emphasize employing data readily available from social media platforms to ensure the model’s applicability across a wide spectrum of social media. This model focuses on three foundational characteristics which we posit can bolster the formation of online echo chambers. Furthermore, the model makes use of a gravity well simulation to represent the effect of some social media groups’ ability to capture an audience’s attention and allegiance, often to the detriment of users, as well as to society as a whole. By applying the hypothesized model to nineteen subreddits from the Reddit social media platform and exploring more fully the twelve subreddits which reveal themselves as equivalent in “gravity potential”, we explore the model’s efficacy and future utility. Contributions include the proposed generic model for echo chambers including three pillars central to echo chamber formation, as well as the gravity well simulation for social media groups.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129161160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Understanding SYCL Portability for Pseudorandom Number Generation: a Case Study with Gene-Expression Connectivity Mapping","authors":"Zheming Jin, J. Vetter","doi":"10.1109/IPDPSW59300.2023.00057","DOIUrl":"https://doi.org/10.1109/IPDPSW59300.2023.00057","url":null,"abstract":"Towards the goal of improving functional and performance portability of SYCL, we study a bioinformatics application that has been accelerated with CUDA and fast pseudorandom number generation on a GPU. We describe the experience of migrating pseudorandom number generation from CUDA to SYCL, evaluate the performance of pseudorandom number generators using the CUDA random number generation library, suggest the support of the XORWOW pseudorandom number generator in the oneAPI math kernel library (oneMKL) interface for performance portability, and identify the performance gap using the MKL interface in SYCL that supports pseudorandom number generation with third-party libraries. We hope that the results are valuable for the development of the SYCL ecosystem.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129425206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Introducing Parallel and Distributed Computing concepts through the use of Flashcards and a Card Game","authors":"Mary Smith, Srishti Srivastava","doi":"10.1109/IPDPSW59300.2023.00053","DOIUrl":"https://doi.org/10.1109/IPDPSW59300.2023.00053","url":null,"abstract":"This paper describes two active learning strategies to teach and review fundamental PDC concepts in early computer science courses. Questions were created based on eight PDC concept categories. In the first phase, flashcards were created for students to review the concepts. In the second phase, a card game called PDC Quest was created to allow groups of students to engage collaboratively in learning and reviewing the concepts.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129838538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Amit Samanta, Faraz Ahmed, Lianjie Cao, Ryan Stutsman, P. Sharma
{"title":"Persistent Memory-Aware Scheduling for Serverless Workloads","authors":"Amit Samanta, Faraz Ahmed, Lianjie Cao, Ryan Stutsman, P. Sharma","doi":"10.1109/IPDPSW59300.2023.00105","DOIUrl":"https://doi.org/10.1109/IPDPSW59300.2023.00105","url":null,"abstract":"In the last few years, persistent memory (PM) has become widely commercially available. PM’s direct load/store interface allows fine-grained storage access that fully bypasses all software I/O overheads. However, existing PM modules exhibit performance anomalies, particularly when they are concurrently accessed by many threads. PM is poised to change how all applications access storage, and in this paper we look at how PM might be best managed and used in serverless applications. We make the case that serverless presents a special opportunity for PM because serverless platforms can use the structure of serverless applications to gain more insight into their I/O behavior and because serverless platforms include specialized schedulers that can exploit the combined knowledge of application and PM behavior for managing concurrent workloads.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"8 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Designing Secure Performance Metrics for Last Level Cache","authors":"Probir Roy, Birhanu Eshete, Pengfei Su","doi":"10.1109/IPDPSW59300.2023.00069","DOIUrl":"https://doi.org/10.1109/IPDPSW59300.2023.00069","url":null,"abstract":"In modern CPU architectures, last level caches (LLC) are typically shared among multiple CPU cores. LLCs enable data sharing across application threads and promote data re-usability. However, due to limited resources, an efficient utilization of LLCs is vital for application performance. One effective way to understand the LLC usage is using hardware performance counters to measure the LLC performance metrics such as hit and miss ratios.Given the benefits of hardware counter based performance metrics, enabling these metrics in a multi-tenant environment is challenging due to security implications. An adversary can exploit these metrics for various side-channel attacks. Current mitigation policies simply restrict the access of performance metrics which limits the legitimate use of these metrics for performance monitoring and optimization. This paper addresses the vulnerability of LLC metrics as an accessory to side-channel attacks.This paper proposes novel secure performance metrics, CER-BERUS, aimed at limiting LLC performance counter-based side-channel vulnerability while providing usable performance insights. The key insight in CERBERUS is that it leverages a differentially private mechanism to make the side-channels undetectable to adversaries. Through a systematic evaluation of benchmark performance monitoring scenarios, we show that CERBERUS’s performance metrics are usable for LLC-aware profile-guided compiler optimization.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126223321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Remote Execution of OpenCL and SYCL Applications via rOpenCL","authors":"Rui Alves, J. Rufino","doi":"10.1109/IPDPSW59300.2023.00020","DOIUrl":"https://doi.org/10.1109/IPDPSW59300.2023.00020","url":null,"abstract":"With the increasing computational demands of modern applications, heterogeneous systems continue to have an important role in accelerating computationally intensive tasks, a trend confirmed by the most recent HPC architectures. Efficiently exploiting these systems implies the use of specific programming paradigms, such as the classic OpenCL model, or modern single-source alternatives, like SYCL. However, the original execution model of these approaches does not provision for the use of coprocessors other than those directly attached to the host system where the heterogeneous application starts. Over time, several solutions emerged to cope with this limitation, both at the hardware and software level, allowing to exploit remote/distributed co-processors. In this paper, a representative set of seminal OpenCL API Forwarders is revisited and their performance compared with rOpenCL (a recently introduced platform of the same kind), using the classical matrix multiplication case study. In addition, given the importance of SYCL, which has been steadily gaining traction, this paper also exploits the potential of rOpenCL in supporting SYCL applications that use remote accelerators. To that end, another set of benchmarks is used, with both OpenCL and SYCL implementations, allowing not only to gather insight into the performance trade-offs of local versus remote (via rOpenCL) execution, but also about the current performance differential between the two programming models.","PeriodicalId":164288,"journal":{"name":"2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131734600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}