By Topic

Proceedings of the 29th Annual Simulation Symposium

8-11 April 1996

Filter Results

Displaying Results 1 - 25 of 29
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • Efficient trace-sampling simulation techniques for cache performance analysis

    Publication Year: 1996, Page(s):54 - 63
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    We focus on the simulation techniques in order to reduce the space and time requirements for simulating large caches. First, we propose a space sampling technique to perform trace reduction for time and space. Our approach is to perform stratified sampling based on an index of locality. Our results show that the technique can provide accurate estimate of performance metric using only a small porti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trojan: a high-performance simulator for shared memory architectures

    Publication Year: 1996, Page(s):44 - 53
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    The paper presents an execution driven simulator called Trojan, which is an extended version of MIT Proteus, for evaluating the performance of parallel shared memory machines. The key features of Trojan are: (1) it simulates efficiently both process model based (e.g., SPLASH) and thread model based applications (e.g., SPLASH2) (a “copy on write” mechanism is used on process based appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural simulation system for M.f.a.s.t

    Publication Year: 1996, Page(s):221 - 232
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    The paper discusses the simulation system used to verify the architecture of the Mwave folded array signal transform (M.f.a.s.t.) processor, a single chip scalable very long instruction word (VLIW) processor array being developed by IBM Microelectronics. M.f.a.s.t. simulation, at this stage of development of the architecture, is at a very high abstract level and is intended to meet the requirement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling analysis using discrete event simulation

    Publication Year: 1996, Page(s):148 - 154
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Describes a production shop which needed to undertake schedule analyses at the macro level of planning and explain the methods of using simulation to obtain valid, credible schedule analyses quickly. After a discussion of the simulation model itself, we present actual simulation results and conclusions. These successful simulation results help the production shop attain nimble adaptation to produc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative analysis of neighbor greeting protocols: ARP versus ES-IS

    Publication Year: 1996, Page(s):71 - 80
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Neighbor greeting involves a process used by network nodes to achieve reachability and discovery. The Address Resolution Protocol (ARP) and End-System to Intermediate-System Routing Exchange Protocol (ES-IS) are competing approaches to the neighbor greeting problem. This paper provides a detailed analysis of the performance of these protocols, and a better understanding of the performance tradeoff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic simulator of real-time scheduling algorithms

    Publication Year: 1996, Page(s):242 - 249
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    We describe a language for defining scheduling algorithms for hard real-time systems and a tool to simulate the behavior of such systems on a predefined task set. The language is suitable for describing a real-time system composed of a task set, resources and a scheduling algorithm. The tasks can either be periodic or aperiodic, dependent or independent and the time constraints (e.g. deadlines) ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of adaptive risk vs. adaptive aggressiveness control in parallel and distributed simulation

    Publication Year: 1996, Page(s):90 - 96
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The performance of adaptive protocols using either aggressiveness control, risk control or both are compared to each other and an optimistic protocol. Empirical results are presented from execution on a CM-5 using up to 256 nodes. The results demonstrate that between the aggressiveness and risk control protocols, the aggressiveness control protocol performs better overall; however, risk control pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative analysis of various Time Warp algorithms implemented in the WARPED simulation kernel

    Publication Year: 1996, Page(s):107 - 116
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    The Time Warp mechanism conceptually has the potential to speedup discrete event simulations on parallel platforms. However, practical implementations of optimistic mechanism have been hindered by several drawbacks, such as large memory usage, excessive rollbacks (instability), and wasted lookahead computation. Several optimizations and variations to the original Time Warp algorithm have been pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of scientific programs on parallel architectures with MIMESIS environment

    Publication Year: 1996, Page(s):36 - 43
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    The paper presents how a scientific application written using an SPMD programming model with message passing can be modeled and simulated. This description is based on the counting of basic operations and the recognition of known kernels. A Fortran analyzer was built to automatically generate a model of such an application for the simulation tool of the MIMESIS project, developed at EDF (Electrici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed simulation of parallel executions

    Publication Year: 1996, Page(s):15 - 24
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    We propose a new practical technique for the distributed execution-driven simulation of parallel computers. Our simulation methodology allows complete verbalization of the design at all levels and achieves good performance by preserving and exploiting the parallelism of the parallel program being simulated. With our technique it is possible to decouple the simulation of the execution of a parallel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation tool for design error models utilizing error compression and sampling

    Publication Year: 1996, Page(s):212 - 220
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Digital systems design and verification becomes more difficult as the size of the system grows. To solve this problem, many CAD tools have been developed, including simulation. However, as systems increase in size and complexity, simulating the system becomes very costly, both in time and space. For most cases that use simulation, only a subset of the total possible simulation patterns is used for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulating the DASH architecture in HASE

    Publication Year: 1996, Page(s):137 - 146
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    HASE (Hierarchical computer Architecture design and Simulation Environment) allows for the rapid development and exploration of computer architectures at multiple levels of abstraction, encompassing both hardware and software. The user interacts with HASE via an X-Windows/Motif graphical interface, and one of the main forms of output is an animation of the design window. The DASH architecture was ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of simulation model components for model generation and a model library

    Publication Year: 1996, Page(s):193 - 201
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Model reuse is one of the main reasons for developing a model library. In particular, during the process of establishing a model library, two aspects have to be considered: model generation and database operations, therefore, the stored model components should have an effective representation method to cope with the above requirements. We propose a representation methodology including feature desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NAMS: network automated modeler and simulator

    Publication Year: 1996, Page(s):65 - 70
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Discrete-event simulation has been widely used to analyze communication networks, due to the increased number of networks in existence, and the inability of mathematical modeling to handle their greater complexity. Although there is a large number of simulation packages designed specifically for modeling communication systems with a point-and-click GUI for entering network models and parameters, l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From multibody systems modeling to distributed real-time simulation

    Publication Year: 1996, Page(s):234 - 241
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    We present an expandable simulation framework. This system, called DREAM (deformable and rigid objects efficient for simulation and modeling), provides modelling, analysis and real-time simulation tools for rigid and deformable multibody systems. DREAM modelling tool consists of a unified abstract model which integrates traditional physically based models such as rigid solids, mass-spring meshes, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation algorithm for source-terminal communication network reliability

    Publication Year: 1996, Page(s):155 - 161
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    In order to evaluate the capacity of a communication network architecture to resist faults of some of its components, several reliability models are extensively used. We consider the source-terminal network reliability parameter. The exponential time complexity of exact methods for its evaluation leads to the use of simulation schemes. We present a new simulation algorithm, which recursively chang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generic simulation models of communication systems

    Publication Year: 1996, Page(s):81 - 88
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    One of the most significant criticisms on traditional simulation modeling has been the lack of reusability. However, the cost of using simulation technology can be reduced through the extensive application of model reusability. We address the question of reusability by showing how to create, in a generic way, models of complex communication network components from a library of basic models. These ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation analysis of a real-time database buffer manager

    Publication Year: 1996, Page(s):252 - 259
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Real-time database management systems research has not focused efforts on the specific low level systems support requirements for availability, timeliness and predictability of data access. An important aspect of such database system's support is the secondary access schemes and in particular database disk buffer allocation schemes. Timing constraints on critical and non-critical transactions in r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Length-based blocking and local estimations in distributed simulation: a case study

    Publication Year: 1996, Page(s):97 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Investigates the use of a preventive length-based blocking strategy associated with local estimations. A logical process must block until the length of its input queue becomes greater than a threshold L min. By blocking one can reduce the number of time errors, in order to allow the local estimations to handle the remaining time errors more efficiently. We seek for an empirical optimal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assessing the performance of multiprocessor architectures through SWN models simulation: a case study in the field of plant automation systems

    Publication Year: 1996, Page(s):118 - 127
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Presents a simulation study of a hypercube architecture of complex nodes. The goal of the simulation experiments is to compare two possible architectural solutions for the complex nodes, and to study the hypercube behaviour under different types of workload. The models have been expressed in the formalism of stochastic well-formed nets (SWNs), which is a class of high-level stochastic Petri nets, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed simulation of parallel computers

    Publication Year: 1996, Page(s):25 - 34
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    We present our work on the simulation of distributed memory parallel computers. We design a distributed simulator that takes as input an application written for a MIMD computer and run it on a workstation cluster with just a recompilation of the code. The hardware of the target machine is simulated so that the behavior of the application is identical to a native run on the simulated computer with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of state saving mechanisms for time warp synchronized parallel discrete event simulation

    Publication Year: 1996, Page(s):5 - 14
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The state saving mechanism constitutes an essential part of any system in which erroneous or undesired executions can be undone by rolling back the system state. One such application is optimistically synchronized parallel discrete event simulation (PDES) systems based on the time warp synchronization mechanism. In this type of system the state saving and restoration mechanism is essential to the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A symbolic simulation approach in resolving signals' correlation

    Publication Year: 1996, Page(s):203 - 211
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The probabilistic approach is widely used to analyze the power dissipation of digital circuits. The goal of the work is twofold. First, to present a method for providing an evaluation package of signal probabilities and transition densities that can be applied at different specification levels with more or less accuracy. A first order clue at the specification level may help synthesis tools in low... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulating ATM integrated-services networks

    Publication Year: 1996, Page(s):162 - 171
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    In integrated-services networks, both the arrival processes and the performance objectives can vary greatly from one packet stream to another. Either the network must be designed to meet the strictest performance requirements by every possible measure of performance, or traffic control algorithms are needed that differentiate traffic based on performance objectives, and adjust performance accordin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.