The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] validation(47hit)

41-47hit(47hit)

  • Simulation & Measurement of TCP/IP over ATM Wide Area Networks

    Georgios Y. LAZAROU  Victor S. FROST  Joseph B. EVANS  Douglas NIEHAUS  

     
    PAPER-ATM switch interworking

      Vol:
    E81-B No:2
      Page(s):
    307-314

    Predicting the performance of high speed wide area ATM networks (WANs) is a difficult task. Evaluating the performance of these systems by means of mathematical models is not yet feasible. As a result, the creation of simulation models is usually the only means of predicting and evaluating the performance of such systems. In this paper, we use measurements to validate simulation models of TCP/IP over high speed ATM wide area networks. Validation of simulations with measurements is not common; however, it is needed so that simulation models can be used with confidence to accurately characterize the performance of ATM WANs. In addition, the appropriate level of complexity of the simulation models needs to be determined. The results show that under appropriate conditions simulation models can accurately predict the performance of complex high speed ATM wide area networks. This work also shows that the user perceived performance is dependent on host processing demands.

  • Statechart Methodology for the Design, Validation, and Synthesis of Large Scale Asynchronous Systems

    Rakefet KOL  Ran GINOSAR  Goel SAMUEL  

     
    PAPER-Specification Description

      Vol:
    E80-D No:3
      Page(s):
    308-314

    We apply a novel methodology, based on statecharts, to the design of large scale asynchronous systems. The design is specified at multiple levels, simulated, animated, and compiled into synthesizable VHDL code by using the ExpressV-HDL CAD tool. We add a validation sub-system to chech correct operation. ExpressV-HDL is originally synchronous, but we employ it for asynchronous design by avoiding any design dependence on the clock, and simulating with fast clock and on-line delays. The tool is demonstrated through a simple FSM. The synthesized synchronous circuit can be converted into an asynchronous one. Some results of a post-synthesis conversion example are given.

  • Commit-Order Oriented Validation Scheme for Transaction Scheduling in Mobile Distributed Database Systems: COOV

    Youngkon LEE  Songchun MOON  

     
    PAPER-Distributed Systems

      Vol:
    E80-D No:1
      Page(s):
    10-14

    In this paper, we propose a new transaction numbering scheme and a new validation scheme for controlling transactions optimistically in client-server architectural mobile distributed database systems (MDDBSs). In the system, mobile units (MUs) request transaction-related services, e.g., concurrency control, commit process, then the mobile support stations (MSSs) provide the required services. The mobile computing environment makes it very difficult for each MU to assign unique transaction number to transactions since it is allowed to move in communication disconnected states. Besides, validating transactions numbered by the previous transaction numbering scheme could wait indefinitely in the case of data transfer delay. Thus, we propose a new transaction numbering scheme called datatransfer time oriented transaction numbering scheme (DATTO) ,in which we can remove waiting time for validation by determining validation-start time with data-transfer completion time. However, if the previous validation scheme for the static environment is directly applied transactions numbered by DATTO, undesirable results could occur in abnormal cases due to latency on the wireless communication. Thus, we also propose a new validation scheme, called commit-order oriented validation (COOV) ,which is always able to produce correct results by applying backward validation to the abnormal cases.

  • Validation of UDL/I Test Suites and UDL/I Simulation/Synthesis Environment

    Hiroyuki KANBARA  Satoshi YOKOTA  

     
    PAPER

      Vol:
    E78-A No:12
      Page(s):
    1749-1754

    UDL/I test suites and UDL/I Simulation/Synthesis Environment had been developed separately in parallel. Both were designed from syntax and semantics definition of UDL/I Language Reference Manual. Through test of the UDL/I Simulation/Synthesis Environment using the UDL/I test suites, quality of the test suites and the environment had been improved. Finally all the testing result matched with expected one. It was validated that both the test suites and the environment followed UDL/I language specification.

  • High-Level VLSI Design Specification Validation Using Algorithmic Debugging

    Jiro NAGANUMA  Takeshi OGURA  Tamio HOSHINO  

     
    PAPER

      Vol:
    E77-A No:12
      Page(s):
    1988-1998

    This paper proposes a new environment for high-level VLSI design specification validation using "Algorithmic Debugging" and evaluates its benefits on three significant examples (a protocol processor, an 8-bit CPU, and a Prolog processor). A design is specified at a high-level using the structured analysis (SA) method, which is useful for analyzing and understanding the functionality to be realized. The specification written in SA is transformed into a logic programming language and is simulated in it. The errors (which terminate with an incorrect output in the simulation) included in the three large examples are efficiently located by answering junt a few queries from the algorithmic debugger. The number of interactions between the designer and the debugger is reduced by a factor of ten to a hundred compared to conventional simulation based validation methodologies. The correct SA specification can be automatically translated into a Register Transfer Level (RTL) specification suitable for logic synthesis. In this environment, a designer is freed from the tedious task of debugging a RTL specification, and can concentrate on the design itself. This environment promises to be an important step towards efficient high-level VLSI design specification validation.

  • On the Complexity of Protocol Validation Problems for Protocols with Bounded Capacity Channels

    Yoshiaki KAKUDA  Yoshihiro TAKADA  Tohru KIKUNO  

     
    PAPER

      Vol:
    E77-A No:4
      Page(s):
    658-667

    In this paper, it is proven that the following three decision problems on validation of protocols with bounded capacity channels are NP-complete. (1) Given a protocol with the channel capacity being 1, determine whether or not there exist deadlocks in the protocol. (2) Given a protocol with the channel capacity being 1, determine whether or not there exist unspecified receptions in the protocol. (3) Given a protocol with the channel capacity being 2, determine whether or not there exist overflows such that the channel capacity is not bounded by 1 in the protocol. These results suggest that, even when all channeles in a protocol are bounded by 1 or 2, protocol validation should be in general interactable. It also clarifies the boundary of computational complexity of protocol validation problems because the channel capacity 0 does not allow protocols to transmit and recieve messages.

  • PDM: Petri Net Based Development Methodology for Distributed Systems

    Mikio AOYAMA  

     
    INVITED PAPER

      Vol:
    E76-A No:10
      Page(s):
    1567-1579

    This article discusses on PDM (Petri net based Development Methodology) which integrates approaches, modeling methods, design methods and analysis methods in a coherent manner. Although various development techniques based on Petri nets have demonstrated advantages over conventional techniques, those techniques are rather ad hoc and lack an overall picture on entire development process. PDM anticipates to provide a refernce process model to develop distributed systems with various Petri net based development methods. Behavioral properties of distrbuted systems can be an appropriate application domain of PDM.

41-47hit(47hit)