Methodologies for Synthesizable Programmable Devices based on Multi-Stage Switching Networks

Nowadays the rise of non-recurring engineering (NRE) costs associated with complexity is becoming a major factor in SoC design, limiting both scaling opportunities and the flexibility advantages offered by the integration of complex computational units. The introduction of embedded programmable elements can represent an appealing solution, able both to guarantee the desired flexibility and upgradabilty and to widen the SoC market. In particular embedded FPGA (eFPGA) cores can provide bit-level optimization for those applications which benefits from synthesis, paying on the other side in terms of performance penalties and area overhead with respect to standard cell ASIC implementations. In this scenario this thesis proposes a design methodology for a synthesizable programmable device designed to be embedded in a SoC. A soft-core embedded FPGA (eFPGA) is hence presented and analyzed in terms of the opportunities given by a fully synthesizable approach, following an implementation flow based on Standard-Cell methodology. A key point of the proposed eFPGA template is that it adopts a Multi-Stage Switching Network (MSSN) as the foundation of the programmable interconnects, since it can be efficiently synthesized and optimized through a standard cell based implementation flow, ensuring at the same time an intrinsic congestion-free network topology. The evaluation of the flexibility potentialities of the eFPGA has been performed using different technology libraries (STMicroelectronics CMOS 65nm and BCD9s 0.11μm) through a design space exploration in terms of area-speed-leakage tradeoffs, enabled by the full synthesizability of the template. Since the most relevant disadvantage of the adopted soft approach, compared to a hardcore, is represented by a performance overhead increase, the eFPGA analysis has been made targeting small area budgets. The generation of the configuration bitstream has been obtained thanks to the implementation of a custom CAD flow environment, and has allowed functional verification and performance evaluation through an application-aware analysis.

Partición hardware software de un codificador JPEG utilizando escalador de colinas estocástico

La partición hardware/software es una etapa clave dentro del proceso de co-diseño de los sistemas embebidos. En esta etapa se decide qué componentes serán implementados como co-procesadores de hardware y qué componentes serán implementados en un procesador de propósito general. La decisión es tomada a partir de la exploración del espacio de diseño, evaluando un conjunto de posibles soluciones para establecer cuál de estas es la que mejor balance logra entre todas las métricas de diseño. Para explorar el espacio de soluciones, la mayoría de las propuestas, utilizan algoritmos metaheurísticos; destacándose los Algoritmos Genéticos, Recocido Simulado. Esta decisión, en muchos casos, no es tomada a partir de análisis comparativos que involucren a varios algoritmos sobre un mismo problema. En este trabajo se presenta la aplicación de los algoritmos: Escalador de Colinas Estocástico y Escalador de Colinas Estocástico con Reinicio, para resolver el problema de la partición hardware/software. Para validar el empleo de estos algoritmos se presenta la aplicación de este algoritmo sobre un caso de estudio, en particular la partición hardware/software de un codificador JPEG. En todos los experimentos es posible apreciar que ambos algoritmos alcanzan soluciones comparables con las obtenidas por los algoritmos utilizados con más frecuencia.

Comparison of historic exploration with contemporary space policy suggests a retheorisation of settings

The 2008 NASA Astrobiology Roadmap provides one way of theorising this developing field, a way which has become the normative model for the discipline: science-and scholarship-driven funding for space. By contrast, a novel re-evaluation of funding policies is undertaken in this article to reframe astrobiology, terraforming and associated space travel and research. Textual visualisation, discourse and numeric analytical methods, and value theory are applied to historical data and contemporary sources to re-investigate significant drivers and constraints on the mechanisms of enabling space exploration. Two data sets are identified and compared: the business objectives and outcomes of major 15th-17th century European joint-stock exploration and trading companies and a case study of a current space industry entrepreneur company. Comparison of these analyses suggests that viable funding policy drivers can exist outside the normative science and scholarship-driven roadmap. The two drivers identified in this study are (1) the intrinsic value of space as a territory to be experienced and enjoyed, not just studied, and (2) the instrumental, commercial value of exploiting these experiences by developing infrastructure and retail revenues. Filtering of these results also offers an investment rationale for companies operating in, or about to enter, the space business marketplace.

Space Station Design Report 2007

Design Proposal for the Blue Lunar Support Hub The conceptual design of a space station is one of the most challenging tasks in aerospace engineering. The history of the space station Mir and the assembly of the International Space Station demonstrate that even within the assembly phase quick solutions have to be found to cope with budget and technical problems or changing objectives. This report is the outcome of the conceptual design of the Space Station Design Workshop (SSDW) 2007, which took place as an international design project from the 16th to the 21st of July 2007 at the Australian Centre for Field Robotics (ACFR), University of Sydney, Australia. The participants were tasked to design a human-tended space station in low lunar orbit (LLO) focusing on supporting future missions to the moon in a programmatic context of space exploration beyond low Earth orbit (LEO). The design included incorporating elements from systems engineering to interior architecture. The customised, intuitive, rapid-turnaround software tools enabled the team to successfully tackle the complex problem of conceptual design of crewed space systems. A strong emphasis was put on improving the integration of the human crew, as it is the major contributor to mission success, while always respecting the boundary conditions imposed by the challenging environment of space. This report documents the methodology, tools and outcomes of the Space Station Design Workshop during the SSDW 2007. The design results produced by Team Blue are presented.

