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

A Multiway Design-driven partitioning algorithm for Distributed Verilog Simulation

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2009年第4期85卷 257-270页

作者： Li, Lijun Tropper, Carl McGill Univ Sch Comp Sci Montreal PQ Canada

Many partitioning algorithms have been proposed for distributed Very-large-scale integration (VLSI) simulation. Typically, they make use of a gate level netlist and attempt to achieve a minimal cutsize subject to a load balance constraint. The algorithm executes on a hypergraph which represents the netlist. We propose a design-driven iterative partitioning algorithm for Verilog based on module instances instead of gates. We do this in order to take advantage of the design hierarchy information contained in the modules and their instances. A Verilog instance represents one vertex in the circuit hypergraph. The vertex can be flattened into multiple vertices in the event that a load balance is not achieved by instance-based partitioning. In this case, the algorithm flattens the largest instance and moves gates between the partitions in order to improve the load balance. Our experiments show that this partitioning algorithm produces a smaller cutsize than is produced by hMetis on a gate-level netlist. It produces better speedup for the simulation because it takes advantage of the design hierarchy.

关键词： Parallel simulation VLSI distributed gate level verilog simulation partitioning algorithm load balance cutsize

来源：评论

学校读者我要写书评

暂无评论

Study and Realization on the partitioning algorithm of Parallel Subnet of Petri Net System 14

Study and Realization on the Partitioning Algorithm of Paral...

引用

International Symposium Distributed Computing and Applications Business Engineering and Science

作者： Li, Wen-jing Zhang, Xiang-bo Bi, Yingzhou Wang, Xuan Guangxi Teachers Educ Univ Sch Logist Management & Engn Nanning Peoples R China Guangxi Teachers Educ Univ Coll Comp & Informat Engn Nanning Peoples R China

ISBN: (纸本)9781467365932

In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariantbased Petri net model partitioning and subnet division conditions and parallelizing analysis;put forward the extended theorem and validation of partitioning condition of parallel subnet;then, provide the formalization of subnet division and the solving process of place invariant and place-invariantbased partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.

关键词： Petri net place invariant parallel subnet partitioning conditions partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

A Data Gathering Scheme for WSN/WSAN Based on partitioning algorithm and Mobile Sinks

A Data Gathering Scheme for WSN/WSAN Based on Partitioning A...

引用

15th IEEE International Conference on High Performance Computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Zhang, Xiangli Bao, Hanrong Yan, Kun Zhang, Hongmei Ye, Jin Guilin Univ Elect Technol Sch Informat & Commun Guilin Peoples R China Guangxi Univ Comp & Elect Informat Coll Nanning 530004 Peoples R China

ISBN: (纸本)9780769550886

Gathering data from sensors, mobile sink has been adopted in wireless sensor networks (WSN) and wireless sensor and actor network(WSAN) to achieve higher efficiency. With the help of mobile sink, sensors could attain a much longer lifetime than the past. However, mobile sink introduces new challenges such as large data gathering latency to WSN/WSAN. A lot of research efforts have been devoted to reduce the data gathering time. Cooperated with a novel partition algorithm, a concise and efficient data gathering scheme is proposed here. A given area can be divided into several zones with balanced data gathering latency. By modeling the partitioning problem as a Traveling Salesman Problem (TSP), an algorithm is designed to balance the data gathering latency among all the zones. Then mobile sinks are assigned to these zones separately. The data could be gathered by these mobile sinks parallel thereupon. Extensive simulations are carried out to evaluate our proposed data gathering scheme. Different distribution patterns are considered. Effectiveness of our proposed data gathering scheme is proved by the simulation results.

关键词： WSN/WSAN mobile sinks partitioning algorithm data gathering

来源：评论

学校读者我要写书评

暂无评论

A partitioning algorithm for Solving Capacitated Arc Routing Problem in Ways of Ranking First Cutting Second 8th

A Partitioning Algorithm for Solving Capacitated Arc Routing...

