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

Using cone structures for circuit partitioning into FPGA packages

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1998年第7期17卷 592-600页

作者： Brasen, DR Saucier, G Cadence Design Syst Inc San Jose CA 95134 USA Inst Natl Polytech Grenoble CSI F-38031 Grenoble France

Circuit designers and high-level synthesis tools have traditionally used circuit hierarchy to partition circuits into packages. However hierarchical partitioning can not be easily performed if hierarchical blocks have too large a size or too many I-O's. This problem becomes more frequent with field-programmable gate arrays (FPGA's) which commonly have small size limits and up to ten times smaller I-O pin limits. An I-O bottleneck often occurs which during circuit partitioning means more required packages and more ordinary signal mires crossing between the packages. More critical timing paths between packages are cut and circuit operational frequencies are drastically reduced. In this paper, two new partitioning algorithms are presented that use cone structures to partition large hierarchical blocks into FPGA's. Cone structures are minimum cut partitioning structures for netlists with low fanout, and clustering structures for partitioning netlists with high fanout, Cone structures also allow for full containment of critical paths. When used with good merging and cutting strategies, results show the cone partitioning algorithms given here produces fewer FPGA partitions than min-cut with good performance.

关键词： Circuits Field programmable gate arrays Packaging Clustering algorithms partitioning algorithms High level synthesis Wires Timing Frequency Merging

来源：评论

学校读者我要写书评

暂无评论

Dynamic partitioning and Coverage Control With Asynchronous One-to-Base-Station Communication

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2016年第1期3卷 24-33页

作者： Patel, Rushabh Frasca, Paolo Durham, Joseph W. Carli, Ruggero Bullo, Francesco Univ Calif Santa Barbara Dept Mech Engn Santa Barbara CA 93106 USA Univ Twente Dept Appl Math NL-7522 NB Enschede Netherlands Kiva Syst North Reading MA 01864 USA Univ Padua Dept Informat Engn I-35131 Padua Italy

We propose algorithms to automatically deploy a group of mobile robots and provide coverage of a nonconvex environment with communication limitations. In settings, such as hilly terrain or for underwater ocean gliders, peer-to-peer communication can be impossible and frequent communication to a central base station may be impractical. This paper instead explores how to perform coverage control when each robot has only asynchronous and sporadic communication with a base station. The proposed algorithms rely upon overlapping territories, monotonically minimize suitable cost functions, and provably converge to a centroidal Voronoi partition. We also describe how the use of overlapping territories allows our algorithms to smoothly handle dynamic changes to the robot team.

关键词： Asynchronous communication autonomous agents distributed algorithms partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Label Propagation-Based Parallel Graph partitioning for Large-Scale Graph Data

引用

IEEE ACCESS 2020年 8卷 72801-72813页

作者： Bae, Minho Jeong, Minjoong Oh, Sangyoon Ajou Univ Comp Engn Suwon South Korea Korea Inst Sci & Technol Informat Supercomp Dept Daejeon 34141 South Korea

The increasing importance of graph data in various fields requires large-scale graph data to be processed efficiently. Furthermore, well-balanced graph partitioning is a vital component of parallel/distributed graph processing. The goal of graph partitioning is to obtain a well-balanced graph topology, where the size of each partition is balanced while the number of edge cuts is reduced. Moreover, a graph-partitioning algorithm should achieve high performance and scalability. In this study, we present a novel graph-partitioning algorithm that ensures a high edge cutting quality and excellent parallel processing performance. We apply formulas based on the label propagation algorithm to improve the quality of edge cuts and achieve fast convergence. In our approach, the necessity of applying the label propagation process for all vertices is removed, and the process is applied only for candidate vertices based on a score metric. Our proposed algorithm introduces a stabilization phase in which remote and highly connected vertices are relocated to prevent the algorithm from becoming trapped in local optima. Comparison results show that a prototype based on the proposed algorithm outperforms well-known parallel graph-partitioning frameworks in terms of speed and balance.

关键词： partitioning algorithms Frequency modulation Scalability Topology Convergence Measurement Licenses Data processing graph data parallel processing partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Generation, Transmission, and Detection of 4-D Set-partitioning QAM Signals

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2015年第7期33卷 1445-1451页

作者： Fischer, Johannes Karl Schmidt-Langhorst, Carsten Alreesh, Saleem Elschner, Robert Frey, Felix Berenguer, Pablo Wilke Molle, Lutz Noelle, Markus Schubert, Colja Heinrich Hertz Inst Nachrichtentech Berlin GmbH Fraunhofer Inst Telecommun Dept Photon Networks & Syst D-10587 Berlin Germany Tech Univ Berlin Fachgebiet Nachrichtentech D-10587 Berlin Germany