HERQULES:System level cross-layer design exploration for efficient energy-quality trade-offs

In this paper, we present a unique cross-layer design framework that allows systematic exploration of the energy-delay-quality trade-offs at the algorithm, architecture and circuit level of design abstraction for each block of a system. In addition, taking into consideration the interactions between different sub-blocks of a system, it identifies the design solutions that can ensure the least energy at the "right amount of quality" for each sub-block/system under user quality/delay constraints. This is achieved by deriving sensitivity based design criteria, the balancing of which form the quantitative relations that can be used early in the system design process to evaluate the energy efficiency of various design options. The proposed framework when applied to the exploration of energy-quality design space of the main blocks of a digital camera and a wireless receiver, achieves 58% and 33% energy savings under 41% and 20% error increase, respectively. © 2010 ACM.

An exploration into retrofitting cities with natural design elements - learning from the city of Berlin, Germany

Natural design features in the built environment or biophilic elements are emerging as a potential response to the challenges of climate change, urbanisation and population pressures which have invited issues such as rising urban heat island effect, rising pollution, increased congestion, among others. This concept of living cities was made popular by Professor Tim Beatley in his book titled ‘Biophilic Urbanism’. Evidence of biophilic urbanism can be seen in some cities from around the globe since decoupling environmental pressures from future development is a priority on many agendas. Berlin is an example of a modern economy that has adopted an ecological sustainable development approach to reduce environmental degradation while driving innovation and employment.

In the right space : exploring the dynamics between design, environment and pedagogy

The environments that we inhabit shape our everyday lives, influencing our behaviors and responses (Manu, 2013). As we enter an immersive phase of education in which physical and digital environments become inseparable, should we reconsider the role and importance of design on pedagogical practice? This paper explores the reciprocal cause and effect of space, technology and pedagogy in shaping the design of educational experiences within Queensland University of Technology's collaborative learning spaces.

On-Chip Memory Architecture Exploration Framework for DSP Processor-Based Embedded System on Chip

Today's SoCs are complex designs with multiple embedded processors, memory subsystems, and application specific peripherals. The memory architecture of embedded SoCs strongly influences the power and performance of the entire system. Further, the memory subsystem constitutes a major part (typically up to 70%) of the silicon area for the current day SoC. In this article, we address the on-chip memory architecture exploration for DSP processors which are organized as multiple memory banks, where banks can be single/dual ported with non-uniform bank sizes. In this paper we propose two different methods for physical memory architecture exploration and identify the strengths and applicability of these methods in a systematic way. Both methods address the memory architecture exploration for a given target application by considering the application's data access characteristics and generates a set of Pareto-optimal design points that are interesting from a power, performance and VLSI area perspective. To the best of our knowledge, this is the first comprehensive work on memory space exploration at physical memory level that integrates data layout and memory exploration to address the system objectives from both hardware design and application software development perspective. Further we propose an automatic framework that explores the design space identifying 100's of Pareto-optimal design points within a few hours of running on a standard desktop configuration.

Optimal design of building structures using genetic algorithms

A general framework for multi-criteria optimal design is presented which is well-suited for automated design of structural systems. A systematic computer-aided optimal design decision process is developed which allows the designer to rapidly evaluate and improve a proposed design by taking into account the major factors of interest related to different aspects such as design, construction, and operation.

The proposed optimal design process requires the selection of the most promising choice of design parameters taken from a large design space, based on an evaluation using specified criteria. The design parameters specify a particular design, and so they relate to member sizes, structural configuration, etc. The evaluation of the design uses performance parameters which may include structural response parameters, risks due to uncertain loads and modeling errors, construction and operating costs, etc. Preference functions are used to implement the design criteria in a "soft" form. These preference functions give a measure of the degree of satisfaction of each design criterion. The overall evaluation measure for a design is built up from the individual measures for each criterion through a preference combination rule. The goal of the optimal design process is to obtain a design that has the highest overall evaluation measure - an optimization problem.

Genetic algorithms are stochastic optimization methods that are based on evolutionary theory. They provide the exploration power necessary to explore high-dimensional search spaces to seek these optimal solutions. Two special genetic algorithms, hGA and vGA, are presented here for continuous and discrete optimization problems, respectively.

The methodology is demonstrated with several examples involving the design of truss and frame systems. These examples are solved by using the proposed hGA and vGA.

Tailored seeding geometries for the multi-fidelity design of compression systems

