Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

31 Jan-2 Feb 1994

Filter Results

Displaying Results 1 - 25 of 80
  • Visualization of network performance using the AVS visualization system

    Publication Year: 1994, Page(s):407 - 408
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    The authors describe a case study that demonstrates the integration of network monitoring with visualization. The AVS visualization package is used to graphically display the output of the tcpdump network monitor. The visualization system allows the user to simultaneously view multiple parameters and to discern relationships that may not be readily observable from numerical data or standard plots ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coreference detection in automatic analysis of specifications

    Publication Year: 1994, Page(s):409 - 410
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    An English language description of a system is typically composed of many English sentences. Consider that each English language sentence is parsed and stored in the form of a conceptual graph that represents the semantics of the sentence. Since each of these conceptual graphs carries information only about the sentence it represents, the set of conceptual graphs must be “joined” logic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual feedback for validation of informal specifications

    Publication Year: 1994, Page(s):411 - 412
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    In automatically synthesizing simulation models from informal specifications, the ambiguity of natural language (English) leads to multiple interpretations The authors report on a system, called the Model Generator, which provides visual feedback showing the interpretation of specification statements that have been automatically translated to a knowledge representation called conceptual graphs. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete time open queueing networks with feedback, bulk arrivals and services

    Publication Year: 1994, Page(s):413 - 414
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    An open queueing network system of N nodes with Geo(Ai) input and Geo(Si) service at every node is studied. Geo(Ai) and Geo(Si) mean compound geometric. First the author is interested in the cases of eventual independent departure from every node as the isolated queueing system Geo(Ai)/Geo(S i)/1. Then the author looks for a configu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A maximum entropy analysis of the single server queue

    Publication Year: 1994, Page(s):415 - 416
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Demanding a certain structural property, derived by applying the principle of maximum entropy to single server systems, from the equilibrium-queue-length distribution of the M/G/1 system leads to the generalized exponential (GE) service time distribution. The G/GE/1 queue is analysed by means of spectrum factorization of Lindley's integral equation. We obtain explicit expressions for a job's waiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for generation and collection of multiprocessor traces

    Publication Year: 1994, Page(s):417 - 418
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The authors describe a trace collection system that provides complete, accurate, and long traces. A methodology for generating multiprocessor traces from uniprocessor traces is presented, and the implementation of a multiprocesser simulator is discussed. Some programs that contain multiple processes with synchronization information have been run on a uniprocessor system to collect traces utilizing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IDtrace-a tracing tool for i486 simulation

    Publication Year: 1994, Page(s):419 - 420
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    The authors describe IDtrace, a binary instrumentation tool which produces execution traces for the ix86 instruction set architecture. Long execution traces can be generated quickly and easily for input to a wide variety of performance evaluation tools. Issues involved in the construction of such a tool are listed along with illustrations of the uses of different generated traces. One example obse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic bounds on execution times of parallel computations

    Publication Year: 1994, Page(s):421 - 422
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a directed acyclic graph (DAG). The task execution times are assumed independent random variables. The performance measure considered is the overall execution time of the computation. To ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Architecture Design and Simulation Environment

    Publication Year: 1994, Page(s):363 - 366
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    The Hierarchical Architecture Design and Simulation Environment (HASE) is a tool for modelling and simulating computer architectures. Using HASE, designers can create and explore architectural designs at different levels of abstraction through a graphical interface based on X-Windows/Motif and can view the results of the simulation through animation of the design drawings View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Animated simulations of media access protocols in local area networks

    Publication Year: 1994, Page(s):367 - 370
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    Three tools for the graphical simulation of media access protocols are presented. The media access protocols concerned are CSMA/CD (Ethernet, IEEE 802.3), FDDI (IEEE 802.5) and DQDB (IEEE 802.6). The object of the tools is to explain the principle of the protocols by using graphics and motion-pictures on a computer display. Several states of the systems can be modelled, for example collisions (CSM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On predictability of caches for real-time applications

    Publication Year: 1994, Page(s):52 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    This paper studies the effects of hit ratio on the timing predictability of real-time tasks based on trace driven simulation. The impact on execution times of the variance of the hit ratio for different program runs is studied, covering a wide range of cache sizes and organizations. An analytical expression to quantify the timing predictability is derived, so that timing errors due to variations o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FAST: a functional algorithm simulation testbed

    Publication Year: 1994, Page(s):142 - 146
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    We extend the practical range of simulations of parallel executions by “functional algorithm simulation,” that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientific algorithms. We describe FAST (Fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of space priority queueing in ATM switches

    Publication Year: 1994, Page(s):74 - 78
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    High-speed packet switched networks such as B-ISDN require algorithms to manage the flow of traffic into and through the network. End-to-end congestion control algorithms will do much to ensure that overload periods are minimized, but intelligent buffering decisions at internal nodes may aid in managing congestion by shifting cell loss to lower priority traffic. The authors describe a simulation s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MINT: a front end for efficient simulation of shared-memory multiprocessors

    Publication Year: 1994, Page(s):201 - 207
    Cited by:  Papers (106)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    MINT is a software package designed to ease the process of constructing event-driven memory hierarchy simulators for multiprocessors. It provides a set of simulated processors that run standard Unix executable files compiled for a MIPS R3000 based multiprocessor. These generate multiple streams of memory reference events that drive a user-provided memory system simulator. MINT uses a novel hybrid ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm and neural network approaches to local access network design

    Publication Year: 1994, Page(s):239 - 243
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    This paper examines the utility of genetic algorithms and neural nets for optimization problems occurring in local access network design. It contrasts an existing Hopfield net approach to concentrator assignment with a genetic algorithm approach and finds that the genetic algorithm performs better, while offering greater generality. It describes how genetic algorithms may also be used to solve ter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel simulation of Markovian queueing networks

    Publication Year: 1994, Page(s):35 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    Consider simulating a large queueing network, i.e., one with many queues and jobs, on a parallel computer. Suppose the network is partitioned so that each processor is assigned a set of queues to simulate. The basic difficulty in parallel simulation is synchronizing the simulation clocks on each of the processors so that events appear to get executed in the proper order. If the network possesses a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict analysis of multistage interconnection networks

    Publication Year: 1994, Page(s):126 - 130
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of write-back caches for multiple block-sizes

    Publication Year: 1994, Page(s):57 - 61
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Trace-driven simulation of cache memories usually requires enormous disk space to store CPU trace data. On-the-fly simulation avoids this problem by running the simulation while the trace data is being generated. For write-back least-recently-used (LRU) caches, we propose an on-the-fly simulation method, which is a variant of the standard one-pass stack evaluation techniques that evaluates write r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of temporal behaviour based on a synchronous language

    Publication Year: 1994, Page(s):147 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    This paper deals with the simulation of the temporal behaviour of “real time systems”. First, we characterize a class of applications: “interrupt-driven systems with complex pre-emption mechanisms” and we explain why classical analysis and simulation methods are not sufficient. Then, we introduce a new approach to realistic and efficient simulations of the temporal behaviou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of photonic local area network topologies

    Publication Year: 1994, Page(s):79 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Network topology significantly affects the system performance of local area networks. The bus topology was considered for optical local area networks since the degradation of system performance due to propagation delay could be reduced. Power budget constraints severely limited maximum system size which diminished its appeal. On the other hand, the star topology was shown to have excellent fanout ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of multiple-bus multiprocessor under non-uniform memory reference

    Publication Year: 1994, Page(s):169 - 173
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Performance evaluation of multiple-bus multiprocessor systems is usually carried out under the assumption of uniform memory reference model. The objective of this paper is to study the performance of multiple bus multiprocessor system in the presence of hot spots. Analytical expressions for the average memory bandwidth and probability of acceptance of prioritized processors have been derived. Two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of memory and time savings using EC/DSIM

    Publication Year: 1994, Page(s):208 - 213
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    This paper introduces the EC frontend and DSIM simulator. Given a parallel program, they determine its execution time on huge networks of computers. EC extracts task step needs. DSIM predicts completion times rather than simulating each program step. This paper contains analyses of the memory savings and the execution time savings for simulations of one to 2,800 computers running parallel Gaussian... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load balancing in distributed systems

    Publication Year: 1994, Page(s):245 - 249
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We design and evaluate novel adaptive load balancing algorithms for processes in an MIMD architecture. We introduce a gradient descent paradigm to compute on-line load balancing decisions and implement it on an nCube target architecture. Our measurements show that such algorithms will substantially improve distributed system performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting latent sector faults in modern SCSI disks

    Publication Year: 1994, Page(s):403 - 404
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    The authors present new improved methods for detecting latent sector faults in a disk subsystem as caused by media deterioration of the disk magnetic storage material. In case of media deterioration on the rarely accessed sectors, a latent disk fault may remain undetected for a long time. An adaptive algorithm is proposed to utilize the idle time of the disk for scanning commonly used SCSI disks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling, performance evaluation, and ordinal optimization of integrated voice/data networks

    Publication Year: 1994, Page(s):37 - 41
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The evaluation of data-packet delay in integrated networks is a difficult problem because the quantity of network resources available for data traffic is time varying and dependent on the voice traffic. We demonstrate that an extremely simple model for data-packet delay, although inaccurate in terms of delay measurements, can provide a remarkably accurate ranking among a number of different contro... View full abstract»

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