Four-dimensional (4-D) set-partitioning quadrature amplitude modulation (4-D SP-QAM) has emerged as an interesting option for cost-and resource-efficient realization of bandwidth variable transceivers in elastic optical networks. In this invited paper, we review the principles for generation of 4-D SP-QAM signals, and describe options for forward error correction coding of 4-D SP-QAM signals and for realization of the digital signal processing in the coherent receiver. Furthermore, we report on the experimental realization of 4-D 512-ary and 2048-ary SP-QAM signals at a symbol rate of 28 GBd and investigate their performance in a Nyquist-WDM scenario. In transmission experiments over standard single-mode fiber, we compare the reach and spectral efficiency of five-carrier Nyquist-WDM signals modulated by various 4-D SP-QAM formats and polarization-division multiplexed (PDM) QAM formats. Of these modulation formats, the one with the lowest spectral efficiency is 128-ary SP-QAM encoding 7 bits/4-D symbol and the one with the highest spectral efficiency is PDM-64QAM encoding 12 bits/4-D symbol. By switching the modulation format, the spectral efficiency can be optimized for a specific reach with a granularity of 0.56 bit/s/Hz.

关键词： Digital signal processing optical fiber communication partitioning algorithms quadrature amplitude modulation transceivers turbo codes wavelength division multiplexing

来源：评论

学校读者我要写书评

暂无评论

A Commonality Modeling Framework for Enhanced Video Coding Leveraging on the Cuboidal partitioning Based Representation of Frames

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2022年 24卷 4446-4457页

作者： Ahmmed, Ashek Murshed, Manzur Paul, Manoranjan Taubman, David Charles Sturt Univ Sch Comp & Math Bathurst NSW 2795 Australia Federat Univ Sch Sci Engn & Informat Technol Mt Helen Vic 3350 Australia Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

Video coding algorithms attempt to minimize the significant commonality that exists within a video sequence. Each new video coding standard contains tools that can perform this task more efficiently compared to its predecessors. Modern video coding systems are block-based wherein commonality modeling is carried out only from the perspective of the block that need be coded next. In this work, we argue for a commonality modeling approach that can provide a seamless blending between global and local homogeneity information. For this purpose, at first the frame that need be coded, is recursively partitioned into rectangular regions based on the homogeneity information of the entire frame. After that each obtained rectangular region's feature descriptor is taken to be the average value of all the pixels' intensities encompassing the region. In this way, the proposed approach generates a coarse representation of the current frame by minimizing both global and local commonality. This coarse frame is computationally simple and has a compact representation. It attempts to preserve important structural properties of the current frame which can be viewed subjectively as well as from improved rate-distortion performance of a reference scalable HEVC coder that employs the coarse frame as a reference frame for encoding the current frame.

关键词： Video coding Encoding Video sequences partitioning algorithms Standards Rate-distortion Optimization Video coding commonality HEVC

来源：评论

学校读者我要写书评

暂无评论

Structure-Attribute-Based Social Network Deanonymization With Spectral Graph partitioning

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2022年第3期9卷 902-913页

作者： Jiang, Honglu Yu, Jiguo Cheng, Xiuzhen Zhang, Cheng Gong, Bei Yu, Haotian George Washington Univ Dept Comp Sci Washington DC 20052 USA Univ Texas Rio Grande Valley Dept Comp Sci Brownsville TX 78520 USA Qilu Univ Technol Sch Comp Sci Shandong Acad Sci Jinan 250353 Peoples R China Shandong Lab Comp Networks Jinan 250014 Peoples R China Shandong Univ Sch Comp Sci & Technol Qingdao 266510 Peoples R China West Texas A&M Univ Paul & Virginia Engler Coll Business Canyon TX 79016 USA Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China George Washington Univ Dept Data Analyt Washington DC 20052 USA

Online social networks have gained tremendous popularity and have dramatically changed the way we communicate in recent years. However, the publishing of social network data raises more and more privacy concerns. To protect user privacy, social networking data are usually anonymized before being released. Nevertheless, existing anonymization techniques do not have sufficient protection effects. A large number of deanonymization attacks have arisen, and they mainly make use of either network topology or node attribute information to successfully reidentify anonymized users. In this article, we model a social network as a structure-attribute network (SAN) integrating the structural characteristics and the attribute information associated with social network users. A novel similarity measurement of social network nodes is proposed by considering the structural similarity and attribute similarity. A two-phase scheme is then designed to perform deanonymization by first dividing a social network (graph) into smaller subgraphs based on spectral graph partitioning and then applying the proposed deanonymization algorithm on each matched subgraph pair. We simulate the deanonymization attack with extensive experiments on three real-world datasets, and the experimental results demonstrate that our approach can improve the accuracy and time complexity of deanonymization compared with the state of the art.

关键词： Social networking (online) Electronic mail Solid modeling partitioning algorithms Computer science Measurement Network topology Deanonymization differential privacy k-anonymity social network

来源：评论

学校读者我要写书评

暂无评论

Towards Effective Causal partitioning by Edge Cutting of Adjoint Graph

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2024年第12期46卷 10259-10271页

