Simulation for Reliability, Hardware Security, and Ising Computing in VLSI Chip Design

The continued scaling of VLSI circuits has provided a wealth of opportunities andchallenges to the VLSI circuit design area. Both these challenges and opportunities, however,require new simulation tools that can enable their solution or exploitation as classicalmethods typically dealt with problem domains with smaller scales or less complexity. Inthis dissertation, simulation methods are presented to address the emerging VLSI designtopics of Electromigration induced aging and Ising computing and are then applied to theapplication areas of hardware security and graph partitioning respectively.The Electromigration aging effect in VLSI circuits is a long-term reliability issueaffecting current carrying metal wires leading to IR drop degradation. Typically, simpleanalytical equations can determine a wire’s effective age or if it will be affected by the EMaging effect at all. However, these classical methods are overly conservative and can lead toover design or unnecessary design iterations. Furthermore, it is expected that the EM agingeffect will become more severe in future Integrated Cirucits (ICs) due to increasing currentdensities and the prevalance of polycrystaline copper atom structures seen at small wiredimensions. For this reason, more comprehensive simulation techniques that can efficientlysimulate the EM effect with less conservative results can help mitigate overdesign andincrease design margins while reducing design iterations.The area of Hardware Security is becoming increasingly important as the chipsupply chain becomes more globalized and the integrity of chips becomes more diffiuclt toverify. Utilizing the accurate simulation techniques for EM, we can utilize this reliabilityeffect to demonstrate how a reliability based attack could be perpatrated. Furthermore, wecan utilize this aging effect as a defense mechanism to help us validate the integrity of anIC and detect counterfeit chips in the component supply chain market.Ising computing is an emerging method of solving combinatorial optimization problemsby simulating the interactions of so-called spin glasses and their interactions. Borrowingconcepts from quantum computing, this methods mimics the quantum interaction betweenspin glasses in such a way that finding a ground state of these spin glass models leadsto the solution of a particular problem. In this dissertation, effective methods of simulatingthe spin glass interactions using General Purpose Graphics Processing Units (GPGPUs)and finding their ground state are developed.In addition to the GPU based Ising model simulations, important combinatorialproblems can be mapped to the Ising model. In this dissertation the Ising solver is appliedto graph partitioning which can be utilized in VLSI design and many other domains as well.Specifically, solvers for the maxcut problem and the balanced min-cut partitioning problemare developed

Dispatching and Rescheduling Tasks and Their Interactions with Travel Demand and the Energy Domain: Models and Algorithms

Abstract The paper aims to provide an overview of the key factors to consider when performing reliable modelling of rail services. Given our underlying belief that to build a robust simulation environment a rail service cannot be considered an isolated system, also the connected systems, which influence and, in turn, are influenced by such services, must be properly modelled. For this purpose, an extensive overview of the rail simulation and optimisation models proposed in the literature is first provided. Rail simulation models are classified according to the level of detail implemented (microscopic, mesoscopic and macroscopic), the variables involved (deterministic and stochastic) and the processing techniques adopted (synchronous and asynchronous). By contrast, within rail optimisation models, both planning (timetabling) and management (rescheduling) phases are discussed. The main issues concerning the interaction of rail services with travel demand flows and the energy domain are also described. Finally, in an attempt to provide a comprehensive framework an overview of the main metaheuristic resolution techniques used in the planning and management phases is shown

Solving optimization problems with local light shift encoding on Rydberg quantum annealers

We provide a non-unit disk framework to solve combinatorial optimization problems such as Maximum Cut (Max-Cut) and Maximum Independent Set (MIS) on a Rydberg quantum annealer. Our setup consists of a many-body interacting Rydberg system where locally controllable light shifts are applied to individual qubits in order to map the graph problem onto the Ising spin model. Exploiting the flexibility that optical tweezers offer in terms of spatial arrangement, our numerical simulations implement the local-detuning protocol while globally driving the Rydberg annealer to the desired many-body ground state, which is also the solution to the optimization problem. Using optimal control methods, these solutions are obtained for prototype graphs with varying sizes at time scales well within the system lifetime and with approximation ratios close to one. The non-blockade approach facilitates the encoding of graph problems with specific topologies that can be realized in two-dimensional Rydberg configurations and is applicable to both unweighted as well as weighted graphs. A comparative analysis with fast simulated annealing is provided which highlights the advantages of our scheme in terms of system size, hardness of the graph, and the number of iterations required to converge to the solution.Comment: 18 pages, 6 figures, 1 tabl

CODUSA - Customize Optimal Donor Using Simulated Annealing In Heart Transplantation.

