检索结果-内蒙古大学图书馆

20th European Conference on computer Systems, EuroSys 2025, co-located 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2025

作者： Pan, Lichen Liu, Juncheng Fu, Yongquan Yuan, Jinhui Zhang, Rongkai Li, Pengze Xiao, Zhen School of Computer Science Peking University China OneFlow Research China National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology China

ISBN: (纸本)9798400711961

distributed deep neural network training necessitates efficient GPU collective communications, which are inherently susceptible to deadlocks. GPU collective deadlocks arise easily in distributed deep learning applications when multiple collectives circularly wait for each other. GPU collective deadlocks pose a significant challenge to the correct functioning and efficiency of distributed deep learning, and no general effective solutions are currently available. Only in specific scenarios, ad-hoc methods, making an application invoke collectives in a consistent order across GPUs, can be used to prevent circular collective dependency and deadlocks. This paper presents DFCCL, a novel GPU collective communication library that provides a comprehensive approach for GPU collective deadlock prevention while maintaining high performance. DFCCL achieves preemption for GPU collectives at the bottom library level, effectively preventing deadlocks even if applications cause circular collective dependency. DFCCL ensures high performance with its execution and scheduling methods for collectives. Experiments show that DFCCL effectively prevents GPU collective deadlocks in various situations. Moreover, extensive evaluations demonstrate that DFCCL delivers performance comparable to or superior to NCCL, the state-of-the-art collective communication library highly optimized for NVIDIA GPUs. © 2025 Copyright held by the owner/author(s).

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

k-TEVS: A k-Times E-Voting Scheme on Blockchain With Supervision

引用

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 2326-2337页

作者： Liu, Yang He, Debiao Luo, Min Wang, Lianhai Peng, Cong Wuhan University School of Cyber Science and Engineering Wuhan430072 China Shenzhen Institute of Information Technology Institute of Information Technology Shenzhen518172 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Matrix Elements Technologies Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Shanghai200232 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