Design optimisation of compressor systems is a computationally expensive problem due to the large number of variables, complicated design space and expense of the analysis tools. One approach to reduce the expense of the process and make it achievable in industrial timescales is to employ multi-fidelity techniques, which utilise more rapid tools in conjunction with the highest fidelity analyses. The complexity of the compressor design landscape is such that the starting point for these optimisations can influence the achievable results; these starting points are often existing (optimised) compressor designs, which form a limited set in terms of both quantity and diversity of the design. To facilitate the multi-fidelity optimisation procedure, a compressor synthesis code was developed which allowed the performance attributes (e.g. stage loadings, inlet conditions) to be stipulated, enabling the generation of a variety of compressors covering a range of both design topology and quality to act as seeding geometries for the optimisation procedures. Analysis of the performance of the multi-fidelity optimisation system when restricting its exploration space to topologically different areas of the design space indicated little advantage over allowing the system to search the design space itself. However, comparing results from optimisations started from seed designs with different aerodynamic qualites indicated an improved performance could be achieved by starting an optimisation from a higher quality point, and thus that the choice of starting point did affect the final outcome of the optimisations. Both investigations indicated that the performance gains through the optimisation were largely defined by the early exploration of the design space where the multi-fidelity speedup could be exploited, thus extending this region is likely to have the greatest effect on performance of the optimisation system. © 2013 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.

Tailored seeding geometries for the multi-fidelity design of compression systems

Design optimisation of compressor systems is a computationally expensive problem due to the large number of variables, complicated design space and expense of the analysis tools. One approach to reduce the expense of the process and make it achievable in industrial timescales is to employ multi-fidelity techniques, which utilise more rapid tools in conjunction with the highest fidelity analyses. The complexity of the compressor design landscape is such that the starting point for these optimisations can influence the achievable results; these starting points are often existing (optimised) compressor designs, which form a limited set in terms of both quantity and diversity of the design. To facilitate the multi-fidelity optimisation procedure, a compressor synthesis code was developed which allowed the performance attributes (e.g. stage loadings, inlet conditions) to be stipulated, enabling the generation of a variety of compressors covering a range of both design topology and quality to act as seeding geometries for the optimisation procedures. Analysis of the performance of the multi-fidelity optimisation system when restricting its exploration space to topologically different areas of the design space indicated little advantage over allowing the system to search the design space itself. However, comparing results from optimisations started from seed designs with different aerodynamic qualites indicated an improved performance could be achieved by starting an optimisation from a higher quality point, and thus that the choice of starting point did affect the final outcome of the optimisations. Both investigations indicated that the performance gains through the optimisation were largely defined by the early exploration of the design space where the multi-fidelity speedup could be exploited, thus extending this region is likely to have the greatest effect on performance of the optimisation system. © 2012 AIAA.

On Modular Design of Field Robotic Systems

Robots are needed to perform important field tasks such as hazardous material clean-up, nuclear site inspection, and space exploration. Unfortunately their use is not widespread due to their long development times and high costs. To make them practical, a modular design approach is proposed. Prefabricated modules are rapidly assembled to give a low-cost system for a specific task. This paper described the modular design problem for field robots and the application of a hierarchical selection process to solve this problem. Theoretical analysis and an example case study are presented. The theoretical analysis of the modular design problem revealed the large size of the search space. It showed the advantages of approaching the design on various levels. The hierarchical selection process applies physical rules to reduce the search space to a computationally feasible size and a genetic algorithm performs the final search in a greatly reduced space. This process is based on the observation that simple physically based rules can eliminate large sections of the design space to greatly simplify the search. The design process is applied to a duct inspection task. Five candidate robots were developed. Two of these robots are evaluated using detailed physical simulation. It is shown that the more obvious solution is not able to complete the task, while the non-obvious asymmetric design develop by the process is successful.

Automated design of self-stabilization

Self-stabilization is a property of a distributed system such that, regardless of the legitimacy of its current state, the system behavior shall eventually reach a legitimate state and shall remain legitimate thereafter. The elegance of self-stabilization stems from the fact that it distinguishes distributed systems by a strong fault tolerance property against arbitrary state perturbations. The difficulty of designing and reasoning about self-stabilization has been witnessed by many researchers; most of the existing techniques for the verification and design of self-stabilization are either brute-force, or adopt manual approaches non-amenable to automation. In this dissertation, we first investigate the possibility of automatically designing self-stabilization through global state space exploration. In particular, we develop a set of heuristics for automating the addition of recovery actions to distributed protocols on various network topologies. Our heuristics equally exploit the computational power of a single workstation and the available parallelism on computer clusters. We obtain existing and new stabilizing solutions for classical protocols like maximal matching, ring coloring, mutual exclusion, leader election and agreement. Second, we consider a foundation for local reasoning about self-stabilization; i.e., study the global behavior of the distributed system by exploring the state space of just one of its components. It turns out that local reasoning about deadlocks and livelocks is possible for an interesting class of protocols whose proof of stabilization is otherwise complex. In particular, we provide necessary and sufficient conditions – verifiable in the local state space of every process – for global deadlock- and livelock-freedom of protocols on ring topologies. Local reasoning potentially circumvents two fundamental problems that complicate the automated design and verification of distributed protocols: (1) state explosion and (2) partial state information. Moreover, local proofs of convergence are independent of the number of processes in the network, thereby enabling our assertions about deadlocks and livelocks to apply on rings of arbitrary sizes without worrying about state explosion.

Probabilistic Approach to Design of Large Antenna Arrays

2000 Mathematics Subject Classification: 78A50