Algorithms and Architectures for Parallel Processing : 23rd International Conference, ICA3PP 2023, Tianjin, China, October 20-22, 2023, Proceedings, Part III

• Autore: Tari Zahir
• Pubblicazione: Singapore : , : Springer, , 2024; ©2024
• Edizione: 1st ed.
• Descrizione fisica: 1 online resource (524 pages)
• Altri autori: LiKeqiu WuHongyi
• Nota di contenuto: Intro -- Preface -- Organization -- Contents - Part III -- Addressing Coupled Constrained Reinforcement Learning via Interative Iteration Design -- 1 Introduction -- 2 Preliminaries -- 2.1 Coupled Constrained Markov Decision Process -- 2.2 Policy Gradient -- 3 InIt for Decoupling High-Dimensional Coupled Action Space -- 3.1 InIt Design -- 3.2 InIt-Based Solution -- 3.3 Extension to High-Dimensional Action Space -- 4 Experiments -- 4.1 Experiment Setups -- 4.2 Baselines -- 4.3 Performance Evaluation -- 5 Conclusion and Future Work -- References -- A Path Planning and Obstacle Avoidance Method for USV Based on Dynamic-Target APF Algorithm in Edge -- 1 Introduction -- 2 Related Works -- 3 System Design and Environment Modeling -- 3.1 System Overview -- 3.2 Environment Modeling -- 4 Algorithm Design -- 4.1 Improved A* Algorithm -- 4.2 Improved APF Algorithm -- 4.3 DTAPF Method -- 4.4 Offset Guidance -- 5 Evaluation -- 5.1 Simulation Environment Configurations -- 5.2 Performance of Algorithms -- 5.3 Verification of System Architecture -- 6 Conclusion -- References -- Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing -- 1 Introduction -- 2 Preliminaries -- 3 Node-Disjoint Paths -- 3.1 The Mixed Sequence -- 3.2 Construction of Node-Disjoint Paths -- 4 Simulations and Performance Evaluation -- 5 Conclusion -- References -- Performance Evaluation of Spark, Ray and MPI: A Case Study on Long Read Alignment Algorithm -- 1 Introduction -- 2 Methods -- 2.1 Parallel Algorithm Design -- 2.2 Index Sharing -- 2.3 Sequence Segmentation -- 2.4 Parallel Alignment -- 2.5 Asynchronous Output -- 3 Results -- 3.1 Experimental Setup -- 3.2 Input Data -- 3.3 Results Consistency -- 3.4 Strong Scalability -- 3.5 Weak Scalability and Peak RAM Memory -- 3.6 Efficiency -- 3.7 Throughput -- 3.8 Latency -- 3.9 Load Balance -- 4 Related Work. ; 5 Discussion -- 6 Conclusion -- References -- Fairness Analysis and Optimization of BBR Congestion Control Algorithm -- 1 Introduction -- 2 Related Work -- 3 Problem Analysis -- 3.1 RTT Fairness in BBR Algorithm -- 4 Algorithm Optimization -- 5 Experiment -- 5.1 Experimental Setup -- 5.2 Results on RTT Fairness -- 6 Conclusion -- References -- Accelerating QUIC with AF_XDP -- 1 Introduction -- 2 Background -- 2.1 QUIC Acceleration -- 2.2 Network Stack Optimization -- 2.3 eBPF and AF_XDP -- 2.4 AF_XDP Datapath -- 3 Design and Implementation -- 3.1 Overview -- 3.2 Architecture -- 3.3 Implementation -- 4 Evaluation -- 4.1 Experiment Setup -- 4.2 QUIC Performance -- 4.3 CPU Usage -- 4.4 Network Policy -- 5 Discussion -- 6 Conclusion -- References -- Segmenta: Pipelined BFT Consensus with Slicing Broadcast -- 1 Introduction -- 2 Related Work -- 3 Analysis and Design -- 3.1 Directly Apply RBC Module in Hotstuff -- 3.2 Design to Reduce the Additional Communication Round -- 4 System Model -- 5 The Segmenta Protocol -- 5.1 Segmenta-Specific Data Structures -- 5.2 Segmenta Phases -- 5.3 Safety, Liveness, and Communication Complexity -- 5.4 Echoing Shards Optimistically -- 6 Chained Segmenta Protocol -- 7 Evaluation -- 7.1 Experimental Setup -- 7.2 Prediction Model -- 7.3 Throughput and Latency -- 8 Conclusion -- References -- Synthetic Data Generation for Differential Privacy Using Maximum Weight Matching -- 1 Introduction -- 2 Related Work -- 3 Preliminary -- 3.1 Problem Statement -- 3.2 Differential Privacy -- 4 Our Solution -- 4.1 Construction of Attribute Graph -- 4.2 Marginal Selection -- 4.3 PostProcess -- 4.4 Data Synthesis -- 5 Experiments -- 5.1 Experimental Settings -- 5.2 Experimental Results -- 6 Conclusion -- A Proof of Lemma -- References -- Approximate Multicast Coflow Scheduling in Reconfigurable Data Center Networks -- 1 Introduction. ; 2 Problem Formulation -- 2.1 System Model -- 2.2 Circuit Scheduling Model -- 2.3 Problem Formulation -- 3 The Delay-Efficient Multicast Coflow Scheduling Algorithm -- 3.1 Multicast Coflow Scheduling -- 3.2 Circuit Scheduling -- 3.3 Approximation Ratio Analysis -- 4 Numerical Evaluation -- 4.1 Simulation Settings -- 4.2 Performance Evaluation -- 5 Related Work -- 6 Conclusion -- References -- DAS: A DRAM-Based Annealing System for Solving Large-Scale Combinatorial Optimization Problems -- 1 Introduction -- 2 Background -- 2.1 Ising Model -- 2.2 The Overview of DRAM -- 2.3 In-DRAM Bulk Bitwise Operations -- 3 DAS: Detailed Design -- 3.1 An Overview of DAS -- 3.2 Spin Propagation Between Spin Nodes -- 3.3 Calculation of Local Search Term -- 3.4 Design of Probability Flipping -- 4 Evaluation and Applications -- 4.1 Area Overhead -- 4.2 Application and Analysis -- 5 Conclusion -- References -- Graph Neural Network for Critical Class Identification in Software System -- 1 Summary -- 2 Related Works -- 2.1 Research on the Importance of Nodes in Complex Networks -- 2.2 Research on Key Node Identification in Software Network -- 3 Basic Theory -- 3.1 Node Feature Extraction Based on Direct Extrapolation Graph Neural Network -- 3.2 Node Feature Extraction Based on Inductive Graph Neural Network -- 4 Research methods -- 4.1 Modeling Class dependency network -- 4.2 Network Embedding Learning -- 4.3 Key Class Identification -- 5 Experimental Analysis -- 5.1 Experiment Data -- 5.2 Experiment Setup -- 5.3 Analysis of Experimental Results -- 6 Conclusion -- References -- Spatio-Temporal Fusion Based Low-Loss Video Compression Algorithm for UAVs with Limited Processing Capability -- 1 Introduction -- 2 System Overview -- 3 Algorithm Design -- 3.1 Feature Clustering Based Temporal Video Sampling -- 3.2 Dynamic Encoding Based Spatial Video Sampling -- 4 Evaluation. ; 4.1 Experimental Setup -- 4.2 Experimental Results -- 5 Implementation -- 6 Related Work -- 7 Conclusion -- References -- CRAFT: Common Router Architecture for Throughput Optimization -- 1 Introduction -- 2 Related Work -- 3 The Proposed Viaduct Theory in Throughput Optimization -- 3.1 Viaduct Theory in Throughput Optimization -- 3.2 Comparison of Ring Decouple Theory and Viaduct Theory in Low-Cost Router -- 4 A Common Router Architecture for Throughput Optimization Based on Viaduct Theory -- 4.1 Flow Control Optimization with Viaduct Theory -- 4.2 Pipeline Stage and Latency Optimization -- 4.3 High Throughput Optimization with Viaduct Theory -- 4.4 Low Hardware Cost with Viaduct Theory -- 4.5 Bypass Strategy for Low Workload -- 5 Experiment Results -- 5.1 For Low-Cost Program -- 5.2 For High-Performance Program -- 5.3 Hardware Overhead -- 6 Conclusion -- References -- A Cross-Chain System Supports Verifiable Complete Data Provenance Queries -- 1 Introduction -- 2 Related Work -- 2.1 Query Function -- 2.2 Verifiable Query -- 2.3 Cross-Chain Technology -- 3 Preliminaries -- 3.1 Preliminary Knowledge -- 3.2 System Components -- 4 Solution -- 4.1 Verifiable Complete Data Provenance Query -- 4.2 Efficient Query -- 5 Experiment -- 5.1 Experimental Setup -- 5.2 Results and Discussion -- 6 Conclusion -- References -- Enabling Traffic-Differentiated Load Balancing for Datacenter Networks -- 1 Introduction -- 2 Motivation -- 3 TDLB Design -- 3.1 Design Overview -- 3.2 Design Rationale -- 3.3 Design Detail -- 4 Evaluation -- 4.1 Performce Under Symmetric Topology -- 4.2 Performance Under Asymmetric Topology -- 5 Related Work -- 6 Conclusion -- References -- Deep Reinforcement Learning Based Load Balancing for Heterogeneous Traffic in Datacenter Networks -- 1 Introduction -- 2 Background and Motivation -- 2.1 Background -- 2.2 Motivation -- 3 DRLB Design. ; 3.1 Design Overview -- 3.2 Design Detail -- 4 Experimental Results and Evaluation -- 4.1 Experimental Setup -- 4.2 Evaluation of Experimental Results -- 5 Related Works -- 6 Conclusion -- References -- Adaptive Routing for Datacenter Networks Using Ant Colony Optimization -- 1 Inroduction -- 2 Background and Motivation -- 2.1 Background -- 2.2 Motivation -- 2.3 Summary -- 3 RACO Design -- 3.1 RACO Overview -- 3.2 Statistics Module -- 3.3 Calculation Module -- 3.4 Algorithm Pseudocode -- 4 Performance Evaluation -- 4.1 Experimental Setup -- 4.2 Performance Under Symmetrical Topology -- 4.3 Performance Under Asymmetric Topology -- 5 Related Work -- 6 Conclusion -- References -- MPC: A Novel Internal Clustering Validity Index Based on Midpoint-Involved Distance -- 1 Introduction -- 2 MPdist: A Midpoint-Involved Distance -- 3 MPC: An Internal CVI Based on MPdist -- 3.1 The Definition of MPC -- 3.2 The Analysis of Time Complexity -- 4 Experimental Results -- 4.1 Description of the Test Datasets -- 4.2 Performances of CVIs on Evaluating the Results of the AHC -- 4.3 Performances of CVIs on Evaluating the Results of the K-Means -- 4.4 Performance Evaluation by Real Large-Scale Datasets -- 5 Conclusion and Future Works -- References -- HAECN: Hierarchical Automatic ECN Tuning with Ultra-Low Overhead in Datacenter Networks -- 1 Introduction -- 2 Motivation -- 3 HAECN Design -- 3.1 HAECN Overview -- 3.2 Design Details of HAECN -- 3.3 Reinforcement Learning Agent in HAECN -- 3.4 Learning Algorithm in HAECN -- 4 Implementation -- 5 Evaluation -- 5.1 Performance Under Bursty Networks -- 5.2 Performance Under Gradual Stabilization Network Environments -- 6 Related Work -- 7 Conclusion -- References -- An Android Malware Detection Method Based on Metapath Aggregated Graph Neural Network -- 1 Introduction -- 2 Related Work -- 3 Our Approach. ; 3.1 Feature Engineering.
• Titolo autorizzato: Algorithms and Architectures for Parallel Processing
• ISBN: 981-9707-98-6
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996587860503316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science Series