引用

8th International Conference on Knowledge Science, Engineering and Management (KSEM)

作者： Zhang, Wei Xing, Lining Xi, Ting He, Lei Liu, Jinyuan Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783319251592;9783319251585

Capacitated Arc Routing Problem (CARP) is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second (RFCS) could be used. This research proposed a novel partitioning algorithm - the Multi-Label algorithm which obtained better TSP paths meeting the backpack limit on the basis of a complete TSP return. In addition, by experimental verification on questions in the standard question database, the experimental results showed that compared with general partitioning algorithms, for the same complete TSP return, many TSP paths with the shortest total length could be obtained by the Multi-Label algorithm.

关键词： partitioning algorithm Capacitated arc routing problem Ranking first cutting second

来源：评论

学校读者我要写书评

暂无评论

Double Table Switch: An Efficient partitioning algorithm for Bottom-Up Computation of Data Cubes

Double Table Switch: An Efficient Partitioning Algorithm for...

引用

6th International Conference on Advanced Data Mining and Applications (ADMA)

作者： You, Jinguo Jia, Lianying Hu, Jianhua Huang, Qingsong Xi, Jianqing Kunming Univ Sci & Technol Sch Informat Engn & Automat Kunming 650051 Yunnan Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510000 Guangdong Peoples R China

ISBN: (纸本)9783642173127

Bottom-up computation of data cubes is an efficient approach which is adopted and developed by many other cubing algorithms such as H-Cubing, Quotient Cube and Closed Cube, etc. The main cost of bottom-up computation is recursively sorting and partitioning the base table in a worse way where large amount of auxiliary spaces are frequently allocated and released. This paper proposed a new partitioning algorithm, called Double Table Switch (DTS). It sets up two table spaces in the memory at the beginning, where the partitioned results in one table are copied into another table alternatively during the bottom-up computation. Thus DTS avoids the costly space management and achieves the constant memory usage. Further, we improve the DTS algorithm by adjusting the dimension order, etc. The experimental results demonstrate the efficiency of DTS.

关键词： Data warehouse Data cube Bottom-up computation partitioning algorithm Double Table Switch

来源：评论

学校读者我要写书评

暂无评论

partitioning algorithm for PON network design

Partitioning algorithm for PON network design

引用

2010 The 3rd International Conference on Computational Intelligence and Industrial Application (PACIIA2010)

作者： Weicheng Xiong School of Computer Wuhan University Wuhan,China Chanle Wu and Libing Wu School of Computer Wuhan University Wuhan,China Xiaojun Guo,Yibo Chen and Ming Xie School of Computer Wuhan University Wuhan,China

Optical access technology has quickly got a worldwide development. Currently,the deployment of equipment and fiber lines in the optical access network need professionals to design. But,because the lack of a unified standard,it is difficult to make the network reasonable. By analyzing the PON architecture model,this article talks about an improved partitioning algorithm for PON network design. By entering some parameters,it can automatically calculate the number and configuration of OLT,which can help to optimize the network layout,and save the network construction costs.

关键词： PON Network design partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

A Boundary partitioning algorithm for Geometrical Product Deviation Evaluation

引用

Procedia CIRP 2024年 129卷 115-120页

作者： Fan Liu Yanlong Cao Jia Luo Junnan Zhi Jiangxin Yang Key Laboratory of Advanced Manufacturing Technology of Zhejiang Province Zhejiang University Hangzhou 310027 China State Key Laboratory of Fluid Power and Mechatronic Systems School of Mechanical Engineering Zhejiang University Hangzhou 310027 China

partitioning is essential in the smart verification process when measurements are conducted using modern instruments, such as a CT scanner. Numerous partitioning methods are commonly designed for scenes rather than for geometrical products. This paper introduces a novel method to partition geometrical elements from the measured data of the workpiece containing geometrical deviation and refines the points attribution problem at part boundaries. Firstly, a partition algorithm based on the coarse boundaries is presented. Then, a boundary refinement process is proposed to improve the partition result. A measured data set is taken as an example to verify the feasibility of the proposed method.

