70,045 research outputs found
Desynchronization: Synthesis of asynchronous circuits from synchronous specifications
Asynchronous implementation techniques, which measure logic delays at run time and activate registers accordingly, are inherently more robust than their synchronous counterparts, which estimate worst-case delays at design time, and constrain the clock cycle accordingly. De-synchronization is a new paradigm to automate the design of asynchronous circuits from synchronous specifications, thus permitting widespread adoption of asynchronicity, without requiring special design skills or tools. In this paper, we first of all study different protocols for de-synchronization and formally prove their correctness, using techniques originally developed for distributed deployment of synchronous language specifications. We also provide a taxonomy of existing protocols for asynchronous latch controllers, covering in particular the four-phase handshake protocols devised in the literature for micro-pipelines. We then propose a new controller which exhibits provably maximal concurrency, and analyze the performance of desynchronized circuits with respect to the original synchronous optimized implementation. We finally prove the feasibility and effectiveness of our approach, by showing its application to a set of real designs, including a complete implementation of the DLX microprocessor architectur
Recommended from our members
EXEL : a language for interactive behavioral synthesis
This paper describes a new input language for behavioral synthesis called EXEL. EXEL is a powerful language that permits the user to specify partially designed structures in the language. It employs a mixed graphic/textual user interface to enhance user interactivity. EXEL's design model is comprehensive: it permits specification of synchronous and asynchronous behavior, and allows specification of general timing constraints. A flexible type construct permits the user to define operators and components to be used in the description. Finally, it simplifies compilation by using a small set of constructs for specifying timing and asynchronouos behavior. The compiler for EXEL runs on SUN-3 workstations and is written in C and SUNVIEW
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables
one to describe precisely their dynamical behavior during cut elimination, by
considering formulas as games on which proofs induce strategies. We are
specifically interested here in relating two such semantics of linear logic, of
very different flavor, which both take in account concurrent features of the
proofs: asynchronous games and concurrent games. Interestingly, we show that
associating a concurrent strategy to an asynchronous strategy can be seen as a
semantical counterpart of the focusing property of linear logic
Formal Specification and Verification of Fully Asynchronous Implementations of the Data Encryption Standard
This paper presents two formal models of the Data Encryption Standard (DES),
a first using the international standard LOTOS, and a second using the more
recent process calculus LNT. Both models encode the DES in the style of
asynchronous circuits, i.e., the data-flow blocks of the DES algorithm are
represented by processes communicating via rendezvous. To ensure correctness of
the models, several techniques have been applied, including model checking,
equivalence checking, and comparing the results produced by a prototype
automatically generated from the formal model with those of existing
implementations of the DES. The complete code of the models is provided as
appendices and also available on the website of the CADP verification toolbox.Comment: In Proceedings MARS 2015, arXiv:1511.0252
Asynchronous displays for multi-UV search tasks
Synchronous video has long been the preferred mode for controlling remote robots with other modes such as asynchronous control only used when unavoidable as in the case of interplanetary robotics. We identify two basic problems for controlling multiple robots using synchronous displays: operator overload and information fusion. Synchronous displays from multiple robots can easily overwhelm an operator who must search video for targets. If targets are plentiful, the operator will likely miss targets that enter and leave unattended views while dealing with others that were noticed. The related fusion problem arises because robots' multiple fields of view may overlap forcing the operator to reconcile different views from different perspectives and form an awareness of the environment by "piecing them together". We have conducted a series of experiments investigating the suitability of asynchronous displays for multi-UV search. Our first experiments involved static panoramas in which operators selected locations at which robots halted and panned their camera to capture a record of what could be seen from that location. A subsequent experiment investigated the hypothesis that the relative performance of the panoramic display would improve as the number of robots was increased causing greater overload and fusion problems. In a subsequent Image Queue system we used automated path planning and also automated the selection of imagery for presentation by choosing a greedy selection of non-overlapping views. A fourth set of experiments used the SUAVE display, an asynchronous variant of the picture-in-picture technique for video from multiple UAVs. The panoramic displays which addressed only the overload problem led to performance similar to synchronous video while the Image Queue and SUAVE displays which addressed fusion as well led to improved performance on a number of measures. In this paper we will review our experiences in designing and testing asynchronous displays and discuss challenges to their use including tracking dynamic targets. © 2012 by the American Institute of Aeronautics and Astronautics, Inc
Recommended from our members
Structured modeling for VHDL synthesis
This report will describe a proposed modeling style for the use of the VHSIC Hardware Description Language (VHDL) in design synthesis. We will describe the operations and underlying assumptions of four design models currently understood and used in practice by designers: combinational logic, functional descriptions (involving clocked components such as counters), register transfer (data path) descriptions, and behavioral (instruction set or processor) designs. We will illustrate the various uses of the VHDL description styles (structural, dataflow and behavioral) to represent characteristics of each of these design models. Emphasis is placed on how VHDL constructs should be used in order to synthesize optimal designs
Formalization and Correctness of the PALS Architectural Pattern for Distributed Real-Time Systems
Many Distributed Real-Time Systems (DRTS), such as integrated modular avionics systems and distributed control systems in
motor vehicles, are made up of a collection of components communicating asynchronously among themselves and with their environment
that must change their state and respond to environment inputs within
hard real-time bounds. Such systems are often safety-critical and need
to be certi???ed; but their certi???cation is currently very hard due to their
distributed nature. The Physically Asynchronous Logically Synchronous
(PALS) architectural pattern can greatly reduce the design and veri???cation complexities of achieving virtual synchrony in a DTRS. This work
presents a formal speci???cation of PALS as a formal model transformation that maps a synchronous design, together with a set of performance
bounds of the underlying infrastructure, to a formal DRTS speci???cation
that is semantically equivalent to the synchronous design. This semantic
equivalence is proved, showing that the formal veri???cation of temporal
logic properties of the DRTS can be reduced to their veri???cation on the
much simpler synchronous design. An avionics system case study is used
to illustrate the usefulness of PALS for formal verification purposes.unpublishednot peer reviewe
Parallel symbolic state-space exploration is difficult, but what is the alternative?
State-space exploration is an essential step in many modeling and analysis
problems. Its goal is to find the states reachable from the initial state of a
discrete-state model described. The state space can used to answer important
questions, e.g., "Is there a dead state?" and "Can N become negative?", or as a
starting point for sophisticated investigations expressed in temporal logic.
Unfortunately, the state space is often so large that ordinary explicit data
structures and sequential algorithms cannot cope, prompting the exploration of
(1) parallel approaches using multiple processors, from simple workstation
networks to shared-memory supercomputers, to satisfy large memory and runtime
requirements and (2) symbolic approaches using decision diagrams to encode the
large structured sets and relations manipulated during state-space generation.
Both approaches have merits and limitations. Parallel explicit state-space
generation is challenging, but almost linear speedup can be achieved; however,
the analysis is ultimately limited by the memory and processors available.
Symbolic methods are a heuristic that can efficiently encode many, but not all,
functions over a structured and exponentially large domain; here the pitfalls
are subtler: their performance varies widely depending on the class of decision
diagram chosen, the state variable order, and obscure algorithmic parameters.
As symbolic approaches are often much more efficient than explicit ones for
many practical models, we argue for the need to parallelize symbolic
state-space generation algorithms, so that we can realize the advantage of both
approaches. This is a challenging endeavor, as the most efficient symbolic
algorithm, Saturation, is inherently sequential. We conclude by discussing
challenges, efforts, and promising directions toward this goal
Non-catalytic bromination of benzene: a combined computational and experimental study
The non-catalytic bromination of benzene is shown experimentally to require high 5-14M concentrations of bromine in order to proceed at ambient temperatures to form predominantly bromobenzene, along with detectable (The non-catalytic bromination of benzene is shown experimentally to require high 5-14M concentrations of bromine in order to proceed at ambient temperatures to form predominantly bromobenzene, along with detectable (The non-catalytic bromination of benzene is shown experimentally to require high 5-14M concentrations of bromine in order to proceed at ambient temperatures to form predominantly bromobenzene, along with detectable
- …