The Experts below are selected from a list of 36246 Experts worldwide ranked by ideXlab platform
Chris Chu - One of the best experts on this subject based on the ideXlab platform.
-
Detailed Placement Algorithm for VLSI Design with Double-Row Height Standard Cells
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2016Co-Authors: Gang Wu, Chris ChuAbstract:Conventional detailed Placement Algorithms typically assume all standard cells in the design have the same height. However, as the complexity and design requirement increase in modern very large-scale integration design, designs with mixed single-row height and double-row height standard cells come into existence in order to address the emerging standard cell design challenges. A detailed Placement Algorithm without considering these double-row height cells will either have to deal with a lot of movable macros or waste a significant amount of Placement area, depending on what type of techniques people use to accommodate such design. This paper proposes a new Placement approach which can handle designs with any number of double-row height standard cells. We transform design with mixed-height standard cells into one which only contains same height standard cells by pairing up single-row height cells into double-row height. Then conventional detailed Placement Algorithms can be applied. In particular, we generate cell pair candidates by formulating a maximum weighted matching problem. A subset of the cell pair candidates are then carefully selected to form double-row height cells based on the local bin density. A refinement procedure is performed at the end to further improve our Placement quality. We compare our approach with two alternative detailed Placement methods on mixed-height asynchronous and synchronous designs. The experimental results show that our approach can achieve much better quality and robustness.
-
FastPlace 3.0: A fast multilevel quadratic Placement Algorithm with Placement congestion control
Proceedings of the Asia and South Pacific Design Automation Conference ASP-DAC, 2007Co-Authors: N. Viswanathan, Min Pan, Chris ChuAbstract:In this paper, we present FastPlace 3.0 - an efficient and scalable multilevel quadratic Placement Algorithm for large-scale mixed-size designs. The main contributions of our work are: (1) A multilevel global Placement framework, by incorporating a two-level clustering scheme within the flat analytical placer FastPlace (Viswanathan and Chu, 2005) and Viswanathan et al., 2006), (2) An efficient and improved iterative local refinement technique that can handle Placement blockages and Placement congestion constraints. (3) A congestion aware standard-cell legalization technique in the presence of blockages. On the ISPD-2005 Placement benchmarks (Nam et al., 2005), our Algorithm is 5.12times, 11.52times and 16.92times faster than mPL6, Capo10.2 and APlace2.0 respectively. In terms of wirelength, we are on average, 2% higher as compared to mPL6 and 9% and 3% better as compared to Capo10.2 and APlace2.0 respectively. We also achieve competitive results compared to a number of academic placers on the Placement congestion constrained ISPD-2006 Placement benchmarks (Nam, 2006).
-
An efficient and effective detailed Placement Algorithm
IEEE ACM International Conference on Computer-Aided Design Digest of Technical Papers ICCAD, 2005Co-Authors: Min Pan, N. Viswanathan, Chris ChuAbstract:In the past few years, there has been a lot of research in the area of global Placement. In comparison, not much attention has been paid to the detailed Placement problem. Existing detailed placers either fail to improve upon the excellent solution quality enabled by good global placers or are very slow. To handle the above problems, we focus on the detailed Placement problem. We present an efficient and effective detailed Placement Algorithm to handle the wirelength minimization problem. The main contributions of our work are: (1) an efficient Global Swap technique to identify a pair of cells that can be swapped to reduce wirelength; (2) a flow that combines the Global Swap technique with other heuristics to produce very good wirelength; (3) an efficient single-segment clustering technique to optimally shift cells within a segment to minimize wirelength. On legalized mPL5 global Placements on the IBM standard-cell benchmarks, our detailed placer can achieve 19.0%, 13.2% and 0.5% more wirelength reduction compared to Fengshui5.0, rowironing and Domino respectively. Correspondingly we are 3.6× 2.8× and 15× faster. On the ISPD05 benchmarks (Gi-Joon Nam et al., 2005), we achieve 8.1% and 9.1% more wirelength reduction compared to Fengshui5.0 and rowironing respectively. Correspondingly we are 3.1× and 2.3× faster.
Shangguang Wang - One of the best experts on this subject based on the ideXlab platform.
-
an energy aware edge server Placement Algorithm in mobile edge computing
2018 IEEE International Conference on Edge Computing (EDGE), 2018Co-Authors: Shangguang WangAbstract:Edge server Placement problem is a hot topic in mobile edge computing. In this paper, we study the problem of energy-aware edge server Placement and try to find a more effective Placement scheme with low energy consumption. Then, we formulate the problem as a multi-objective optimization problem and devise a particle swarm optimization based energy-aware edge server Placement Algorithm to find the optimal solution. We evaluate the Algorithm based on the real dataset from Shanghai Telecom and the results show our Algorithm can reduce more than 10% energy consumption with over 15% improvement in computing resource utilization, compared to other Algorithms.
-
IEEE CLOUD - The Performance Evaluation of Virtual Machine Placement Algorithm Based on WebCloudSim
2018 IEEE 11th International Conference on Cloud Computing (CLOUD), 2018Co-Authors: Songtai Dai, Ao Zhou, Shangguang WangAbstract:Effective virtual machine Placement Algorithms can improve network resource utilization in cloud data centers. In order to design a more effective VM Placement Algorithm, we usually rely on a large-scale experimental platform to evaluate and verify its performance. However, large-scale experiment may have a huge impact on data center network, which makes it very unlikely to happen. Therefore, researchers need an experiment platform that can support large-scale environment to meet the above requirements. In order to evaluate the performance of virtual machine deployment Algorithm, this paper first designs and implements a cloud data center network experiment system, WebCloudSim, which can support the joint experimental verification of real environment and simulation environment. Then, based on WebCloudSim, the paper implements three classic Algorithms for virtual machine deployment, and verifies and analyzes the results. The experimental results show that WebCloudSim can effectively support the performance evaluation of virtual machine Placement Algorithm.
Li Junmin - One of the best experts on this subject based on the ideXlab platform.
-
Recursive Multivariable Adaptive Pole Placement Algorithm
Control theory & applications, 1997Co-Authors: Li Junmin, Gao ShupinAbstract:A two-layers recursive multivariable adaptive pole Placement Algorithm with a process of iterative computing controller's parameters is presented. The on-Line computation cost of the Algorithm is greatly reduced. The proof of the stability and the convergence of the Algorithm are respectively established. The Algorithm with the feed forward can arbitrarily follow a bounded output. Simulation example shows the efficiency of the Algorithm.
-
Recursive Adaptive Pole Placement Algorithm
Control theory & applications, 1996Co-Authors: Li Junmin, Xing Keyi, Wan BaiwuAbstract:A recursive adaptive pole Placement Algorithm is presented in this paper. The stability andthe convergence of the Algorithm are respectively established. Since one-step iterative formulation in computing controller's parameters is used,the on-line computation cost is greatly reduced. The Algorithm withthe feed forward can follow an arbitrarily bounded output. Simulation examples show the efficiency of theAlgorithm.
Wang Ling-fang - One of the best experts on this subject based on the ideXlab platform.
-
Replica Placement Algorithm in Distributed Media Service System
Computer Engineering, 2010Co-Authors: Wang Ling-fangAbstract:Aiming at the problem of replica Placement in a distributed media system to reduce the cost of transferring data among nodes,this paper proposes an heuristic replica Placement Algorithm——Zero2min based on global information,compared with common Algorithm,its cost is reduced by 10%～36%. It further proposes a method to place the media data when the data is imported into the system. Simulation results show that its cost is less than Max2min.
Yang Gao - One of the best experts on this subject based on the ideXlab platform.
-
Constraint Programming-Based Virtual Machines Placement Algorithm in Datacenter
2012Co-Authors: Yang GaoAbstract:As underlying infrastructure of cloud computing platform, datacenter is seriously underutilized, however, its operating costs is high. In this paper, we implement virtual machines Placement Algorithm in CloudSim using constraint programming approach. We first formulate the problem of virtual machines Placement in virtualized datacenters as a variant of multi-dimensions bin packing problem, and then exploit constraint solver to solve this problem with the objective of minimizing number of physical machines that host virtual machines. Finally, we compare different virtual Placement Algorithms for evaluating constraint programming-based virtual machine Placement Algorithm including the built-in virtual machine Placement Algorithm in CloudSim and FFD Algorithm. The experimental results show that constraint programming-based virtual machines Placement Algorithm can efficiently reduce the number of physical machines to achieve the goal of reducing datacenter operating costs and improving resource utilization.
-
Intelligent Information Processing - Constraint Programming-Based Virtual Machines Placement Algorithm in Datacenter
Intelligent Information Processing VI, 2012Co-Authors: Yang GaoAbstract:As underlying infrastructure of cloud computing platform, datacenter is seriously underutilized, however, its operating costs is high. In this paper, we implement virtual machines Placement Algorithm in CloudSim using constraint programming approach. We first formulate the problem of virtual machines Placement in virtualized datacenters as a variant of multi-dimensions bin packing problem, and then exploit constraint solver to solve this problem with the objective of minimizing number of physical machines that host virtual machines. Finally, we compare different virtual Placement Algorithms for evaluating constraint programming-based virtual machine Placement Algorithm including the built-in virtual machine Placement Algorithm in CloudSim and FFD Algorithm. The experimental results show that constraint programming-based virtual machines Placement Algorithm can efficiently reduce the number of physical machines to achieve the goal of reducing datacenter operating costs and improving resource utilization.
