Search Results for « STrack »
In the context of core-collapse supernovae, Strack and Burrows (Phys. Rev. D 71, 093004 (2005)) have recently developed an extension of the classical Boltzmann kinetic formalism that retains all the standard neutrino oscillation phenomenology, including resonant flavor conversion (the MSW …
Read the full abstract
In the context of core-collapse supernovae, Strack and Burrows (Phys. Rev. D 71, 093004 (2005)) have recently developed an extension of the classical Boltzmann kinetic formalism that retains all the standard neutrino oscillation phenomenology, including resonant flavor conversion (the MSW effect), neutrino self-interactions, and the interplay between neutrino-matter coupling and flavor oscillations. In this thesis, I extend the Strack & Burrows formalism to incorporate general relativity, spin degrees of freedom, and a possible neutrino magnetic-moment/magnetic-field interaction.
Emerging artificial intelligence (AI) and machine learning (ML) workloads present new challenges of managing the collective communication used in distributed training across hundreds or even thousands of GPUs. This paper presents STrack, a novel hardware-offloaded reliable transport protocol aimed at …
Read the full abstract
Emerging artificial intelligence (AI) and machine learning (ML) workloads present new challenges of managing the collective communication used in distributed training across hundreds or even thousands of GPUs. This paper presents STrack, a novel hardware-offloaded reliable transport protocol aimed at improving the performance of AI /ML workloads by rethinking key aspects of the transport layer. STrack optimizes congestion control and load balancing in tandem: it incorporates an adaptive load balancing algorithm leveraging ECN, while adopts RTT as multi-bit congestion indicators for precise congestion window adjustment. Additionally, STrack facilitates out-of-order delivery, selective retransmission, and swift loss recovery in hardware for multipath environment. The extensive simulation comparing STrack and RoCEv2 demonstrates that STrack outperforms RoCEv2 by up to 6X with synthetic workloads and by 27.4% with collective workloads, even with the optimized RoCEv2 system setup.
Infrared detection is an emerging technique for safety-critical tasks owing to its remarkable anti-interference capability. However, recent studies have revealed that it is vulnerable to physically-realizable adversarial patches, posing risks in its real-world applications. To address this problem, we are …
Read the full abstract
Infrared detection is an emerging technique for safety-critical tasks owing to its remarkable anti-interference capability. However, recent studies have revealed that it is vulnerable to physically-realizable adversarial patches, posing risks in its real-world applications. To address this problem, we are the first to investigate defense strategies against adversarial patch attacks on infrared detection, especially human detection. We propose a straightforward defense strategy, patch-based occlusion-aware detection (POD), which efficiently augments training samples with random patches and subsequently detects them. POD not only robustly detects people but also identifies adversarial patch locations. Surprisingly, while being extremely computationally efficient, POD easily generalizes to state-of-the-art adversarial patch attacks that are unseen during training. Furthermore, POD improves detection precision even in a clean (i.e., no-attack) situation due to the data augmentation effect. Our evaluation demonstrates that POD is robust to adversarial patches of various shapes and sizes. The effectiveness of our baseline approach is shown to be a viable defense mechanism for real-world infrared human detection systems, paving the way for exploring future research directions.
In the standard approaches to neutrino transport in the simulation of core-collapse supernovae, one will often start from the classical Boltzmann equation for the neutrino's spatial, temporal, and spectral evolution. For each neutrino species, and its anti-particle, the classical density …
Read the full abstract
In the standard approaches to neutrino transport in the simulation of core-collapse supernovae, one will often start from the classical Boltzmann equation for the neutrino's spatial, temporal, and spectral evolution. For each neutrino species, and its anti-particle, the classical density in phase space, or the associated specific intensity, will be calculated as a function of time. The neutrino radiation is coupled to matter by source and sink terms on the "right-hand-side" of the transport equation and together with the equations of hydrodynamics this set of coupled partial differential equations for classical densities describes, in principle, the evolution of core collapse and explosion. However, with the possibility of neutrino oscillations between species, a purely quantum-physical effect, how to generalize this set of Boltzmann equations for classical quantities to reflect oscillation physics has not been clear. To date, the formalisms developed have retained the character of quantum operator physics involving complex quantities and have not been suitable for easy incorporation into standard supernova codes. In this paper, we derive generalized Boltzmann equations for quasi-classical, real-valued phase-space densities that retain all the standard oscillation phenomenology, including resonant flavor conversion (the MSW effect), neutrino self-interactions, and the interplay between decohering matter coupling and flavor oscillations. With this formalism, any code(s) that can now handle the solution of the classical Boltzmann or transport equation can easily be generalized to include neutrino oscillations in a quantum-physically consistent fashion.
Large Language Models (LLM) show strong abilities in code generation, but their skill in creating efficient parallel programs is less studied. This paper explores how LLMs generate task-based parallel code from three kinds of input prompts: natural language problem descriptions, …
Read the full abstract
Large Language Models (LLM) show strong abilities in code generation, but their skill in creating efficient parallel programs is less studied. This paper explores how LLMs generate task-based parallel code from three kinds of input prompts: natural language problem descriptions, sequential reference implementations, and parallel pseudo code. We focus on three programming frameworks: OpenMP Tasking, C++ standard parallelism, and the asynchronous many-task runtime HPX. Each framework offers different levels of abstraction and control for task execution. We evaluate LLM-generated solutions for correctness and scalability. Our results reveal both strengths and weaknesses of LLMs with regard to problem complexity and framework. Finally, we discuss what these findings mean for future LLM-assisted development in high-performance and scientific computing.