Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Hugo A. Andrade is active.

Publication


Featured researches published by Hugo A. Andrade.


field-programmable technology | 2010

A graphical programming and design environment for FPGA-based hardware

Guoqiang Wang; Trung N. Tran; Hugo A. Andrade

In this paper we present a graphical programming environment for hardware designs targeted at FPGA devices. We first introduce LabVIEW™, a scientific software system, and its modular virtual instrumentation programming paradigm. Then, we discuss how LabVIEW FPGA enables application domain experts without prior knowledge of hardware description languages (HDLs) to program reconfigurable hardware devices. Initially many LabVIEW FPGA users were high-level (software centric) application domain experts in the area of control with prior knowledge of LabVIEW, where they benefited from a new fast and reliable target, namely FPGAs. Recently, we have found that system level integrators with lower level hardware design interest, but still no working experience in detailed HDL coding, have been able to use LabVIEW FPGA to successfully implement high-speed hardware designs. Here we focus on how LabVIEW facilitates reconfigurable hardware designs for applications of ultra-high speed control, complex timing and synchronization, hardware-in-the-loop (HIL) testing, etc. Specifically, we detail its modeling, simulation, and debugging capabilities as well as its rigorous semantics as a programming and deployment framework. Furthermore, we use application use cases to illustrate how LabVIEW FPGA can support a flexible, reliable and cost-effective hardware design.


international conference on hardware/software codesign and system synthesis | 2011

Correct and non-defensive glue design using abstract models

Stavros Tripakis; Hugo A. Andrade; Arkadeb Ghosal; Rhishikesh Limaye; Kaushik Ravindran; Guoqiang Wang; Guang Yang; Jacob Kormerup; Ian Wong

Current hardware design practice often relies on integration of components, some of which may be IP or legacy blocks. While integration eases design by allowing modularization and component reuse, it is still done in a mostly ad hoc manner. Designers work with descriptions of components that are either informal or incomplete (e.g., documents in English, structural but non-behavioral specifications in IP-XACT) or too low-level (e.g., HDL code), and have little to no automatic support for stitching the components together. Providing such support is the glue design problem. This paper addresses this problem using a model-based approach. The key idea is to use high-level models, such as dataflow graphs, that enable efficient automated analysis. The analysis can be used to derive performance properties of the system (e.g., component compatibility, throughput, etc.), optimize resource usage (e.g., buffer sizes), and even synthesize low-level code (e.g., control logic). However, these models are only abstractions of the real system, and often omit critical information. As a result, the analysis outcomes may be defensive (e.g., buffers that are too big) or even incorrect (e.g., buffers that are too small). The paper examines these situations and proposes a correct and non-defensive design methodology that employs the right models to explore accurate performance and resource trade-offs.


international conference on hardware/software codesign and system synthesis | 2016

Time in cyber-physical systems

Aviral Shrivastava; Patricia Derler; Ya-Shian Li Baboudr; Kevin Stanton; Mohammad Khayatian; Hugo A. Andrade; John C. Eidson; Sundeep Chandhoke

Many modern cyber-physical systems (CPS), especially industrial automation systems, require the actions of multiple computational systems to be performed at much higher rates and more tightly synchronized than is possible with ad hoc designs. Time is the common entity that computing and physical systems in CPS share, and correct interfacing of that is essential to flawless functionality of a CPS. Fundamental research is needed on ways to synchronize clocks of computing systems to a high degree, and on design methods that enable building blocks of CPS to perform actions at specified times. To realize the potential of CPS in the coming decades, suitable ways to specify distributed CPS applications are needed, including their timing requirements, ways to specify the timing of the CPS components (e.g. sensors, actuators, computing platform), timing analysis to determine if the application design is possible using the components, confident top-down design methodologies that can ensure that the system meets its timing requirements, and ways and methodologies to test and verify that the system meets the timing requirements. Furthermore, strategies for securing timing need to be carefully considered at every CPS design stage and not simply added on. This paper exposes these challenges of CPS development, points out limitations of previous approaches, and provides some research directions towards solving these challenges.


design automation conference | 2012

Static dataflow with access patterns: semantics and analysis

Arkadeb Ghosal; Rhishikesh Limaye; Kaushik Ravindran; Stavros Tripakis; Ankita Prasad; Guoqiang Wang; Trung N. Tran; Hugo A. Andrade

