AN OVERVIEW OF TECHNIQUES FOR PARTITIONING MULTICHIP MODULES

1995 ◽  
Vol 06 (04) ◽  
pp. 539-553 ◽  
Author(s):  
S. RAMAN ◽  
L.M. PATNAIK
Keyword(s):  
Genetic Algorithms ◽  
Cost Function ◽  
Design Process ◽  
Multichip Module ◽  
Multichip Modules ◽  
Physical Constraints ◽  
Performance Requirements ◽  
Partitioning Problem

With the increasing popularity of Multichip Modules and the increasing complexity of circuit designs, there is a need to address issues in automating the design process for MCMs. In this paper, we address one such issue, that of dividing a complex circuit into partitions that can be assigned to chips on a Multichip Module. Partitioning is usually carried out to minimize a cost function in the presence of physical constraints that depend on the performance requirements of the circuit. We survey the existing algorithms for the partitioning problem and describe in detail an approach to partitioning based on Genetic Algorithms.

Computing the Medical Image Registration Using Meta-Heuristics

2014 ◽  
Vol 643 ◽  
pp. 237-242 ◽  
Author(s):  
Tahari Abdou El Karim ◽  
Bendakmousse Abdeslam ◽  
Ait Aoudia Samy
Keyword(s):  
Image Processing ◽  
Genetic Algorithms ◽  
Simulated Annealing ◽  
Image Registration ◽  
Cost Function ◽  
Population Genetic ◽  
Medical Image ◽  
Medical Image Registration ◽  
Anatomical Structures

The image registration is a very important task in image processing. In the field of medical imaging, it is used to compare the anatomical structures of two or more images taken at different time to track for example the evolution of a disease. Intensity-based techniques are widely used in the multi-modal registration. To have the best registration, a cost function expressing the similarity between these images is maximized. The registration problem is reduced to the optimization of a cost function. We propose to use neighborhood meta-heuristics (tabu search, simulated annealing) and a meta-heuristic population (genetic algorithms). An evaluation step is necessary to estimate the quality of registration obtained. In this paper we present some results of medical image registration

The Effect Analysis of Fin Arrangement on Thermal Hydraulic Performance of a Vehicular Cooler

2013 ◽  
Vol 712-715 ◽  
pp. 1600-1604
Author(s):  
Jing Zhao ◽  
Bao Lan Xiao ◽  
Wei Ming Wu ◽  
Xiao Li Yu ◽  
Guo Dong Lu
Keyword(s):  
Heat Transfer ◽  
Numerical Simulation ◽  
Fluid Flow ◽  
Design Process ◽  
Simulation Method ◽  
Effect Analysis ◽  
Performance Requirements ◽  
Flow And Heat Transfer ◽  
Stability Structure ◽  
Safety And Stability

The excellent thermal hydraulic performances of coolers are the foundations of vehicular safety and stability. Structure, material, fin type and arrangement all have important effects on the thermal hydraulic performances. Numerical simulation method was adopted in this paper to investigate the effect of fin arrangement. The fluid flow and heat transfer performances were contrasted and analyzed under two different fin arrangements. It was found that fin arrangement effected thermal hydraulic performances severely and during the design process of a cooler, the performance requirements could be met through adjusting fin arrangements.

Optimum placement for optoelectronic multichip modules and the synthesis of diffractive optics for multichip module interconnects

1994 ◽  
Vol 33 (8) ◽  
pp. 1444 ◽  
Author(s):  
David Zaleta ◽  
Jiao Fan ◽  
Bernard C. Kress ◽  
Sing H. Lee ◽  
Chung-Kuan Cheng
Keyword(s):  
Diffractive Optics ◽  
Multichip Module ◽  
Multichip Modules ◽  
Optimum Placement

Computational Support for Interactive Cable Harness Routing and Design

1993 ◽  
Author(s):  
Andrew B. Conru ◽  
Mark R. Cutkosky
Keyword(s):  
Cost Function ◽  
Topological Structure ◽  
Three Dimensional ◽  
Initial Guess ◽  
Local Minima ◽  
Cable Harness ◽  
Physical Constraints ◽  
Computational Support ◽  
Bending Radius

Abstract We describe a system for routing cable harnesses in complex, three-dimensional environments. The approach taken is to automate the basic routing process as much as possible, while allowing designers to guide the system and modify the numerically generated results at any stage. The system begins by quickly generating a coarse routing based on an initial guess of the cable harness configuration (topological structure). Paths are then successively refined to minimize a cost function, while satisfying physical constraints such as minimum bending radius. Human input is useful both for guiding the system away from local minima and for responding to case-specific constraints not encoded in the router.

AN INTEGRATED DESIGN PROCESS OF LOW-COST HOUSING IN CHILE

2019 ◽  
Vol 14 (3) ◽  
pp. 81-93
Author(s):  
Maureen Trebilcock-Kelly ◽  
Gerardo Saelzer-Fica ◽  
Ariel Bobadilla-Moreno
Keyword(s):  
Design Process ◽  
Energy Demand ◽  
Low Cost ◽  
Integrated Design ◽  
Poor Quality ◽  
Performance Requirements ◽  
U Value ◽  
Low Cost Housing ◽  
Integrated Design Process ◽  
The City

This paper discusses the application of Integrated Design Process for the design of low-cost housing in Chile. It aims to question common practice for the development of housing based on prescriptive regulations and non-interdisciplinary work, which has resulted in poor quality building requirements. The first stage consisted in defining performance requirements for aspects such as energy demand, U value, air tightness and indoor air quality for a specific case of low-cost houses located in the city of Temuco. An integrated design process was carried out by an interdisciplinary team of professionals specialized in each of the performance aspects that were taken into account. The construction and post-occupancy stages were characterized by verifying the performance requirements, which resulted in a low-cost house prototype that included strategies for energy efficiency and a healthy indoor environment.

