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

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Xiangzhan Yu Zhaoxin Zhang Dan Liu School of Computer Science and Technology Harbin Institute of Technology IBM China Design Center

Traditional topology partition of parallel network simulation usually uses topology graph partition, that is to induce actual network simulate task to a weighted graph, Then use certain tools to complete the partition of simulation tasks, such as METIS, Chaco;These traditional tools usually perform very good when the simulation environment is of the same structure. However, in the complex physical computing environment, such as a large number of computing nodes whose calculation ability is different, a wide gap on the communication capabilities and so on, the traditional topology partition tools is difficult to achieve efficiency optimal, resulting in computing power a tremendous waste. Therefore, we introduce a Cluster Instructed partitioning algorithm (CIPA), suitable for partitioning simulation tasks for heterogeneous platform. In complex network environment, this method organizes the computing nodes by clustering, and distributes the simulated topology to the computing nodes properly combined with the improved topology graph partition. It can get a balanced partitioning result, and greatly improve the efficiency of the entire system.

关键词： Parallel network simulation Topology graph partition partitioning algorithm Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Task partitioning Optimization algorithm for Energy Saving and Load Balance on NoC-based MPSoCs 16

Task Partitioning Optimization Algorithm for Energy Saving a...

引用

16th International Symposium on Quality Electronic Design (ISQED)

作者： Stefani, Marco P. Webber, Thais Fernandes, Ramon Cataldo, Rodrigo Poehls, Leticia B. Marcon, Cesar PUCRS Pontificia Univ Catolica Rio Grande do Sul BR-90619900 Porto Alegre RS Brazil

ISBN: (纸本)9781479975815

Multiprocessor System-on-Chip (MPSoC) based on Network-on-Chip (NoC) integrates a large amount of Processor Elements (PEs) to fulfill the performance requirements of several applications. These applications are composed of a set of intercommunicating tasks, which are dynamically mapped onto PEs of the target architecture. However, the efficient task-mapping requires some previous steps, among them partitioning, which organizes tasks considering their interaction before applying a mapping process. This paper introduces Partition Reduce (PR) - a task partitioning approach based on the MapReduce algorithm targeting homogeneous NoC based MPSoCs. We analyze the efficiency of PR for energy consumption (EC) minimization and load balance (LB). The results obtained from a set of experiments, with large number of tasks, demonstrate that PR is more effective on processing time and result quality when compared to the classic Simulated Annealing (SA). In addition, PR produces partitions with low energy consumption and rigorous load balance.

关键词： partitioning algorithm homogeneous MPSoC NoC performance evaluation energy efficiency load balance

来源：评论

学校读者我要写书评

暂无评论

ENHANCE: Multilevel Heterogeneous Performance-Aware Re-partitioning algorithm For Microscopic Vehicle Traffic Simulation

引用

ACM Transactions on Modeling and Computer Simulation 1000年

作者： Anibal Siguenza-Torres Alexander Wieder Zhuoxiao Meng Santiago Narvaez Rivas Mingyue Gao Margherita Grossi Xiaorui Du Stefano Bortoli Wentong Cai Alois Knoll Huawei Munich Research Center Munich Germany Informatics Technical University of Munich Department of Informatics Garching Germany Huawei Munich Research Center Munich Germany Nanyang Technological University Singapore Singapore Department of Informatics Informatics Technical University of Munich Garching Germany

Driven by our work on a large-scale distributed microscopic road traffic simulator, we present ENHANCE, a novel re-partitioning approach that allows incorporating fine-grained simulator-specific cost models into the partitioning process to account for the actual performance characteristics of the *** use of explicit cost models enables partitioning for heterogeneous resources, which are a common occurrence in cloud deployments. Importantly, ENHANCE can be used in conjunction with other partitioning approaches by further enhancing partitions according to provided cost models. We demonstrate the benefits of our approach in an experimental evaluation showing performance improvements of up to 29% against METIS under heterogeneous conditions. Taking a different perspective, the partitioning produced by ENHANCE can provide similar performance as METIS, but using up to 20% fewer resources.

关键词： Microscopic Traffic Simulation partitioning algorithm Road network partitioning Agent-Based Simulation

来源：评论

学校读者我要写书评

暂无评论

A partitioning reduced order IG-SBFEM to solve elastic/viscoelastic problems with cyclic symmetry

引用

ENGINEERING COMPUTATIONS 2025年第4期42卷 1393-1416页

作者： Qian, Cheng He, Yiqian Wang, Xiaoteng Yang, Haitian Dalian Univ Technol Dept Engn Mech State Key Lab Struct Anal Optimizat & CAE Software Dalian Peoples R China