作者： Zhang, Hao Ren, Yixin Xia, Yewei Zhou, Shuigeng Guan, Jihong Fudan Univ Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China Fudan Univ Sch Comp Sci Shanghai 200433 Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518000 Peoples R China Tongji Univ Dept Comp Sci & Technol Shanghai 201804 Peoples R China

Causal partitioning is an effective approach for causal discovery based on the divide-and-conquer strategy. Up to now, various heuristic methods based on conditional independence (CI) tests have been proposed for causal partitioning. However, most of these methods fail to achieve satisfactory partitioning without violating d-separation, leading to poor inference performance. In this work, we transform causal partitioning into an alternative problem that can be more easily solved. Concretely, we first construct a superstructure G of the true causal graph G(T) by performing a set of low-order CI tests on the observed data D. Then, we leverage point-line duality to obtain a graph G(A) adjoint to G. We show that the solution of minimizing edge-cut ratio on G(A) can lead to a valid causal partitioning with smaller causal-cut ratio on G and without violating d-separation. We design an efficient algorithm to solve this problem. Extensive experiments show that the proposed method can achieve significantly better causal partitioning without violating d-separation than the existing methods.

关键词： partitioning algorithms Skeleton Transforms Pattern analysis Computer science Testing Task analysis Conditional independence test causal partitioning causal discovery

来源：评论

学校读者我要写书评

暂无评论

SPARTA - A SYSTEM partitioning AID

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1986年第4期5卷 490-498页

作者： RESNICK, ML GTE Laboratories Inc. Waltham MA USA

This paper presents SPARTA, the System partitioning Aid. partitioning is the design phase in which a system's functionality is divided into smaller parts that fit onto physical units. SPARTA is a unique and interesting approach to computer-aided partitioning of systems SPARTA performs the tedious calculation of each design factor (such as area) for each partition (such as chips). This allows the designer to evaluate many partitionings within a very short time with minimal effort. SPARTA does not generate partitionings, it evaluates the user's partitionings in a way similar to spreadsheet programs. SPARTA was designed as a testbed for future work on partitioning algorithms.

关键词： partitioning algorithms Pins Power system reliability Spreadsheet programs Algorithm design and analysis Circuits Constraint optimization Electronic equipment testing System testing Logic

来源：评论

学校读者我要写书评

暂无评论

On the integration of partitioning and global routing for rectilinear placement problems

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1996年第1期15卷 83-91页

作者： Yeh, CW Wang, CS Electrical Engineering Department National Chung Cheng University Chiayi Taiwan

Rectilinear placement is an important process for mixed macro block/standard cells design due to frequent presence of preplaced macro blocks. A prevailing solution to this problem is to divide the rectilinear region into rectangular subregions and partition cells into these subregions before applying standard placement algorithms. For such a strategy to work, the partitioning objective must closely correlate with the global routing objective. In this paper, we propose a new method to integrate global routing with partitioning. The salient features of our approach consist of 1) a new edge cost model and its computation using an incremental assignment technique;2) a resistive network analogy for net cost modeling and a randomized algorithm for resistance computation;3) a robust partitioning framework that combines the ideas of 1) and 2), Also, a dynamic strategy is proposed to evaluate the performance of the algorithm. Our method has been tested on several benchmark circuits and displayed excellent results in terms of both wire length and routability.

关键词： Routing partitioning algorithms Costs Computer networks Circuit testing Computational modeling Robustness Benchmark testing Wire Process planning

来源：评论

学校读者我要写书评

暂无评论

ON THE INTRINSIC RENT PARAMETER AND SPECTRA-BASED partitioning METHODOLOGIES

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第1期13卷 27-37页

作者： HAGEN, L KAHNG, AB KURDAHI, FJ RAMACHANDRAN, C UNIV CALIF IRVINE DEPT ELECT & COMP ENGNIRVINECA 92717

The complexity of circuit designs has necessitated a top-down approach to layout synthesis. A large body of work shows that a good layout hierarchy, or partitioning tree, as measured by the associated Rent parameter, will correspond to an area-efficient layout. We define the intrinsic Rent parameter of a netlist to be the minimum possible Rent parameter of any partitioning tree for the netlist. Experimental results show that spectra-based ratio cut partitioning algorithms yield partitioning trees with the lowest observed Rent parameter over all benchmarks and over all algorithms tested. For examples where the intrinsic Rent parameter is known, spectral ratio cut partitioning yields a partitioning tree with Rent parameter essentially identical to this theoretical optimum. These results have deep implications with respect to both the choice of partitioning algorithms for top-down layout, as well as new approaches to layout area estimation. The paper concludes with directions for future research, including several promising techniques for fast estimation of the (intrinsic) Rent parameter.

关键词： partitioning algorithms Circuit synthesis Recursive estimation Testing Very large scale integration Phase estimation Binary trees Design automation Computer science Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：