In heart transplantation, selection of an optimal recipient-donor match has been constrained by the lack of individualized prediction models. Here we developed a customized donor-matching model (CODUSA) for patients requiring heart transplantations, by combining simulated annealing and artificial neural networks. Using this approach, by analyzing 59,698 adult heart transplant patients, we found that donor age matching was the variable most strongly associated with long-term survival. Female hearts were given to 21% of the women and 0% of the men, and recipients with blood group B received identical matched blood group in only 18% of best-case match compared with 73% for the original match. By optimizing the donor profile, the survival could be improved with 33 months. These findings strongly suggest that the CODUSA model can improve the ability to select optimal match and avoid worst-case match in the clinical setting. This is an important step towards personalized medicine

Inferring Drosophila gap gene regulatory network: a parameter sensitivity and perturbation analysis

<p>Abstract</p> <p>Background</p> <p>Inverse modelling of gene regulatory networks (GRNs) capable of simulating continuous spatio-temporal biological processes requires accurate data and a good description of the system. If quantitative relations between genes cannot be extracted from direct measurements, an efficient method to estimate the unknown parameters is mandatory. A model that has been proposed to simulate spatio-temporal gene expression patterns is the connectionist model. This method describes the quantitative dynamics of a regulatory network in space. The model parameters are estimated by means of model-fitting algorithms. The gene interactions are identified without making any prior assumptions concerning the network connectivity. As a result, the inverse modelling might lead to multiple circuits showing the same quantitative behaviour and it is not possible to identify one optimal circuit. Consequently, it is important to address the quality of the circuits in terms of model robustness.</p> <p>Results</p> <p>Here we investigate the sensitivity and robustness of circuits obtained from reverse engineering a model capable of simulating measured gene expression patterns. As a case study we use the early gap gene segmentation mechanism in <it>Drosophila melanogaster</it>. We consider the limitations of the connectionist model used to describe GRN Inferred from spatio-temporal gene expression. We address the problem of circuit discrimination, where the selection criterion within the optimization technique is based of the least square minimization on the error between data and simulated results.</p> <p>Conclusion</p> <p>Parameter sensitivity analysis allows one to discriminate between circuits having significant parameter and qualitative differences but exhibiting the same quantitative pattern. Furthermore, we show that using a stochastic model derived from a deterministic solution, one can introduce fluctuations within the model to analyze the circuits' robustness. Ultimately, we show that there is a close relation between circuit sensitivity and robustness to fluctuation, and that circuit robustness is rather modular than global. The current study shows that reverse engineering of GRNs should not only focus on estimating parameters by minimizing the difference between observation and simulation but also on other model properties. Our study suggests that multi-objective optimization based on robustness and sensitivity analysis has to be considered.</p

Stochastic Modeling and Planning of Wind-Based Distributed Generators in Distribution System

The increasing strain on the Earth resulting from pollution, climate change, and finite resources has established the development of renewable energy sourcing methods, such as wind, solar and geothermal energy. By reorganizing the power system structures, and the growth in customer demand, the development of Distributed Generation (DG) play a vital role in the power system planning. Furthermore, because of the inexhaustibility and cleanliness of the renewable DG units, they are inevitably the key to a sustainable energy supply infrastructure. Nevertheless, the random nature associated with the renewable DG units produces specific challenges that have to be addressed to accelerate the expansion of the renewable DG units in the distribution system. Firstly, a new method for the determination of the wind speed distribution based on hourly wind speed data is proposed. Thus, instead of using only the well-known unimodal distributions such as Weibull and Rayleigh, a combination of probability density functions (PDFs) is taken into account, considering four sets of parameters in which each set represents a distribution. Furthermore, this model enhances the likelihood of the estimated wind speed probabilities. The maximum likelihood estimation (MLE) method for finite mixture models through the expectation-maximization (EM) algorithm is used to estimate the optimal parameters of the mixture distribution. Then two types of error measurements assessed the performance of each unimodal and multimodal distribution. As a result, the mixture of Gamma (MoG) distribution returned the most accurate results. Secondly, the results of wind speed modeling will be used in the siting and sizing wind-based DG units. The methodology addresses a probabilistic generation load model that combines all possible operating conditions of the wind-based DG units and load levels with their probabilities. The objective of siting and sizing formulation is to minimize the annual energy losses of the system as well as keeping the system constraints such as voltage limits at different buses (slack and load buses) of the system, feeder capacity, discrete size of the DG units, maximum investment on each bus, and maximum penetration limit of DG units in an acceptable limit