PurposeThis research aims to advance the Isogeometric Scaled Boundary Finite Element Method (IG-SBFEM) by introducing a partitioning approach for solving elastic and viscoelastic problems with cyclic symmetry. The study seeks to mitigate the computational burden associated with eigenvalue problems by proving the block-circulant nature of the system matrices. Through partitioning, the solution scale is reduced, and the study further explores the integration of the Lagrange multiplier scheme and temporally adaptive algorithms (TPAA) to handle complex displacement constraints and viscoelastic properties, ensuring efficient computation even in cyclically symmetric ***/methodology/approachThe methodology centers on the development of a partitioning algorithm integrated into the Isogeometric Scaled Boundary Finite Element Method (IG-SBFEM). By leveraging the block-circulant nature of matrices under cyclic symmetry, the study reduces the solution scale of both eigenvalue and system equations. Displacement constraints are addressed through a Lagrange multiplier scheme. The approach further applies a temporally piecewise adaptive algorithm (TPAA) to convert viscoelastic problems into elastic problems, allowing efficient numerical analysis and computation for cyclically symmetric *** study finds that the partitioning IG-SBFEM efficiently addresses elastic and viscoelastic problems with cyclic symmetry, reducing both the solution scale and computational cost. The block-circulant property of the matrices enables the decomposition of complex equations into smaller sub-problems, improving performance. Additionally, the Lagrange multiplier scheme successfully handles displacement constraints. The temporally piecewise adaptive algorithm (TPAA) further enhances efficiency by transforming viscoelastic problems into elastic equivalents. Numerical results confirm that this approach achieves accurate solutions with reduced computational ***

关键词： IG-SBFEM Reduced order Cyclic symmetry partitioning algorithm Viscoelasticity Lagrange multiplier

来源：评论

学校读者我要写书评

暂无评论

A scaled boundary finite element partitioning based reduced order algorithm for the elastic analysis of cyclically symmetric structures

引用

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 2023年第5期124卷 1146-1167页

作者： Wang, Chongshuai Peng, Ruifei He, Yiqian Yang, Haitian Han, Xu Hebei Univ Technol Sch Elect Engn State Key Lab Reliabil & Intelligence Elect Equipm Tianjin Peoples R China Chinese Acad Sci Shenyang Inst Automat Inst Robot & Intelligent Mfg Key Lab Networked Control Syst Shenyang Peoples R China Dalian Univ Technol Int Res Ctr Computat Mech Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian Peoples R China Dalian Univ Technol Int Res Ctr Computat Mech Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian 116024 Peoples R China Hebei Univ Technol Sch Elect Engn State Key Lab Reliabil & Intelligence Elect Equipm Tianjin 300401 Peoples R China

An efficient reduced order algorithm is proposed for the elastic SBFE analysis for 2-D cyclic symmetric structures with or without a common node. The general stiffness matrices of scaled boundary finite element (SBFE) is proved to be block-circulant, and can be constructed via the basic region, instead of the whole computing domain. Thus, the expense on eigenvalue analysis required in generating stiffness matrix can be significantly reduced, and the solution scale can be reduced by partitioning the system equation into a series of small independent subproblems. Furthermore, the presented algorithm is combined with the Woodbury formula to reduce the computational cost on the analysis of incomplete cyclically symmetric structures, the original system equation is transformed into the equations with block-circulant coefficient matrices, which is efficiently solved by partitioning algorithm. Four numerical examples are provided to demonstrate the effectiveness and advantages of the proposed approach.

关键词： computational cost cyclically symmetric partitioning algorithm SBFE woodbury formula

来源：评论

学校读者我要写书评

暂无评论

A novel Raft consensus algorithm combining comprehensive evaluation partitioning and Byzantine fault tolerance

引用

JOURNAL OF SUPERCOMPUTING 2024年第18期80卷 26363-26393页

作者： Deng, Xiaohong Yu, Zhiwei Xiong, Weizhi Li, Kangting Liu, Huiwen Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou 341000 Jiangxi Peoples R China Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou 341000 Jiangxi Peoples R China Ganzhou Cloud Comp & Big Data Key Lab Ganzhou 341000 Jiangxi Peoples R China

