標題: Titlebook: Algorithms and Architectures for Parallel Processing; 23rd International C Zahir Tari,Keqiu Li,Hongyi Wu Conference proceedings 2024 The Ed [打印本頁] 作者: mountebank 時間: 2025-3-21 17:16
書目名稱Algorithms and Architectures for Parallel Processing影響因子(影響力)
書目名稱Algorithms and Architectures for Parallel Processing影響因子(影響力)學科排名
書目名稱Algorithms and Architectures for Parallel Processing網絡公開度
書目名稱Algorithms and Architectures for Parallel Processing網絡公開度學科排名
書目名稱Algorithms and Architectures for Parallel Processing被引頻次
書目名稱Algorithms and Architectures for Parallel Processing被引頻次學科排名
書目名稱Algorithms and Architectures for Parallel Processing年度引用
書目名稱Algorithms and Architectures for Parallel Processing年度引用學科排名
書目名稱Algorithms and Architectures for Parallel Processing讀者反饋
書目名稱Algorithms and Architectures for Parallel Processing讀者反饋學科排名
作者: 生銹 時間: 2025-3-21 21:58
https://doi.org/10.1007/978-3-658-06141-8gation safety. The experimental results show that, using the method proposed in this paper, USV can reach the target in an environment with moving obstacles with high probability (about 99.4%), and compared to traditional APF algorithm, our method can reduce collision probability by 71% with almost 作者: Defiance 時間: 2025-3-22 01:29
Der Holocaust als Forschungsgegenstand,ented its parallel versions using Ray and MPI, respectively. Furthermore, we selected IMOS as the Spark version of minimap2. The experiments involved six real datasets and one simulated dataset to evaluate and compare speedup, efficiency, throughput, scalability, peak memory, latency, and load balan作者: 和平主義 時間: 2025-3-22 04:36
https://doi.org/10.1007/978-3-658-06141-8the size of the RTT. The experimental results show that the BBR algorithm prefers long RTT flows. In contrast, the BBR-O algorithm can effectively reduce the goodput difference between flows with different RTT sizes, increasing the values of inflight and sendrate for short RTT flows. The BBR-O algor作者: annexation 時間: 2025-3-22 12:33
https://doi.org/10.1007/978-3-658-06141-8on of all replicas, thus reducing the leader’s network overhead. To avoid the increase in communication steps, the additional actions brought by the block shards broadcast are integrated into different consensus phases. Meanwhile, we propose a pipelined version of Segmenta, which further optimizes t作者: 合同 時間: 2025-3-22 13:41 作者: 肌肉 時間: 2025-3-22 19:25 作者: 拘留 時間: 2025-3-23 00:05
Das Rohholz und seine Zurichtung,are used to test the proposed approach. The experimental results show that our proposed method can improve the recall and accuracy of the top 10% of key node classes by more than 10%, compared with the current work and three graph neural network methods.作者: flourish 時間: 2025-3-23 01:43 作者: recession 時間: 2025-3-23 08:38 作者: giggle 時間: 2025-3-23 12:58
Handbibliothek für Bauingenieurering verifiable integrity of query results. Furthermore, we construct an index structure based on B+ tree and Merkle tree to enhance the system’s availability and query efficiency. Our experimental results demonstrate that our scheme not only has excellent performance in terms of the cost of verific作者: forebear 時間: 2025-3-23 16:21 作者: HALO 時間: 2025-3-23 21:09
Die Grundlagen der Festigkeitsberechnung, load balancing mechanism called DRLB. Specifically, DRLB differentiates heterogeneous traffic by using Deep Reinforcement Learning (DRL) in conjunction with the Distributed Distributional Deterministic Policy Gradients (D4PG) algorithm to make the optimal (re)routing for long flows while adopting t作者: Habituate 時間: 2025-3-24 02:06
Die Grundlagen der Festigkeitsberechnung,n Mininet simulation show that RACO effectively increases the throughput of long flows and reduces the average flow completion time (FCT) of short flows by up to 42% and 61%, respectively, compared with the state-of-the-art load balancing mechanisms.作者: 乳白光 時間: 2025-3-24 04:29
,Modelle von einfachen Werkstücken,e significantly by reducing latency and increasing throughput in stable network conditions. For example, HAECN effectively improves throughput by up to 47%, 34%, 32% and 24% over DCQCN, TIMELY, HPCC and ACC, respectively.作者: 鉗子 時間: 2025-3-24 06:37
,Addressing Coupled Constrained Reinforcement Learning via?Interative Iteration Design,a balancing loss for self-coupled actions, which enables the policy to pursue high task reward while complying with the objective constraints via the balancing feedback from the environment. Additionally, we conceive a notion of coupling compactibility to guide the decoupling of high-dimensional cou作者: 財主 時間: 2025-3-24 12:51 作者: precede 時間: 2025-3-24 18:46
,Performance Evaluation of?Spark, Ray and?MPI: A Case Study on?Long Read Alignment Algorithm,ented its parallel versions using Ray and MPI, respectively. Furthermore, we selected IMOS as the Spark version of minimap2. The experiments involved six real datasets and one simulated dataset to evaluate and compare speedup, efficiency, throughput, scalability, peak memory, latency, and load balan作者: Anal-Canal 時間: 2025-3-24 21:33
,Fairness Analysis and?Optimization of?BBR Congestion Control Algorithm,the size of the RTT. The experimental results show that the BBR algorithm prefers long RTT flows. In contrast, the BBR-O algorithm can effectively reduce the goodput difference between flows with different RTT sizes, increasing the values of inflight and sendrate for short RTT flows. The BBR-O algor作者: 脫水 時間: 2025-3-25 02:24
,Segmenta: Pipelined BFT Consensus with?Slicing Broadcast,on of all replicas, thus reducing the leader’s network overhead. To avoid the increase in communication steps, the additional actions brought by the block shards broadcast are integrated into different consensus phases. Meanwhile, we propose a pipelined version of Segmenta, which further optimizes t作者: 不遵守 時間: 2025-3-25 03:55
,Approximate Multicast Coflow Scheduling in?Reconfigurable Data Center Networks,d to have an approximate ratio of at most ., where . represents the number of optical circuit switches. Through extensive simulations, it is shown that the proposed algorithm can achieve high performance compared to state-of-the-art methods.作者: crutch 時間: 2025-3-25 07:44 作者: 變形 時間: 2025-3-25 14:14
Graph Neural Network for Critical Class Identification in Software System,are used to test the proposed approach. The experimental results show that our proposed method can improve the recall and accuracy of the top 10% of key node classes by more than 10%, compared with the current work and three graph neural network methods.作者: 縫紉 時間: 2025-3-25 18:06
,Spatio-Temporal Fusion Based Low-Loss Video Compression Algorithm for?UAVs with?Limited Processing ps the video content from a temporal perspective by identifying inter-frame redundancy. The second module compresses the video content from a spatial perspective by examining regions of interest (RoIs) within each frame and utilizing background filtering to analyze intra-frame encoding. This lightwe作者: 有害 時間: 2025-3-25 21:48
,CRAFT: Common Router Architecture for?Throughput Optimization,ut optimization and realizes a common NoC router architecture for different scenario requirements (CRAFT router). Firstly, we improve the top boundary of the router throughput with the fully-connected crossbar switch, which is an expensive solution for high throughput. Secondly, we use a method simi作者: 浪蕩子 時間: 2025-3-26 00:32
A Cross-Chain System Supports Verifiable Complete Data Provenance Queries,ring verifiable integrity of query results. Furthermore, we construct an index structure based on B+ tree and Merkle tree to enhance the system’s availability and query efficiency. Our experimental results demonstrate that our scheme not only has excellent performance in terms of the cost of verific作者: Coma704 時間: 2025-3-26 06:06 作者: SLUMP 時間: 2025-3-26 12:06 作者: ANNUL 時間: 2025-3-26 15:51
,Adaptive Routing for?Datacenter Networks Using Ant Colony Optimization,n Mininet simulation show that RACO effectively increases the throughput of long flows and reduces the average flow completion time (FCT) of short flows by up to 42% and 61%, respectively, compared with the state-of-the-art load balancing mechanisms.作者: aerobic 時間: 2025-3-26 19:43
,HAECN: Hierarchical Automatic ECN Tuning with?Ultra-Low Overhead in?Datacenter Networks,e significantly by reducing latency and increasing throughput in stable network conditions. For example, HAECN effectively improves throughput by up to 47%, 34%, 32% and 24% over DCQCN, TIMELY, HPCC and ACC, respectively.作者: Latency 時間: 2025-3-27 00:47 作者: Gyrate 時間: 2025-3-27 04:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153086.jpg作者: Esalate 時間: 2025-3-27 08:43 作者: Salivary-Gland 時間: 2025-3-27 13:02 作者: 過時 時間: 2025-3-27 16:38
https://doi.org/10.1007/978-3-658-06141-8utonomy. However, using global path planning alone cannot avoid moving obstacles, while using local path planning alone may lead to falling into local minima and fail to reach the target. Therefore, this paper proposed the Dynamic Target Artificial Potential Field (DTAPF) algorithm which use a dynam作者: ERUPT 時間: 2025-3-27 20:08 作者: Uncultured 時間: 2025-3-28 00:33
Der Holocaust als Forschungsgegenstand,ces, traditional serial frameworks are no longer efficient in processing such massive data. Furthermore, as Moore’s Law gradually loses its effect, improving program performance from the hardware level becomes increasingly challenging. Consequently, numerous parallel frameworks with distinct feature作者: AV-node 時間: 2025-3-28 03:44
https://doi.org/10.1007/978-3-658-06141-8 performance. Bottleneck bandwidth and round-trip time (BBR) is a new congestion control algorithm, it can improve the efficiency and stability of data transmission, thereby enhancing the overall performance of distributed computing. It aims to improve the performance of traditional Transmission Con作者: miniature 時間: 2025-3-28 08:14 作者: 偏離 時間: 2025-3-28 11:29
https://doi.org/10.1007/978-3-658-06141-8vailable bandwidth will directly hurt system performance, especially in leader-based protocols where the leader carries the main communication overhead and becomes a bottleneck. Current approaches reduce the load on the leader by replacing its original star topology communication model with a tree. 作者: Valves 時間: 2025-3-28 15:49
https://doi.org/10.1007/978-3-658-06141-8er from high computational complexity and inability to directly handle values of large domain size when synthesizing high-dimensional data. To mitigate this gap, we propose synthetic data generation for differential privacy using maximum weight matching (DPMWM), a method for automatically synthesizi作者: Middle-Ear 時間: 2025-3-28 18:54
Die Grundlagen der Festigkeitsberechnung,a center networks. This paper investigates the problem of minimizing the completion time of multicast coflow in optical circuit switches (OCS)-based data center networks. The existing works either only focused on multicast coflow scheduling or focused solely on circuit scheduling in OCS-based networ作者: Juvenile 時間: 2025-3-29 01:38
https://doi.org/10.1007/978-3-662-26436-2ng architecture for specific domains is seen as one way to meet this challenge, and Ising architecture is one of them, which is mainly used to solve combinatorial optimization problems efficiently. We propose a DRAM-based annealing system (DAS) to realize Ising architecture based on DRAM. The Ising 作者: Additive 時間: 2025-3-29 03:45 作者: debacle 時間: 2025-3-29 07:20 作者: 使成波狀 時間: 2025-3-29 15:14
Erratum to: Die Tragwerke im allgemeinen,The most critical challenge of this solution is to design a common efficient NoC with ultra-high throughput and low-cost routers to meet the communication characteristics of varied applications. Usually, NoC can not achieve both the gains from high throughput and low cost because high-throughput rou作者: 甜食 時間: 2025-3-29 18:29
Handbibliothek für Bauingenieurelications. To overcome this challenge, high scalability cross-chain technologies have become crucial for implementing blockchain applications. While existing cross-chain technologies focus on implementing cross-chain logic, ignoring the issue of incomplete results that may arise when querying data p作者: discord 時間: 2025-3-29 22:57 作者: 不容置疑 時間: 2025-3-30 01:44 作者: Apogee 時間: 2025-3-30 04:39
Die Grundlagen der Festigkeitsberechnung,oposed to make full use of multiple parallel paths between end-hosts. Faced with a large number of heterogeneous flows, existing load balancing schemes cannot work well and cause performance degradation, such as latency-sensitive short flows experiencing large tail delay and severe link bandwidth wa作者: palliate 時間: 2025-3-30 09:11
Das Rohholz und seine Zurichtung,ature, the quality of the clustering results needed to be evaluated. In this paper, the . (midpoint-involved distance) based on the midpoint of centers between two clusters is firstly defined to measure the inter-cluster separation. Then, the MPC (. based clustering validity index), a novel internal作者: Initiative 時間: 2025-3-30 13:44 作者: Hemiplegia 時間: 2025-3-30 19:53 作者: 捏造 時間: 2025-3-30 23:03 作者: 使糾纏 時間: 2025-3-31 04:51 作者: 使人煩燥 時間: 2025-3-31 08:11 作者: chandel 時間: 2025-3-31 11:41
,Node-Disjoint Paths in?Balanced Hypercubes with?Application to?Fault-Tolerant Routing,great impact on the performance and reliability of the systems. The balanced hypercube, designed for fault tolerance, is a variant of the hypercube with desirable properties of strong connectivity, regularity, and symmetry. Over the past decade, the node-disjoint paths problem has received much atte作者: infatuation 時間: 2025-3-31 15:05
,Performance Evaluation of?Spark, Ray and?MPI: A Case Study on?Long Read Alignment Algorithm,ces, traditional serial frameworks are no longer efficient in processing such massive data. Furthermore, as Moore’s Law gradually loses its effect, improving program performance from the hardware level becomes increasingly challenging. Consequently, numerous parallel frameworks with distinct feature作者: 成績上升 時間: 2025-3-31 19:35 作者: Substitution 時間: 2025-4-1 00:01
,Accelerating QUIC with?AF_XDP,avoid the overhead of the kernel’s network stack and therefore improve the performance greatly, we choose AF_XDP, a compatible kernel bypass technique to improve the performance of QUIC. We present XSKConn, a Golang package that implements UDP connection based on AF_XDP and we integrate it into quic作者: 泄露 時間: 2025-4-1 03:27 作者: TAP 時間: 2025-4-1 09:42 作者: stressors 時間: 2025-4-1 12:36
,Approximate Multicast Coflow Scheduling in?Reconfigurable Data Center Networks,a center networks. This paper investigates the problem of minimizing the completion time of multicast coflow in optical circuit switches (OCS)-based data center networks. The existing works either only focused on multicast coflow scheduling or focused solely on circuit scheduling in OCS-based networ作者: 神秘 時間: 2025-4-1 14:41 作者: 野蠻 時間: 2025-4-1 21:18
Graph Neural Network for Critical Class Identification in Software System,systems based on a graph neural network is proposed to identify these key codes in software systems effectively. First, a directed weighted class dependency network with classes as nodes and dependencies as edges is constructed based on the dependency degree in the software system and the dependency作者: Nonporous 時間: 2025-4-1 23:22
,Spatio-Temporal Fusion Based Low-Loss Video Compression Algorithm for?UAVs with?Limited Processing AVs) provide a promising way for real-time crowd surveillance due to their convenient deployment and flexible mobility. However, the limited wireless transmission bandwidth and the large capacity of high-definition video pose great challenges to the real-time transmission of UAV-captured videos. Alt
