Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)

24-24 July 1998

Filter Results

Displaying Results 1 - 25 of 46
  • Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1998, Page(s):315 - 316
    Request permission for commercial reuse | PDF file iconPDF (138 KB)
    Freely Available from IEEE
  • Improving lookahead in parallel wireless network simulation

    Publication Year: 1998, Page(s):262 - 267
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    Simulation of large sets of mobile computers or other wireless communication devices is difficult because of the computationally intensive models of wireless channels. Parallel simulation would seem to be applicable here because of the large computation granularity, but the location based communication topology makes conservative methods difficult to implement. This paper considers a novel approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modeling and measurement of parallelized code for distributed shared memory multiprocessors

    Publication Year: 1998, Page(s):161 - 166
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    This paper presents a model to evaluate the performance and overhead of parallelizing sequential code using compiler directives for multiprocessing on distributed shared memory (DSM) systems. We parallelized the sequential implementation of NAS benchmarks using native Fortran77 compiler directives on an Origin2000, which is a DSM system. We report measurement based performance of these parallelize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed-shared-memory support on the Simultaneous Optical Multiprocessor Exchange Bus

    Publication Year: 1998, Page(s):192 - 197
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    This paper examines the performance of distributed-shared-memory systems based on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) using queueing network models and develops theoretical results which predict processor utilization, message latency and other useful measures. It also presents simulation results which compare the performance of the SOME-Bus, the mesh and the torus. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A measurement methodology to calibrate analytical models including operating system overhead

    Publication Year: 1998, Page(s):255 - 260
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    The paper focuses on reducing completion time in large simulation models by replacing some of their elements with analytically determined solutions. In particular, we study realistic analytical server models that include operating system overhead. This overhead will be determined by measuring the behaviour of a representative workload. We propose a methodology to reduce the number of measurements ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prioritized multiprocessor networks: design and performance

    Publication Year: 1998, Page(s):153 - 160
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    This paper proposes and evaluates prioritized direct shared-memory multiprocessor networks. We use three components to implement prioritized networks, namely, priority-based link arbitration, priority inheritance, and dynamic virtual channels. The two major results from our study are: (i) adding priorities to direct shared-memory multiprocessor networks can lead to reduced average transaction late... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient strategy for developing a simulator for a novel concurrent multithreaded processor architecture

    Publication Year: 1998, Page(s):185 - 191
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    In developing a simulator for a new processor architecture, it often is not clear whether it is more efficient to write a new simulator or to modify an existing simulator. Writing a new simulator forces the processor architect to develop or adapt all of the related software tools. However, modifying an existing simulator and related tools, which are usually not well-documented, can be time-consumi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree-based fault-tolerant multicast in multicomputer networks

    Publication Year: 1998, Page(s):44 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces significant... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An on-line simulator for wormhole routing networks

    Publication Year: 1998, Page(s):249 - 254
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    We present the design and implementation of an efficient online simulator for wormhole routing networks, which is an important part of the Concordia Parallel Systems Simulator (CPSS), a simulator for wormhole routed multicomputers. The ultimate purpose of the CPSS is to provide a parallel programming environment which allows users to study impacts of system and software factors on program performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pro-active performance management of distributed applications

    Publication Year: 1998, Page(s):146 - 152
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    Self-managing systems able to dynamically re-configure with respect to time-varying workload mixes and changing system resource availability are of growing importance in heterogeneous multicomputer environments. Advanced performance evaluation techniques are needed to induce and assess the impact of such re-configurations where guaranteeing timeliness of reconfiguration activities is particularly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic schemes for speculative execution of code

    Publication Year: 1998, Page(s):309 - 314
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    Speculative execution of code is becoming a key technique for enhancing the performance of pipeline processors. We study schemes that predict the execution path of a program based on the history of branch executions. Building on previous work, we present a model for analyzing the effective speedup from pipelining using various schemes for speculative execution. We follow this with stochastic analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of hard real-time transaction scheduling policies in parallel database systems

    Publication Year: 1998, Page(s):176 - 184
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling pol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical multiplexing of self-similar video streams: simulation study and performance results

    Publication Year: 1998, Page(s):119 - 126
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Achieving statistical gains when multiplexing video streams, as in a video-on-demand (VOD) scenario, is difficult because of the stringent QOS demands and the self-similar nature of the traffic. This paper explores, through empirical simulation, the QOS, network utilization, and statistical characteristics of the aggregate traffic resulting from multiple independent MPEG video streams. In addition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real time resource allocation in an ATM network

    Publication Year: 1998, Page(s):107 - 111
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    At the input of an ATM network are present some different types of sources with different characteristics, particularly as the bandwidth concern. This paper presents a very efficient method for the real time allocation of resources in ATM networks with a prescribed grade of quality of service. It is known that the exact solution of this problem is quite cumbersome so it is impossible use it in a r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation-based `STRESS' testing case study: a multicast routing protocol

    Publication Year: 1998, Page(s):36 - 43
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    We propose a method for using simulation to analyze the robustness of multiparty (multicast-based) protocols in a systematic fashion. We call our method Systematic Testing of Robustness by Examination of Selected Scenarios (STRESS). STRESS aims to cut the time and effort needed to explore pathological cases of a protocol during its design. This paper has two goals: (1) to describe the method, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling large-scale simulations: selective abstraction approach to the study of multicast protocols

    Publication Year: 1998, Page(s):241 - 248
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    Due to the complexity and scale of the current Internet, large scale simulation is an increasingly important tool to evaluate network protocol design. Parallel and distributed simulation is one appropriate approach to the simulation scalability problem, but it can require expensive hardware and have high overhead. We investigate a complementary solution-simulation abstraction. Just as a custom sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaches to link-state alternate path routing in connection-oriented networks

    Publication Year: 1998, Page(s):92 - 100
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Alternate path routing (APR) can be used to achieve efficient routing in communications networks. We describe several approaches to APR in connection-oriented networks running link-state routing protocol, and evaluate their performance using call-level simulations. We assume source routing paradigm where primary paths for calls are computed only at source nodes. However, depending on the approach,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient performance analysis for location update protocols in cellular networks

    Publication Year: 1998, Page(s):282 - 287
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    Currently, many location update protocols have been proposed for mobile terminal tracking in cellular networks. These protocols, such as the time-based and the distance-based protocols, try to minimize the system overhead for locating a mobile user in the network. The contribution of this paper to develop a novel mathematical model to analyze these protocols and at the same time, make a general mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • mlcache: a flexible multi-lateral cache simulator

    Publication Year: 1998, Page(s):19 - 26
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    As the gap between processor and memory speeds increases, cache performance becomes more critical to overall system performance. Multi-lateral cache designs such as the Assist, Victim, and NTS cache have been shown to perform as well as or better than larger, single structure caches. Unlike current cache simulators, mlcache (an event-driven, timing-sensitive simulator based on the Latency Effects ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of fair queuing algorithms with a stochastic approach

    Publication Year: 1998, Page(s):139 - 144
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    We compare fair queuing (FQ) algorithms with a novel approach based on the majorization theory of real valued vectors. We study the temporal evolution of the received normalized service of all backlogged sessions in order to give a better insight into the performance of a FQ policy than what worst-case measures can provide. As an application of this approach, we study the effect of the eligibility... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensions to VHDL for abstraction of concurrency and communication

    Publication Year: 1998, Page(s):301 - 308
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    The paper describes extensions to VHDL to support system-level behavioral modeling by providing more abstract forms of communication and concurrency than those currently in the language. The report summarizes design objectives and issues that must be considered in developing such extensions, and presents definitions of our extensions. The extensions for communication consist of channel types, chan... View full abstract»

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

    Publication Year: 1998, Page(s):226 - 231
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    This paper presents a modeling approach based on deterministic and stochastic Petri nets (DSPN) for analyzing the performance of node architectures for MIMD multiprocessor systems with distributed memory. DSPN are a numerically solvable modeling formalism with a graphical representation. The modeling approach supports design decisions for node architectures by providing quantitative results concer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IPB: an Internet Protocol Benchmark using simulated traffic

    Publication Year: 1998, Page(s):77 - 84
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    A common shortcoming of many network measurement programs is that their metrics are not expressed in terms directly applicable to applications and users. To address this problem, we have developed the IP Benchmark (IPB), a benchmark program that synthetically generates traffic to simulate the network activity of common Internet applications. It measures the performance experienced by the simulated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of self-organizing spectrum management in wireless networks

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

    We describe the simulation of a new dynamic channel assignment algorithm in FDMA/TDMA wireless networks. The algorithm relies on periodic interference measurements by each of the base stations on the inactive frequencies, so as to identify appropriate candidate channels. The adaptive nature provides automatic configuration at the time of system initialization and adaptation to system expansion and... View full abstract»

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