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

第三十四届中国控制会议

作者： Zou Suli Ma Zhongjing Liu Xiangdong School of Automation Beijing Institute of Technology

ISBN: (纸本)9781467374439

This work focuses on an auction-based scheme that develops a synchronous algorithm for solving resource allocation optimization problems from the perspective of efficiency, i.e. determining an allocation strategy that maximizes the social welfare. These problems are usually computationally and communicatively complex. In view of the competitive fairness with incomplete private information of players under auction games, as well as the incentive compatibility and the existence of efficient Nash Equilibrium（NE） under Vickrey-Clarke-Groves（VCG） mechanisms, we transform the considered resource allocation problems into VCG-style auction-based problems, which enable the derivation of an efficient-simultaneous iteration *** those asynchronous algorithms, simultaneous updating in population size may bring greater challenges in system stability and convergence. In the proposed algorithm in this paper, each player synchronously updates his best response in an alternative feasible set at each iteration under a demand constraint associated with the submitted bid profile in last iteration. This can guarantee the advantage of monotonous increasing of the social welfare, further the convergence of the synchronous ***, the system is shown to converge to the efficient NE, which is demonstrated by the numerical results.

关键词： Resource allocation auction game Nash equilibrium efficiency synchronous algorithm convergence

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of synchronous and Asynchronous algorithms for Wireless Sensor Networks: The Case of Graph Matching

Experimental Evaluation of Synchronous and Asynchronous Algo...

引用

Innovations in Intelligent Systems and Applications Conference (ASYU)

作者： Cabuk, Umut Can Ersin, Ismail Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781728128689

Wireless sensor networks (WSNs) consist of tiny nodes that are capable of sensing the environment and transmitting the sensed data through wireless transceivers. synchronous and asynchronous operations are two communication paradigms, which have different advantages and purposes. A WSN can be modeled as a graph that leads to use graph-theoretic structures such as graph matching, for various applications. A matching in a graph is a set of edges that do not have any common endpoint (node). Backup assignment and clustering are the most well-known applications of graph matching, where nodes incident to edges in a matching are backups of each other. In this paper, a detailed performance evaluation of synchronous and asynchronous operations in terms graph matching is provided. A synchronous and an asynchronous design of the Hoepman's algorithm, whose original was asynchronous, were considered. Extensive transmitted bit, energy and wall clock time measurements of these algorithms are given by comparing them in detail. The tests, which are carried out via TOSSIM simulations, showed that asynchronous operation is considerably faster, on the other side the synchronous algorithm is significantly more energy efficient.

关键词： Distributed Computing Wireless Sensor Networks Asynchronous algorithm synchronous algorithm Graph Matching Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2000年第1期17卷 85-107页

作者： Liu, CS Tseng, CH Natl Chiao Tung Univ Dept Mech Engn Appl Optimum Design Lab Hsinchu 30050 Taiwan

Three parallel space-decomposition minimization (PSDM) algorithms, based on the parallel variable transformation (PVT) and the parallel gradient distribution (PGD) algorithms (O.L. Mangasarian, SIMA Journal on Control and Optimization, vol. 33, no. 6, pp. 1916-1925.), are presented for solving convex or nonconvex unconstrained minimization problems. The PSDM algorithms decompose the variable space into subspaces and distribute these decomposed subproblems among parallel processors. It is shown that if all decomposed subproblems are uncoupled of each other, they can be solved independently. Otherwise, the parallel algorithms presented in this paper can be used. Numerical experiments show that these parallel algorithms can save processor time, particularly for medium and large-scale problems. Up to six parallel processors are connected by Ethernet networks to solve four large-scale minimization problems. The results are compared with those obtained by using sequential algorithms run on a single processor. An application of the PSDM algorithms to the training of multilayer Adaptive Linear Neurons (Madaline) and a new parallel architecture for such parallel training are also presented.

关键词： unconstrained minimization parallel algorithm parallel training synchronous algorithm asynchronous algorithm decomposition method

来源：评论

学校读者我要写书评

暂无评论

Effect of interference-fringe noises in numerical analysis of sinusoidally phase-modulated holographic interferograms: Theoretical investigation

引用

JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS SHORT NOTES & REVIEW PAPERS 2001年第6A期40卷 4223-4227页

作者： Miyazaki, T Toki, M Gotoh, H Kitamura, M Kanazawa Univ Fac Engn Dept Mech Syst Engn Kanazawa Ishikawa 920 Japan