关键词： partitioning algorithm Deviation evaluation Tolerancing ISO GPS

来源：评论

学校读者我要写书评

暂无评论

An Efficient partitioning algorithm Based on Hypergraph for 3D Network-On-Chip Architecture Floorplanning

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2019年第5期28卷

作者： Tan, Junyan Cai, Chunhua Hohai Univ Coll IOT Changzhou 213022 Peoples R China

Network-on-Chip (NoC) supplies a scalable and fast interconnect for the communication between the different IP cores in the System-on-Chip (SoC). With the growing complexity in consumer embedded systems, the emerging SoC architectures integrate more and more components for the different signal processing tasks. Two dimensional Network-on-Chip (2D NoC) becomes a bottleneck for the development of the SoC architecture because of its limitation on the area of chip and the long latency. In this case, SoC research is forcing on the exploration of three dimensions (3D) technology for developing the next generation of large SoC which integrates three dimensional Network-on-Chip (3D NoC) for the communication architecture. 3D design technology resolves the vertical inter-layer connection issue by Through-Silicon Vias (TSVs). However, TSVs occupy significant silicon area which limits the inter-layer links of the 3D NoC. Therefore, the task partitioning on 3D NoC must be judicious in large SoC design. In this paper, we propose an efficient layer-aware partitioning algorithm based on hypergraph (named ELAP-NoC) for the task partitioning with TSV minimization for 3D NoC architecture floorplanning. ELAP-NoC contains divergence stage and convergence stage. ELAP-NoC supplies firstly a multi-way min-cut partitioning to gradually divide a given design layer by layer in the divergence stage in order to get an initial solution, then this solution is refined in convergence stage. The experiments show that ELAP-NoC performs a better capacity in the partitioning of the different numbers of cores which supplies the first step for the 3D NoC floorplanning.

关键词： 3D NoC partitioning algorithm TSV hypergraph

来源：评论

学校读者我要写书评

暂无评论

Study and Realization on the partitioning algorithm of Parallel Subnet of Petri Net System

Study and Realization on the Partitioning Algorithm of Paral...

引用

第十四届分布式计算及其应用国际学术研讨会

作者： Wen-jing LI Xiang-bo Zhang Yingzhou BI Xuan Wang School of Logistics Management and Engineering Guangxi Teachers Education University College of Computer and Information Engineering Guangxi Teachers Education University

In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariant-based Petri net model partitioning and subnet division conditions and parallelizing analysis;put forward the extended theorem and validation of partitioning condition of parallel subnet;then, provide the formalization of subnet division and the solving process of place invariant and place-invariantbased partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.

关键词： Petri net place invariant parallel subnet partitioning conditions partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

Study and Realization on the partitioning algorithm of Parallel Subnet of Petri Net System

Study and Realization on the Partitioning Algorithm of Paral...

引用

The 14th International Symposium on Distributed Computing and Applications to Business,Engineering and Science(DCABES 2015)(第十四届分布式计算及其应用国际学术研讨会)

作者： Wen-jing LI Yingzhou BI Xiang-bo Zhang Xuan Wang School of Logistics Management and Engineering Guangxi Teachers Education University Nanning China College of Computer and Information Engineering Guangxi Teachers Education University Nanning China

In order to solve the problem about the partition of Petri net model and subnet division,realize the concurrent execution or simulation runs of Petri net system,the partitioning algorithm of parallel subnet of Petri net is ***,as Petri net system has the characteristics of synchronization and concurrence,provide the place-invariantbased Petri net model partitioning and subnet division conditions and parallelizing analysis:put forward the extended theorem and validation of partitioning condition of parallel subnet:then,provide the formalization of subnet division and the solving process of place invariant and place-invariantbased partitioning algorithm of parallel subnet of Petri *** experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.

关键词： Petri net place invariant parallel subnet partitioning conditions partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：