Thee-vote is regarded as a waytoexpress the opinion that the voters ask for. Actually, the e-vote could be applied wildly likequestionnaire,***,thecoexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storagecostsforthefieldconsistedofthevotegroupmanager(GM) with its vote assistants (VA). Particularly the k-times anonymous authentication (k-TAA) could also be a practical approach to pre serve voters’ privacy and reduce the computation costs during the ***,thee-voteschemewithpurek-TAAstrategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of k-TAA with the update process for the e-vote on blockchain for supervision (k-TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the k-TEVS framework. Finally, We implement k TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme. © 2004-2012 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

ZeTFRi - A Zero Trust-Based Free Rider Detection Framework for Next Generation Federated Learning Networks

引用

IEEE Journal on Selected Areas in Communications 2025年第6期43卷 1938-1953页

作者： Edirimannage, Shehan Khalil, Ibrahim Elvitigala, Charitha Daluwatta, Wathsara Wijesekera, Primal Zomaya, Albert Y. RMIT University School of Computing Technologies MelbourneVIC3000 Australia International Computer Science Institute University of California BerkeleyCA94704 United States University of Sydney Centre for Distributed and High-Performance Computing SydneyNSW2006 Australia

With the rapid expansion of next-generation networking, Internet of Things (IoT) devices have become central components of federated learning (FL) networks. FL offers a paradigm for distributed training machine learning models while preserving user data privacy. However, existing network security measures often struggle to identify legitimate contributors from opportunistic free riders within these networks. The Free Rider (FR) problem arises when participants seek to benefit from the FL processes without contributing. In particular, free riders are known to exist within or outside of the network, whereas outside free riders can hardly be identified. The Zero Trust model proposes an environment where no entity, including the network itself, is inherently trusted, providing a foundation to counter external threats seeking to exploit the network. This study proposes a novel framework strengthened by the Zero Trust model to identify external free riders in FL networks. Leveraging a Deep Autoencoding Gaussian Mixture Model (DAGMM)-based technique for internal free rider detection, our framework demonstrates superior performance in identifying free riders across various FR scenarios compared to current state-of-the-art solutions. Through our proposed framework and the principles of Zero Trust, we establish a robust security guarantee for FL networks, ensuring the integrity of the learning process. © 1983-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

SPECIAL ISSUE ON parallel ALGORITHMS FOR GEOMETRIC PROBLEMS ON DIGITIZED PICTURES

引用

ALGORITHMICA 1991年第5期6卷 621-623页

作者： DEHNE, F Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING DATA-STRUCTURES ON A HYPERCUBE MULTIPROCESSOR, AND APPLICATIONS IN parallel COMPUTATIONAL GEOMETRY

引用

JOURNAL OF parallel AND distributed computing 1990年第4期8卷 367-375页

作者： DEHNE, F RAUCHAPLIN, A Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6

In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independent search processes on a class of graphs called ordered h -level graphs. We show how this technique can be utilized to implement a segment tree on a hypercube, thereby obtaining O (long 2 n ) time algorithms for solving the next element search problem, the trapezoidal composition problem, and the triangulation problem.

关键词： computer Systems, Digital

来源：评论

学校读者我要写书评

暂无评论

computing THE CONFIGURATION SPACE FOR A ROBOT ON A MESH-OF-PROCESSORS

引用

parallel computing 1989年第2期12卷 221-231页

作者： DEHNE, F HASSENKLOVER, AL SACK, JR Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6

In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to be represented in digitized form by a √ n × √ n nibary image. The algorithm is designed for a Mesh-of-Processors architecture with n processors (using the canonical representation of an image on a processor array) and has an execution time of O(√ n ) which is asymptotically optimal.

关键词： Computational geometry image processing robotics systolic algorithms

来源：评论

学校读者我要写书评

暂无评论

computing THE LARGEST EMPTY RECTANGLE ON ONE-DIMENSIONAL AND 2-DIMENSIONAL PROCESSOR ARRAYS

引用

JOURNAL OF parallel AND distributed computing 1990年第1期9卷 63-68页

作者： DEHNE, F Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6

Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in the Euclidean plane, consider the problem of finding the largest area subrectangle r in R with sides parallel to the coordinate axes that contains no point of S . We present optimal parallel algorithms for solving this problem on one- and two-dimensional arrays of processors.

关键词： computer Programming

来源：评论

学校读者我要写书评

暂无评论

Grid services and service discovery for HLA-based distributed simulation

Grid services and service discovery for HLA-based distribute...

引用

Proceedings - Eighth IEEE International Symposium on distributed Simulation and Real-Time Applications, DS-RT 2004

作者： Zong, Wenbo Wang, Yong Cai, Wentong Turner, Stephen J. Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore 639798

ISBN: (纸本)0769522327

Modelling and simulation permeate all areas of business, science and engineering and increasingly complex simulation systems often require huge computing resources and data sets that are geographically distributed. The widely adopted platform for building distributed simulations is the High Level Architecture (HLA). Deficiencies associated with HLA have been well discussed in the literature. The advent of Grid technology enables the use of distributed computing resources and facilitates the access of geographically distributed data. In this paper, we propose a framework for executing large-scale distributed simulations using Grid services. The framework addresses some of the deficiencies of HLA, including dynamic discovery and resource utilization. End-users can construct large-scale distributed simulations using this framework with ease. © 2004 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

"Gridifying" aerodynamic design problem using gridRPC 2nd

引用

2nd International Workshop on Grid and Cooperative computing, GCC 2003

作者： Ho, Quoc-Thuan Ong, Yew-Soon Cai, Wentong Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University 639798 Singapore

ISBN: (纸本)3540219889

This paper presents a "gridifying" process for aerodynamic wing design as a case study of complex engineering design problems. In order to assist engineers and scientists to solve the problems on the Grid environment effectively, we developed an API based on GridRPC, a Remote Procedure Call standard interface for Grid-enabled applications. In this work, we also provide mechanisms to reduce communication cost and schedule GridRPC requests across multiple clusters on the Grid. These facilities are incorporated in our GridRPC API implementation. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

distributed parallel query processing on networks of workstations 8th

引用

8th International Conference on High Performance computing and Networking, HPCNEurope 2000

作者： Soleimany, Cyrus Dandamudi, Sivarama P. IBM Canada Toronto Canada Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)9783540675532

Network of workstations (NOW) is an attractive alternative to parallel database systems. Here we present a distributed architecture for parallel query processing on networks of workstations. We describe a comprehensive design that synthesizes knowledge from parallel and distributed systems area on scheduling, load sharing and loop scheduling. To study the performance of this architecture, we have implemented the distributed architecture using PVM on a Pentium-based NOW system. Our results show that the distributed architecture achieves good speedups and scaleups. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：