the proceedings contain 5 papers. the special focus in this conference is on distributed Applications and Interoperable System. the topics include: Synql: A CRDT-Based Approach for Replicated Relational Databases...
ISBN:
(纸本)9783031626371
the proceedings contain 5 papers. the special focus in this conference is on distributed Applications and Interoperable System. the topics include: Synql: A CRDT-Based Approach for Replicated Relational Databases with Integrity Constraints;encryption as a Service: A Review of Architectures and Taxonomies;compact Storage of Data Streams in Mobile Devices;mining Profitability in Bitcoin: Calculations of User-Miner Equilibria and Cost of Mining.
the proceedings contain 51 papers. the topics discussed include: using an updating of DHCP in mobile ad-hoc networks;searching and detecting spatial LSB steganographic images on the Internet;development of parallel di...
详细信息
ISBN:
(纸本)0889865701
the proceedings contain 51 papers. the topics discussed include: using an updating of DHCP in mobile ad-hoc networks;searching and detecting spatial LSB steganographic images on the Internet;development of parallel direct sparse linear solvers within a parallel finite element code;checkpointing and rollback-recovery protocol integrated with VsSG protocol for RYW session guarantee;achieving realtime capabilities in Ethernet networks by edge-coloring of communication conflict-multigraphs;cross-layer designs for mitigating range attacks in ad hoc networks;grid load balancing using an echo system of intelligent ants;critical path routing (CPR) protocol for mobile ad hoc networks;ADPROC: an adaptive routing framework to provide QoS in wireless sensor networks;evaluating the use of Motes and Tinyos for a mobile sensor platform;and a comparison study of optical MIN networks with parallel planes.
the growing popularity of data-intensive applications in cloud computing necessitates a cost-effective approach to harnessing distributed processing capabilities. However, the wide variety of instance types and config...
详细信息
the proceedings contain 64 papers. the topics discussed include: analyzing program transitions to compute benefit of tolerating consistency violation faults;GeoChain: a locality-based Sharding protocol for permissione...
ISBN:
(纸本)9781450397964
the proceedings contain 64 papers. the topics discussed include: analyzing program transitions to compute benefit of tolerating consistency violation faults;GeoChain: a locality-based Sharding protocol for permissioned blockchains;impact of redundancy on resilience in distributed optimization and learning;the snow plow problem: perpetual maintenance by mobile agents on the line;self-stabilizing synchronous unison in directed networks;dynamic graph models inspired by the bitcoin network-formation process;scalable skill-oriented task allocation in crowdsourcing within a serverless ecosystem;distributed data minimization for decentralized collaborative filtering systems;the geodesic mutual visibility problem for oblivious robots: the case of trees;almost-surely terminating asynchronous byzantine agreement against general adversaries with optimal resilience;learned load balancing;structured hypergraphs in cellular mobile communication systems;and an approximation algorithm for path planning of vehicles for data collection in wireless rechargeable sensor networks.
We develop a distributed-memory parallel algorithm for performing batch updates on streaming graphs, where vertices and edges are continuously added or removed. Our algorithm leverages distributed sparse matrices as t...
ISBN:
(纸本)9798350355543
We develop a distributed-memory parallel algorithm for performing batch updates on streaming graphs, where vertices and edges are continuously added or removed. Our algorithm leverages distributed sparse matrices as the core data structures, utilizing equivalent sparse matrix operations to execute graph updates. By reducing unnecessary communication among processes and employing shared-memory parallelism, we accelerate updates of distributed graphs. Additionally, we maintain a balanced load in the output matrix by permuting the resultant matrix during the update process. We demonstrate that our streaming update algorithm is at least 25 times faster than alternative linear-algebraic methods and scales linearly up to 4,096 cores (32 nodes) on a Cray EX supercomputer.
Large-scale DL on HPC systems like Frontier and Summit uses distributed node-local caching to address scalability and performance challenges. However, as these systems grow more complex, the risk of node failures incr...
详细信息
ISBN:
(纸本)9798350355543
Large-scale DL on HPC systems like Frontier and Summit uses distributed node-local caching to address scalability and performance challenges. However, as these systems grow more complex, the risk of node failures increases, and current caching approaches lack fault tolerance, jeopardizing large-scale training jobs. We analyzed six months of SLURM job logs from Frontier and found that over 30% of jobs failed after an average of 75 minutes. To address this, we propose fault-tolerance strategies that recache data lost from failed nodes using a hash ring technique for balanced data recaching in the distributed node-local caching, reducing reliance on the PFS. Our extensive evaluations on Frontier showed that the hash ring-based recaching approach reduced training time by approximately 25% compared to the approach that redirects I/O to the PFS after node failures and demonstrated effective load balancing of training data across nodes.
Fortran compilers that provide support for Fortran's native parallel features often do so with a runtime library that depends on details of boththe compiler implementation and the communication library, while oth...
详细信息
ISBN:
(纸本)9798350355543
Fortran compilers that provide support for Fortran's native parallel features often do so with a runtime library that depends on details of boththe compiler implementation and the communication library, while others provide limited or no support at all. this paper introduces a new generalized interface that is both compiler- and runtime-library-agnostic, providing flexibility while fully supporting all of Fortran's parallel features. the Parallel Runtime Interface for Fortran (PRIF) was developed to be portable across shared- and distributed-memory systems, with varying operating systems, toolchains and architectures. It achieves this by defining a set of Fortran procedures corresponding to each of the parallel features defined in the Fortran standard that may be invoked by a Fortran compiler and implemented by a runtime library. PRIF aims to be used as the solution for LLVM Flang to provide parallel Fortran support. this paper also briefly describes our PRIF prototype implementation: Caffeine.
this paper addresses the challenges of optimizing task scheduling for a distributed, task-based execution model in OpenMP for cluster computing environments. Traditional OpenMP implementations are primarily designed f...
详细信息
ISBN:
(纸本)9798350355543
this paper addresses the challenges of optimizing task scheduling for a distributed, task-based execution model in OpenMP for cluster computing environments. Traditional OpenMP implementations are primarily designed for shared-memory parallelism and offer limited control over task scheduling. However, improved scheduling mechanisms are critical to achieving performance and portability in distributed and heterogeneous environments. OpenMP Cluster (OMPC) was introduced to overcome these limitations, extending OpenMP withthe Heterogeneous Earliest Finish Time (HEFT) task scheduling algorithm tailored for large-scale systems. To improve scheduling and enable better system utilization, the runtime system must resolve challenges such as changes in the application balance, amount of parallelism, and varying communication *** work presents three key contributions: first, the refactoring of the OMPC runtime to unify task scheduling across devices and hosts; second, the optimization of the HEFT-based scheduling algorithm to ensure efficient task execution in distributed environments; and third, an extensive evaluation of Work Stealing and HEFT scheduling mechanisms in real-world clusters. While the HEFT implementation in OMPC is not fully optimized, this work provides a significant step toward improving distributed task scheduling in cluster computing, offering insights and incremental advancements that support the development of scalable and high-performance applications. Results show improvements of up to 24% in scheduling time while opening up to more extensions in the scheduling methods.
暂无评论