Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs are used to speed up this procedure. The migration schemes that most researchers proposed in the past have migration near or after the demes converged [1,2]. However, for the placement of medium or large standard-cell ...

A temporal database management system is being considered as an important DBMS in new database applications such as engineering databases, VLSI, and CAD. Much researche on temporal databases, temporal query languages and temporal modeling techniques have been proposed. However, thus researche has not considered the schema modification problem in a temporal database yet. In this paper, we propos...

The growth in VLSI technology demands more capabilities from CAD tools. This requires betterintegrated environments and more design portability across platforms and tools. The move towards hardware description languages in recent years and the issue of intellectual property and interoperability puts a pressure on EDA vendors to come up with a well-defined standard intermediate format. The draft...

In 1997 we introduced a new fourth year/graduate course in the Department of Computer Science at the University of Victoria entitled “VLSI Design, CAD and Hardware/Software Codesign” under the rubric of “Special Topics”, where generic topics courses are the normal way that professors here inaugurate courses based on recent development in our research. The course was subscribed by students from ...

This report addresses the theoretical basis for building a prototyping environment for electro mechanical systems using concurrent engineering approach In Designing a robot manipulator as an example of electro mechanical systems the interaction be tween several modules S W VLSI CAD CAM Robotics and Control illustrates an interdisciplinary prototyping environment that includes di erent types of ...

We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision Diagrams (OBDDs). Working on symbolically represented data has potential: the standards achieved in graph sizes (playing a crucial role, for example, in verification, VLSI design, and CAD) are definitely higher. On the other hand...

“CyberCutTM” is a testbed for an Internet-based CAD/CAM system. It was specifically designed to be a networked, automated system, with a seamless communication flow from a client-side designer to a server-side machining service. The creation of CyberCut required several new software modules. These include: a) a Web-based design tool in which Design-forManufacturing information and machining rul...

This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. This NP-hard problem for non planar graphs has several application areas such as VLSI and ASICs CAD. The hiera...

In this thesis, a computer-aided-design (CAD) system is developed that assists in the design of novel three-dimensional integrated circuits. The software tools allow for the specification of a multilayer transistor circuit by means that are readily accessible to those familiar with two-dimensional CMOS VLSI design. This software system provides desirable features such as SPICE circuit extractio...

In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition I entropy on the V-E plain. If a circuit has higher initial potential / entropy, under a nearly max-cut reservation, we have higher probability to aim the mincut. The proposed new method is called Interleaved Cutting Edge-Node Interleaved Sort for Leaching and Envelop (...