Currently, Raft, as an mainstream consensus mechanism, has received widespread attention. Partition consensus can reduce the number of nodes involved in a single consensus and improve consensus efficiency. However, existing algorithms suffer from unreasonable partitioning and intolerance of Byzantine nodes. To address these problems, this paper proposes a novel Raft consensus algorithm combining comprehensive evaluation partitioning and Byzantine fault tolerance, CB-Raft. First, a comprehensive evaluation of nodes is conducted from the perspectives of consensus behavior and location, and the nodes are evenly divided based on the parity of the comprehensive ranking. Second, the leader is selected from the nodes with the top rankings in the comprehensive evaluation, and the nodes communicate with each other based on BLS signatures. Finally, a fast response mechanism based on cross-partition leader-follower communication is proposed to avoid the continued evil behavior of the leader, and a pipeline mechanism based on changeable signature thresholds is proposed to solve consensus blocking. The experimental results show that compared with the existing partitioning methods, the proposed partitioning scheme has significant advantages in terms of consensus latency, throughput, and the probability of partition success. Compared with the similar Raft algorithms, CB-Raft has high consensus performance and good resistance to Byzantine nodes.

关键词： Blockchain Consensus mechanism partitioning algorithm Byzantine fault tolerance Raft

来源：评论

学校读者我要写书评

暂无评论

An efficient profile-based algorithm for scratchpad memory partitioning

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2005年第11期24卷 1660-1676页

作者： Angiolini, F Benini, L Caprara, A Univ Bologna Dipartimento Elettron Informat & Sistemist I-40136 Bologna Italy

Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption, and die area. The main challenge in SPM design is to optimally map memory locations to scratchpad locations. This paper describes an algorithm to solve such a mapping problem by means of dynamic programming applied to a synthesizable hardware architecture. The algorithm works by mapping segments of external memory to physically partitioned banks of an on-chip SPM;this architecture provides significant energy savings. The algorithm does not require any user-set bound on the number of partitions and takes into account partitioning overhead. Improving on previous solutions, execution time is polynomial in the number of memory locations, even in the most general solving policy. This has the major practical advantage of allowing an arbitrary number of scratchpad segments, something that was impossible with previous methods, whose running time is exponential to this number. Strategies to optimize memory requirements and speed of the algorithm are exploited. Additionally, we integrate this algorithm in a complete and automated design, simulation, and synthesis flow.

关键词： design automation dynamic programming embedded design memory hierarchy partitioning algorithm power saving scratchpad memory (SPM)

来源：评论

学校读者我要写书评

暂无评论

AN algorithm FOR THE partitioning OF LOGIC-CIRCUITS

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1984年第4期131卷 113-118页

作者： ROBERTS, MW LALA, PK Department of Computer Science University of York York UK

The exhaustive testing of today's digital circuits is not possible, owing to the vast test sequences which would have to be applied. Breaking down the circuit into manageable subcircuits (partitioning) makes exhaustive testing practicable. partitioning has previously been done by the designer of the circuit in rather an ad hoc manner. The paper describes an algorithm which can be used to find the partitioning points in a circuit. The algorithm is illustrated for circuits containing reconvergent and nonreconvergent fan-outs.

关键词： test sequences Logic circuits logic testing nonreconvergent fan-outs Logic design methods logic circuits digital circuits reconvergent fan-outs partitioning algorithm exhaustive testing

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for solution of a combinatory set partitioning problem

引用

JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS 2016年第6期61卷 705-708页

作者： Lyubetsky, V. A. Seliverstov, A. V. Russian Acad Sci Inst Informat Transmiss Problems Kharkevich Inst Bolshoi Karetnyi Per 19Str 1 Moscow 127051 Russia

A novel efficient algorithm for solution of the problem of equal partitioning of a set with predefined weights of elements is proposed. The algorithm is based on calculation of a linear group preserving an invariant: the set of zeros of a cubic form. algorithms for solution of related problems, including the problem of the search for the second solution if the first solution is known, are discussed.

关键词： partitioning algorithm cubic form computational complexity

来源：评论

学校读者我要写书评

暂无评论

A Tabu-Based partitioning and Layer Assignment algorithm for 3-D FPGAs

引用

IEEE EMBEDDED SYSTEMS LETTERS 2011年第3期3卷 97-100页

作者： Siozios, Kostas Soudris, Dimitrios Natl Tech Univ Athens Sch Elect & Comp Engn Athens Greece

Integrating more functionality in a smaller form factor with higher performance and lower power consumption is pushing semiconductor technology scaling to its limits. Three-dimensional (3-D) chip stacking is touted as the silver bullet technology that can keep Moore's momentum and fuel the next wave of consumer electronics products. This letter introduces a TSV-aware partitioning algorithm that enables higher performance for application implementation onto 3-D field-programmable gate arrays (FPGAs). Unlike other algorithms that minimize the number of connections among layers, our solution leads to a more efficient utilization of the available (fabricated) interlayer connectivity. Experimental results show average reductions in delay and power consumption, as compared to similar 3-D computer-aided design (CAD) tools, about 28% and 26%, respectively.

关键词： Computer-aided design (CAD) tool field-programmable gate array (FPGA) partitioning algorithm three-dimensional (3-D) architectures

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：