In this paper, we present a numerical analysis of the effect of random noises contained in interferograms of a vibrating object. We theoretically investigated the case where several Bessel-function arguments are used to determine object-vibration phasors. The value of each argument can be calculated from holographic interferograms with phase-modulation phasors of the same magnitude but of different phases. The root-mean-square (rms) error values of object-vibration amplitudes are different for the two algorithms, called synchronous and sum algorithms. At smaller object-vibration amplitudes, values determined by the former have higher accuracies, while for larger amplitudes, those determined by the latter have higher accuracies. Averaging these values by weights, which are the square reciprocals of the respective rms errors gives higher accuracies. The rms error values depend on the phase-modulation magnitude. These values in the cases of the former and latter algorithms are minimum at phase-modulation magnitudes of 0.640 pi and 0, respectively.

关键词： holographic vibration analysis sinusoidally phase-modulated holographic interferometry synchronous algorithm sum algorithm Bessel-function argument interference-fringe noise

来源：评论

学校读者我要写书评

暂无评论

A Communication Efficient ADMM-based Distributed algorithm Using Two-Dimensional Torus Grouping AllReduce

引用

DATA SCIENCE AND ENGINEERING 2023年第1期8卷 61-72页

作者： Wang, Guozheng Lei, Yongmei Zhang, Zeyu Peng, Cunlu Shanghai Univ Sch Comp Engn & Sci 99 Shangda Rd Shanghai 20444 Peoples R China

Large-scale distributed training mainly consists of sub-model parallel training and parameter synchronization. With the expansion of training workers, the efficiency of parameter synchronization will be affected. To tackle this problem, we first propose 2D-TGA, a grouping AllReduce method based on the two-dimensional torus topology. This method synchronizes the model parameters by grouping and makes full use of bandwidth. Secondly, we propose a distributed algorithm, 2D-TGA-ADMM, which combines the 2D-TGA with the alternating direction method of multipliers (ADMM). It focuses on sub-model training and reduces the wait time among workers in the synchronization process. Finally, experimental results on the Tianhe-2 supercomputing platform show that compared with the MPI_Allreduce, the 2D-TGA could shorten the synchronization wait time by 33%.

关键词： ADMM Grouping AllReduce Two-dimensional torus topology synchronous algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hybrid HLA Time Management algorithm Based on Both Conditional and Unconditional Information

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2009年第9期85卷 559-573页

作者： Pan, Ke Turner, Stephen John Cai, Wentong Li, Zengxiang Nanyang Technol Univ Parallel & Distributed Comp Ctr Sch Comp Engn Singapore 639798 Singapore

The High-Level Architecture (HLA), which is the IEEE standard for distributed simulation, defines six service groups. The Time Management (TM) service group ensures a Time-Stamp-Ordered (TSO) message delivery sequence and correct time advancement of each simulation component (federate) in a HLA-based distributed simulation application (federation). To control time advancement of a federation, a distributed TM algorithm requires each regulating federate to periodically propagate its local time information to all constrained federates for their respective calculation of the Greatest Available Logical Time (GALT). The time information propagated is called conditional information or unconditional information depending on whether it can be guaranteed to be true conditionally or unconditionally. A traditional distributed TM algorithm can be either synchronous or asynchronous. In general, a synchronous algorithm utilizes conditional information while an asynchronous algorithm utilizes unconditional information. However, both synchronous and asynchronous algorithms have their own drawbacks and thus cannot be used for all federation scenarios. To resolve the drawback of each algorithm, this paper proposes a hybrid TM algorithm by combining synchronous and asynchronous algorithms. The three algorithms have been incorporated into a Run-Time Infrastructure (RTI) and experimental results show that the hybrid algorithm effectively combines the advantages of both synchronous and asynchronous algorithms. We also compare the proposed hybrid TM algorithm with the TM algorithm implemented in the Federated Simulations Development Kit (FDK), which also uses both conditional and unconditional information. The hybrid TM algorithm is more scalable than FDK's TM algorithm with respect to the total number of federates in a federation, because FDK's TM algorithm has the overhead of redundant GALT calculations.

关键词： distributed simulation high-level architecture time management synchronous algorithm asynchronous algorithm hybrid algorithm conditional information unconditional information

来源：评论

学校读者我要写书评

暂无评论

A Hybrid HLA Time Management algorithm Based on Both Conditional and Unconditional Information 08

A Hybrid HLA Time Management Algorithm Based on Both Conditi...

引用

22nd International Workshop on Principles of Advanced and Distributed Simulation

作者： Pan, Ke Turner, Stephen John Cai, Wentong Li, Zengxiang Nanyang Technol Univ Parallel & Distributed Comp Ctr Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)9780769531595

关键词： distributed simulation high-level architecture time management synchronous algorithm asynchronous algorithm hybrid algorithm conditional information unconditional information

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-518

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-518 by published by

关键词： algorithm byzantine failures lemma lower bound message message links messages mit-lcs-tr-518 nonfaulty nonfaulty process nonfaulty processes omission failures phase process process decides processes running time sends synchronous algorithm time upper bound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：