By Topic

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96., Proceedings of the Fourth International Workshop on

Date 1-3 Feb. 1996

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Using remote memory to avoid disk thrashing: a simulation study

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

    The increasing use of high-bandwidth and low-latency networks make possible the use of remote (network) memory as an alternative to disk means of storing an application's data, because remote-to-local memory transfers over a modern interconnection network are faster than traditional disk-to-memory transfers. We explore the possibility of using the remote memory as (i) a (faster-than-disk) backing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modeling of heterogeneous distributed applications

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

    Heterogeneous network computing allows the development of a single complex application using a distributed network of machines; these machines may differ in terms of CPU and memory capacity and/or architecture and specialized functions. We present a modeling technique, based on generalized stochastic Petri nets (GSPNs), for the performance analysis of applications targeted to this class of systems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of heterogeneous networks of workstations

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

    A network of workstations (NOW) has become an important distributed platform for large-scale scientific computations. A practical NOW system is heterogeneous and nondedicated, where computing power varies among the workstations and multiple jobs may interact with each other during execution. I present the design and implementation of a simulation system for a nondedicated heterogeneous NOW. This s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VISTA: a configurable visualization and simulation tool for ATM switches

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

    VISTA, a configurable visualization and simulation tool, is designed to show the dynamic behavior of ATM switches. VISTA provides builtin support for two simulated switching architectures (tandem Banyan and shared bus), a parametric traffic generating model, four output buffering schemes (no buffering, pushout, buffer sharing, and selective discarding), and an interactive graphical user interface.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of efficient multistage interconnection networks

    Publication Year: 1996, Page(s):140 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    We present an algorithm that characterizes the set of permutations realizable in a single pass by a buddy-type MIN. We use the algorithm to develop a procedure that defines a buddy-type network which will realize a given set of permutations in a single pass through the network. We also present an algorithm to define a biped-type network which realizes a given set of permutations in a single pass. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Annai/PMA instrumentation intrusion presentation

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

    Performance monitoring in the Annai tool environment for distributed-memory parallel computing systems is achieved through a flexible combination of different types of instrumentation. Latent instrumentation in the communication library and inserted in executables by the compilation system can be dynamically configured during program execution. Analysis of the subject program and knowledge of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance estimation in a simultaneous multithreading processor

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

    We present a model to estimate the performance of dynamically interleaving instruction streams in super-scalar architectures. Instructions executed per cycle (IPC) are calculated from simple descriptions of the workload and hardware. We compare estimates for several programs against results from a simulator View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis and optimization of search and selection algorithms for highly parallel associative memories

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

    Several useful associative memory (AM) algorithms deal with identifying extreme values (max or min) in a specified field of a selected subset of words. Previously proposed algorithms for such extreme-value searches are bit-sequential in nature, even when implemented on fully parallel AMs. We show how the multiple-bit search capability of a fully parallel AM can be used to advantage in reducing the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of buffer design for adaptive routing in direct networks

    Publication Year: 1996, Page(s):134 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The performance of a massively parallel computing system is often limited by the speed of its interconnection network. One strategy that has been proposed for improving network efficiency is the use of adaptive routing, in which network state information can be used an determining message paths. The design of an adaptive routing system involves several parameters, and in order to build high speed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Well-defined stochastic Petri nets

    Publication Year: 1996, Page(s):278 - 284
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Formalism based on stochastic Petri nets (SPNs) can employ structural analysis to ensure that the underlying stochastic process is fully determined. The focus is on the detection of conflicts and confusions at the net level, but this might require to overspecify a given SPN model. The problem becomes even more critical when reward processes of interest derived from the basic underlying process are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bridge: a retargetable extensive profiling tool

    Publication Year: 1996, Page(s):44 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The task of identifying an appropriate processor for a given class of applications to arduous and time consuming, requiring access to processors and extensive study of the processor architecture and organization. We describe Bridge, a retargetable profiling tool that attempts to ease the aforementioned task. Currently, Bridge is targeted to two microcontrollers: the Motorola 68HC11 and the MicroCh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two new algorithms to compute steady-state bounds for Markov models with slow forward and fast backward transitions

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

    Two new algorithms are proposed for the computation of bounds for the steady-state reward rate of irreducible finite Markov models with slow forward and fast backward transitions. The algorithms use detailed knowledge of the model in a subset of generated states G and partial information about the model in the non-generated portion U of the state space. U is assumed partitioned into subsets U... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of cache consistency algorithm performance

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

    As more computer systems turn to multiprocessing for improved performance, additional research is needed to evaluate and improve the performance of cache consistency protocols. In this study, we use trace-driven simulation to examine the performance of several consistency protocols, including some new adaptive protocols which have not been examined in prior research. This study uses a wider variet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performability management in distributed database systems: an adaptive concurrency control protocol

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

    An adaptive concurrency control protocol is proposed for distributed database systems where data and resource contention have adverse effects on performability. The protocol dynamically switches between two existing concurrency control mechanisms, namely, an optimistic one called the “exclusive writer with locking option” and a pessimistic one referred to as “primary site locking... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object oriented simulation of multimedia on demand services over ATM network

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

    The paper presents a simulation model of a generic system to support multimedia-on-demand services over an ATM network. The simulation has been performed using an object-oriented approach. Discrete event system specification (DEVS) methodology has been used in the design and implementation of the simulation. This simulation approach also helped in the development of a modular, re-usable and easily... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing the performance parameters of two network structures for scalable massively parallel processors

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

    Packed exponential connection (PEC) networks and periodically regular chordal (PRC) rings, proposed as enhanced versions of linear arrays and rings respectively introduce skip links into the respective base networks. Both networks can be viewed as derivatives of symmetric chordal rings with restricted or reduced connection assignments. Thus, an interesting question arises: How can one prune or thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The inaccuracy of trace-driven simulation using incomplete multiprogramming trace data

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

    Trace-driven simulation is commonly used to predict the performance of computer systems. However, existing tracing techniques produce traces inadequate for some studies: they do not usually record operating system references, and they produce relatively short traces. The paper explores the impact of these trace distortions on the performance estimates of uniprocessor memory hierarchies using multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair queueing architectures for high-speed networks

    Publication Year: 1996
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Summary form only given, as follows. High-speed links in emerging communication networks require simple and efficient algorithms for apportioning bandwidth to competing connections. A single link may carry traffic for thousands of connections with different quality-of-service parameters, requiring scalable switch architectures that avoid performing operations for every connection or cell during ea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two new fair and efficient algorithms for slot reuse in DQDB MANs

    Publication Year: 1996, Page(s):82 - 88
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Several algorithms for the implementation of the slot reuse function in DQDB MANs are studied through simulation in order to investigate their efficiency and fairness. While it is shown that even, simpler algorithms are capable of achieving quite good performance, the fair distribution of access opportunities among nodes is found to be difficult to obtain. Novel modifications of two existing algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of data-parallel programs in Parallaxis-III

    Publication Year: 1996, Page(s):231 - 234
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Parallaxis is a machine-independent language for data-parallel programming. Sequential Modula-2 is used as the base language. Programming in Parallaxis is done on a level of abstraction with virtual processors and virtual connections, which may be defined by the application programmer. The paper describes a compiler and debugger for Parallaxis-III, which allow the execution of massively parallel p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurement and modeling of EARTH-MANNA multithreaded architecture

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

    We develop and apply an analytical model to analyze the performance of the EARTH-MANNA multithreaded multiprocessor system. The performance model is based on closed queuing networks. We develop heuristics to account for the realistic subsystem interactions (simultaneous resource possession) and multithreaded workload. Inputs to the analytical model are architectural parameters of the EARTH-MANNA s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Response time analysis of two server fork-join systems

    Publication Year: 1996, Page(s):291 - 295
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    This paper gives an exact analysis of mean response time of fork-join systems. The response time is shown to be the sum of parallel wait and parallel service times which are analogous to wait and service times in non-parallel systems. It is shown that the parallel service time of a job is dependent on the state at arrival time of the job. A formal parallel wait time analysis, similar to the wait t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Event-based study of the effect of execution environments on parallel program performance

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

    In this paper we seek to demonstrate the importance of studying the effect of changes in execution environment parameters, on parallel applications executed on state-of-the-art multiprocessors. A comprehensive methodology for event-based analysis of program behavior is introduced. This methodology is used to study the performance significance of various system parameters such as processor speed, m... View full abstract»

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