By Topic

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on

Date 18-20 Jan. 1995

Filter Results

Displaying Results 1 - 25 of 76
  • MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Program modelling via inter-reference gaps and applications

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

    Locality of reference in program behavior has been studied and modelled extensively because of its application to CPU, cache and virtual memory design, code optimization, multiprogramming etc. In this paper we propose a scheme based on Markov chains for modelling the time interval between successive references to the same address in a program execution. Using this technique and trace driven simula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the performance of a distributed simulator

    Publication Year: 1995, Page(s):13 - 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    In a global project devoted to the realization of a distributed network simulator, we have investigated several ways to optimize the performance of our tool. To allow the comparison of different policies of management of the rollback process implied by the distribution of the simulation, we have developed a specific simulation tool (a simulator of the simulator). We analyse here the structure of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of workload on the performance and availability of voting algorithms

    Publication Year: 1995, Page(s):217 - 224
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Voting algorithms are a popular way to provide data consistency in replicated data systems. By maintaining multiple copies of data on distinct servers, they can increase the data's availability, as perceived by a user. Many models have been made to study the degree to which replication increases the availability of data, and some have been made to study the cost incurred in maintaining consistency... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methodology for obtaining abstract views of state graphs labeled with probabilities and times. An example of application to a communication protocol

    Publication Year: 1995, Page(s):299 - 306
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    This paper presents a methodology for automatically obtaining abstract views of state graphs labeled with probabilities and times. An abstract view of a graph is a reduced graph obtained from a projection over a subset of states of the initial graph (observed states): the world of observed states is equivalent to the subworld of these states in the context of the initial graph on the basis of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance aspects of real-time systems

    Publication Year: 1995, Page(s):17 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Design of real-time systems needs to take into account their performance behaviour before their implementation. This goal can be attained by means of queueing network modelling. To process this kind of models normally simulation is used with its inherent costs of debugging and running times. This paper presents the analysis and comparison of analytic (simple queues, decomposition aggregation) and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Thread placement on the Intel Paragon: modeling and experimentation

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

    In multicomputer architectures where communication latency is distance independent, thread placement is expected to have a limited impact on an application's performance. In this paper, the impact of thread placement on application performance is demonstrated on a wormhole routed multicomputer, the Intel Paragon. A communication intensive synthetic workload is used to “stress test” the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling of object based systems with hidden sorted ECATNets

    Publication Year: 1995, Page(s):307 - 311
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    ECATNets are a kind of high-level net/data model, combining the strengths of Petri nets with those of abstract data types, used for modeling parallel and distributed systems. Their most distinctive feature is that their semantics is defined in terms of rewriting logics, thus allowing us to analyse the built models by prototyping. However a major drawback of this approach is that the achieved proto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The loading region: a framework for the performance evaluation of admission control policies for high speed networks

    Publication Year: 1995, Page(s):358 - 364
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    This paper proposes a simulation framework called the loading region for the performance evaluation of admission control policies for high speed networks. The loading region provides a means to assess the performance characteristics of an admission control policy in terms of its sensitivity to traffic mix, traffic characteristics, cell loss constraints, and cell delay constraints. The loading regi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of multi-class synchronized closed queueing networks

    Publication Year: 1995, Page(s):23 - 27
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Queueing networks with synchronization mechanisms are encountered in the modeling and analysis of parallel computer systems and computer/communication networks. Exact analytical solutions of such networks are not available. In particular, due to the synchronization mechanisms. These networks do not have a product-form solution. As a result approximation methods that can provide accurate estimates ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A program behavior model and its evaluation

    Publication Year: 1995, Page(s):232 - 236
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    We investigate a program behavior model that generates address reference strings including the interreference durations. This model views a trace as the sample path of a semi-Markov process. The transition probability and sojourn matrices of that process are statistically inferred. Two methods of evaluating the accuracy of the model are described. We experimentally evaluate the model on the shared... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority queueing in RAID disk arrays with an NVS cache

    Publication Year: 1995, Page(s):168 - 172
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    We consider a cached RAID5 disk array which partially consists of non-volatile storage (NVS) providing a fast-write capability. Blocks written in this manner are destaged from the NVS cache onto disk asynchronously and at a lower priority than disk read requests. We consider three queueing disciplines to prioritize read misses with respect to destages: (i) Non-preemptive priorities. (ii) Preemptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System modeling, performance analysis, and evolutionary prototyping with hardware description languages

    Publication Year: 1995, Page(s):312 - 318
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    Performance modeling, simulation and analysis of the system behavior through virtual prototyping, form the core steps of the system design process. Past CAD support to link the high level conceptual modeling phase with the implementation phase has been virtually non-existent. In this paper, we describe our work to use VHDL to build design libraries that support conceptual modeling. These library c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of an open tandem queueing network with population constraint and constant service times

    Publication Year: 1995, Page(s):189 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network cannot exceed a given value K. Customers arriving at the queueing network when there are more than K customers are forced to wait in an external queue. The arrival process to the queueing network is assumed to be arbitrary. We show that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling of random task graphs on parallel processors

    Publication Year: 1995, Page(s):143 - 147
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    Task graphs are one of the most used models for representing parallel computations. The structures of these graphs are sometimes obtained when compiling the parallel programs. In many other cases, however, they can be determined only at run time. In this paper, we study the scheduling of parallel computations whose task graphs are generated at run time. We obtain a simple optimal scheduling policy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete event simulation modelling of concurrent access in ATM-based computer networks

    Publication Year: 1995, Page(s):365 - 369
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The problem of sharing resources in telecommunications networks has benefited from a rich theoretical development in the area of statistical multiplexing. Integrating data and other very bursty traffic on these networks changes the way of managing the concurrent access to network resources. Discrete event simulation is used in the paper for the quantitative analysis of the trade-off involved in gi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • G-networks with triggered batch state-dependent movement

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

    This paper presents an extension of “G-networks” which includes queues with network state-dependent service rate, routing intensities and triggered batch signal movement. We prove that these networks have a geometric product form invariant measure. We establish sufficient conditions for the existence of a solution to traffic equations View full abstract»

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

    Publication Year: 1995, Page(s):237 - 241
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    Performance is an important aspect of software quality; in some real-time systems, poor performance can cause physical damage or even deaths. This paper describes how data from profiles taken at different loads may be combined to help locate performance bottlenecks that are distributed widely throughout a large program or system, such as those due to inlined functions or macros. This paper also de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient analysis of deterministic and stochastic Petri nets by the method of supplementary variables

    Publication Year: 1995, Page(s):394 - 398
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The paper addresses the transient analysis of stochastic Petri nets with deterministic and exponentially distributed firing times. Using the method of supplementary variables, general state equations are derived which are valid under certain structural conditions. A numerical technique for the iterative solution of the state equations is proposed. Furthermore, a special case is identified, for whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HALSIM-a very fast SPARC-V9 behavioral model

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

    This paper describes several implementation techniques used in HAL's 500 KIPS SPARC V9 behavioral model. Beyond presenting the details of our processor model, we describe several areas of innovation: architectural state-vector capture for injection into a gate-level hardware model, using an EDC polynomial-based signature scheme to verify a hardware design; obtaining accurate kernel and user-mode i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelized network simulators for message-passing parallel programs

    Publication Year: 1995, Page(s):72 - 76
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    This paper describes a software tool, LAPSE (Large Application Parallel Simulation Environment), for the simulation of large-scale programs written for the Intel Paragon, executed on smaller-scale machines. Two timing simulators are themselves parallelized; this paper describes the conservative synchronization algorithm we have developed to synchronize the simulation. We present performance data t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VIZIR: an integrated environment for distributed program visualization

    Publication Year: 1995, Page(s):288 - 292
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    VIZIR provides an integrated mechanism for on-line debugging, performance analysis, and data visualization of message-passing parallel applications. The current VIZIR includes: (1) a mechanism to multicast window-based commands, message passing and program execution events among tasks; (2) the ability to select groups of tasks to interact these events; (3) a means to report when these events cause... View full abstract»

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

    Publication Year: 1995, Page(s):173 - 177
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    Resource information managers typically use fixed approaches to manage information. However, fixed solutions to information management are complicated by the fact that computing environments are not all the same and even within a single computing environment the characteristics of the information and its access patterns may change over the lifetime of the system. These changes motivate this work t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust heuristic for minimizing cell loss in ATM networks

    Publication Year: 1995, Page(s):48 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Limited buffers in ATM network elements will inevitably result in cell loss. We model an ATM network as a tandem network with finite buffers and investigate the performance of a cell-level control policy (the HILO heuristic) that is designed to minimize cell loss rates. The HILO heuristic is based on limited feedback about the cells awaiting transmission in adjacent network nodes. We demonstrate v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparable design of efficient synchronization protocols for distributed simulation

    Publication Year: 1995, Page(s):59 - 65
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    A large number of variations of distributed simulation protocols have been proposed in the literature. Their performances, however, could not be compared directly, due to different implementation strategies, different optimizations and different software environments as well as parallel hardware platforms. To rank the protocols accurate enough with respect to their execution performance the only p... View full abstract»

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