Signal processing and multimedia applications are commonly modeled using Static/Cyclo-Static Dataflow (SDF/CSDF) models. SDF/CSDF explicitly specifies how much data is produced and consumed per firing during computation. This results in strong compile-time analyzability of many useful execution properties such as deadlock absence, channel boundedness, and throughput. However, SDF/CSDF is limited in its ability to capture how data is accessed in time. Hence, using these models often leads to implementations that are suboptimal (i.e., use more resources than necessary) or even incorrect (i.e., use insufficient resources). In this work, we advance a new model called Static Dataflow with Access Patterns (SDF-AP) that captures the timing of data accesses (for both production and consumption). This paper formalizes the semantics of SDF-AP, defines key properties governing model execution, and discusses algorithms to check these properties under correctness and resource constraints. Results are presented to evaluate these analysis algorithms on practical applications modeled by SDF-AP.


field-programmable custom computing machines | 2012

A Heterogeneous Architecture for Evaluating Real-Time One-Dimensional Computational Fluid Dynamics on FPGAs

Isaac Liu; Edward A. Lee; Matthew Viele; Guoqiang Wang; Hugo A. Andrade

Many fuel systems for diesel engines are developed with the help of commercial one-dimensional computational fluid dynamics (1D CFD) solvers that model and simulate the behavior of fluid flow through the interconnected pipes off-line. This paper presents a novel framework to evaluate 1D CFD models in real time on an FPGA. This improves fuel pressure estimation and closes the loop on fuel delivery, allowing for a cleaner and more efficient engine. The real-time requirements of the models are defined by the physics and geometry of the problem being solved. In this framework, the interconnected pipes are partitioned into individual sub-volumes that compute their pressure and flow rate every time step based upon neighboring values. We use timing-based synchronization and multiple Precision Timed (PRET) processor cores to ensure the real-time constraints are met. Leveraging the programmability of FPGAs, we use a configurable heterogeneous architecture to save hardware resources. Several examples are presented along with the implementation results after place and route for a Xilinx Virtex 6 FPGA. The results demonstrate the resource savings and scalability of our framework, confirming the feasibility of our approach -- solving 1D CFD models in real time on FPGAs.


reconfigurable computing and fpgas | 2015

Towards a reconfigurable distributed testbed to enable advanced research and development of timing and synchronization in cyber-physical systems

Hugo A. Andrade; Patricia Derler; John C. Eidson; Ya Shian Li-Baboud; Aviral Shrivastava; Kevin Stanton

Timing and synchronization play a key role in cyber-physical systems (CPS). Precise timing, as often required in safety-critical CPS, depends on hardware support for enforcement of periodic measure, compute, and actuate cycles. For general CPS, designers use a combination of application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) and conventional microprocessors. Microprocessors as well as commonly used computer languages and operating systems are essentially devoid of any explicit support for precise timing and synchronization. Modern computer science and microprocessor design has effectively removed time from the abstractions used by designers with the result that time is regarded as a performance metric rather than a correctness specification or criterion. There are interesting proposals and avenues of research to correct this situation, but the barrier is quite high for conducting proof of concept studies or collaborative research and development. This paper proposes a conceptual design and use model for a reconfigurable testbed designed specifically to support exploratory research, proof of concept, and collaborative work to introduce explicit support for time and synchronization in microprocessors, reconfigurable fabrics, language and design system architecture for time-sensitive CPS. Reconfigurable computing is used throughout the system in several roles: as part of the prototyping platform infrastructure, the measurement and control system, and the application system under test.


design automation conference | 2017

A Testbed to Verify the Timing Behavior of Cyber-Physical Systems: Invited

Aviral Shrivastava; Mohammadreza Mehrabian; Mohammad Khayatian; Patricia Derler; Hugo A. Andrade; Kevin Stanton; YaShian Li-Baboud; Edward Griffor; John C. Eidson