Design of Trajectories With Physical Constraints for Very Lightweight Single Link Flexible Arms

2006 ◽  
Author(s):  
Francisco Ramos ◽  
Vicente Feliu ◽  
Ismael Payo
Keyword(s):  
Design Process ◽  
Internal Control ◽  
Elastic Limit ◽  
Feedforward Control ◽  
Objective Method ◽  
Maximum Deflection ◽  
Robotic Arms ◽  
Physical Constraints ◽  
Single Link ◽  
Flexible Arms

This communication deals with feedforward control of light, flexible robotic arms. In particular we develop a new, objective method to design a family of trajectories that can be used as modified inputs which cancel the tip vibrations during the robot manoeuvres. This method takes into account the constraints encountered in real actuators (motors), such as a maximum motor torque, and those due to the mechanical limits of the link, such as the maximum deflection before reaching the elastic limit of the link. Parameters of the internal control of the actuators are also derived from the design process, gaining the fastest performance without saturating the motor. Lastly, we show some experimental results which clearly demonstrate the benefits of the new trajectories by comparing them to a linear one.

Using Q-Learning and Genetic Algorithms to Improve the Efficiency of Weight Adjustments for Optimal Control and Design Problems

2005 ◽  
Author(s):  
Kaivan Kamali ◽  
Lijun Jiang ◽  
John Yen ◽  
K. W. Wang
Keyword(s):  
Optimal Control ◽  
Genetic Algorithms ◽  
Convergence Rate ◽  
Cost Function ◽  
Design Problem ◽  
Numerical Experiments ◽  
Design Parameters ◽  
Design Problems ◽  
Q Learning ◽  
Layered Approach

In traditional optimal control and design problems, the control gains and design parameters are usually derived to minimize a cost function reflecting the system performance and control effort. One major challenge of such approaches is the selection of weighting matrices in the cost function, which are usually determined via trial and error and human intuition. While various techniques have been proposed to automate the weight selection process, they either can not address complex design problems or suffer from slow convergence rate and high computational costs. We propose a layered approach based on Q-learning, a reinforcement learning technique, on top of genetic algorithms (GA) to determine the best weightings for optimal control and design problems. The layered approach allows for reuse of knowledge. Knowledge obtained via Q-learning in a design problem can be used to speed up the convergence rate of a similar design problem. Moreover, the layered approach allows for solving optimizations that cannot be solved by GA alone. To test the proposed method, we perform numerical experiments on a sample active-passive hybrid vibration control problem, namely adaptive structures with active-passive hybrid piezoelectric networks (APPN). These numerical experiments show that the proposed Q-learning scheme is a promising approach for.

scholarly journals ROUTABILITY-DRIVEN PACKING: METRICS AND ALGORITHMS FOR CLUSTER-BASED FPGAs

2004 ◽  
Vol 13 (01) ◽  
pp. 77-100 ◽  
Author(s):  
E. BOZORGZADEH ◽  
S. OGRENCI MEMIK ◽  
X. YANG ◽  
M. SARRAFZADEH
Keyword(s):  
Cost Function ◽  
Design Process ◽  
Clustering Method ◽  
Packing Algorithm ◽  
Minimum Number

Most of the FPGA's area and delay are due to routing. Considering routability at earlier steps of the CAD flow would both yield better quality and faster design process. In this paper, we discuss the metrics that affect routability in packing logic into clusters. We are presenting a routability-driven clustering method for cluster-based FPGAs. Our method packs LUTs into logic clusters while incorporating routability metrics into a cost function. Based on our routability model, the routability in timing-driven packing algorithm is analyzed. We integrate our routability model into a timing-driven packing algorithm. Our method yields up to 50% improvement in terms of the minimum number of routing tracks compared to VPack (16.5% on average). The average routing area improvement is 27% over VPack and 12% over t-VPack.

Multichip Module Planarity Requirements Derived From Solder Surface Tension Models

2018 ◽  
Vol 15 (1) ◽  
pp. 9-20 ◽  
Author(s):  
Thomas F. Marinis ◽  
Joseph W. Soucy
Keyword(s):  
Surface Tension ◽  
Solder Ball ◽  
High Surface ◽  
Surface Tension Force ◽  
Design Tool ◽  
Tension Force ◽  
Multichip Module ◽  
Multichip Modules ◽  
Electrical Connections ◽  
Module Performance

The number of die and routing layers in multichip modules and fan-out packages has been steadily increasing, which has exasperated the problem of maintaining module planarity for interconnect to a system board. The usual remedies are to try to match coefficients of thermal expansion as closely as possible, balance composition of layers on either side of a module's neutral axis, and build on stiff, planar interposers. All of these strategies can affect module performance, size, and cost. We have examined an alternative approach to accommodating module bow, by allowing the solder ball interconnects to compress or elongate as necessary to maintain electrical connections. This approach is further enhanced by making the module very thin, which does not reduce its bow, but rather allows the high surface tension force exerted by molten solder to flatten the module. We have derived a model for the surface tension force exerted by a solder ball as a function of the degree to which it is compressed or elongated. This model also predicts the maximum elongation that the solder connection can sustain before it ruptures. We have applied this model in a design tool, which allows us to predict the maximum module bow that can be accommodated as a function of the number, size, and location of the solder connections and the physical composition of the multichip module.

Sign in / Sign up

Export Citation Format

Share Document