Time is a foundational aspect of Cyber-Physical Systems (CPS). Correct time and timing of system events are critical to optimized responsiveness to the environment, in terms of timeliness, accuracy, and precision in the knowledge, measurement, prediction, and control of CPS behavior. However, both the specification and verification of timing requirements of the CPS are typically done in an ad-hoc manner. While feasible, the system can become costly and difficult to analyze and maintain, and the process of implementing and verifying correct timing behavior can be error-prone. Towards the development of a verification testbed for testing timing behavior in tools and platforms with explicit time support, this paper first describes a way to express the various kinds of timing constraints in distributed CPS. Then, we outline the design and initial implementation of a distributed testbed to verify the timing of a distributed CPS analytically through a systematic framework. Finally, we illustrate the use of the verified timing testbed on two distributed CPS case studies.


signal processing systems | 2016

Tokens vs. Signals: On Conformance between Formal Models of Dataflow and Hardware

Stavros Tripakis; Rhishikesh Limaye; Kaushik Ravindran; Guoqiang Wang; Hugo A. Andrade; Arkadeb Ghosal

Designing hardware often involves several types of modeling and analysis, e.g., in order to check system correctness, to derive performance properties such as throughput, to optimize resource usages (e.g., buffer sizes), and to synthesize parts of a circuit (e.g., control logic). Working directly with low-level hardware models such as finite-state machines (FSMs) to answer such questions is often infeasible, e.g., due to state explosion. Instead, designers often use dataflow models such as SDF and CSDF, which are more abstract than FSMs, and less expensive to use since they come with more efficient analysis algorithms. However, dataflow models are only abstractions of the real hardware, and often omit critical information. This raises the question, when can one say that a certain dataflow model faithfully captures a given piece of hardware? The question is of more than simply academic interest. Indeed, as illustrated in this paper, dataflow-based analysis outcomes may sometimes be defensive (e.g., buffers that are too big) or even incorrect (e.g., buffers that are too small). To answer the question of faithfully capturing hardware using dataflow models, we develop a formal conformance relation between the heterogeneous formalisms of (1) finite-state machines with synchronous semantics, typically used to model synchronous hardware, and (2) asynchronous processes communicating via queues, used as a formal model for dataflow. The conformance relation preserves performance properties such as worst-case throughput and latency.


adaptive hardware and systems | 2010

LabVIEW™: A graphical system design environment for adaptive hardware/software systems

Guoqiang Wang; Hugo A. Andrade

Modern embedded real-time systems are required to adapt reliably and deterministically to a changing environment due to external or internal conditions. Reconfigurable platforms are shown to be an effective architecture for implementing efficient adaptive systems. The National Instruments Reconfigurable I/O (RIO) hardware platform (Fig. 1) combines a networked realtime application processor with re-configurable FPGAs (Field Programmable Gate Array) for co-processing, low-level timing and I/O control, as well as configurable front-end I/O modules that interface directly to the external environment [1]. This hardware is complemented by a unified run-time system (Fig. 2) generated by the LabVIEW™ graphical development environment [2] that provides a visual formalism with rigorous syntax, semantics, analysis, and code-generation capabilities for system level design (Fig. 3). RIO subsystems can be connected in a distributed network to provide adaptability at a larger system scope.


Eurasip Journal on Embedded Systems | 2008

A Rapid Prototyping Tool for Embedded, Real-Time Hierarchical Control Systems

Ram Rajagopal; Subramanian Ramamoorthy; Lothar Wenzel; Hugo A. Andrade

Laboratory Virtual Instrumentation and Engineering Workbench (LabVIEW) is a graphical programming tool based on the dataflow language G. Recently, runtime support for a hard real-time environment has become available for LabVIEW, which makes it an option for embedded systems prototyping. Due to its characteristics, the environment presents itself as an ideal tool for both the design and implementation of embedded software. In this paper, we study the design and implementation of embedded software by using G as the specification language and the LabVIEW RT real-time platform. One of the main advantages of this approach is that the environment leads itself to a very smooth transition from design to implementation, allowing for powerful cosimulation strategies (e.g., hardware in the loop, runtime modeling). We characterize the semantics and formal model of computation of G. We compare it to other models of computation and develop design rules and algorithms to propose sound embedded design in the language. We investigate the specification and mapping of hierarchical control systems in LabVIEW and G. Finally, we describe the development of a state-of-the-art embedded motion control system using LabVIEW as the specification, simulation and implementation tool, using the proposed design principles. The solution is state-of-the-art in terms of flexibility and control performance.

Collaboration


Dive into the Hugo A. Andrade's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge