ppxscal/embedding_network huggingface dataset:
COMNET III: object-oriented network performance prediction
Authors: Jeffry Jones
Venue: Proceedings of the 27th conference on Winter simulation (1995)

COMNET III predicts the performance of communication networks using object-oriented simulation analysis. No programming is requires to use the standard package. For situations where a developer wishes to customize or fine-tune some aspects of the standard model, a MODSIM-based object-oriented development environment is provided for overriding the behaviour of COMNET III objects. Model builders can add parameterized objects or their own customized objects to object libraries. COMNET III provides an integrated graphical environment for model creation, execution and analysis that permits interaction with the model while it executes. In addition to modelling the operation of a network and its protocols in satisfying demands for data transport, COMNET III also models the scheduling of applications on end-systems and the use of processing, storage and transport resources during application execution. A COMNET III model may consist of hierarchically-defined subnetworks.
Instruction selection using binate covering for code size optimization
Authors: Stan Liao, Srinivas Devadas, Kurt Keutzer, Steve Tjiang
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

We address the problem of instruction selection in code generation for embedded DSP microprocessors. Such processors have highly irregular data-paths, and conventional code generation methods typically result in inefficient code. Instruction selection can be formulated as directed acyclic graph (DAG) covering. Conventional methods for instruction selection use heuristics that break up the DAG into a forest of trees and then cover them independently. This breakup can result in suboptimal solutions for the original DAG. Alternatively, the DAG covering problem can be formulated as a binate covering problem, and solved exactly or heuristically using branch-and-bound methods. We show that optimal instruction selection on a DAG in the case of accumulator-based architectures requires a partial scheduling of nodes in the DAG, and we augment the binate covering formulation to minimize spills and reloads. We show how the irregular data transfer costs of typical DSP data-paths can be modeled in the binate covering formulation.
Surface fitting using GCV smoothing splines on supercomputers
Authors: Alan Williams, Kevin Burrage
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

The task of fitting smoothing spline surfaces to meteorological data such as temperature or rainfall observations is computationally intensive. The Generalised Cross Validation (GCV) smoothing algorithm is O(n³) computationally, and memory requirements are 0(n²). Fitting a spline to a moderately sized data set of, for example. 1080 observations and calculating an output surface grid of dimension 220 × 220 involves approximately 5 billion floating point operations, and takes approximately 19 minutes of execution time on a Sun SPARC2 workstation. Since fitting a surface to data collected from the whole of Australia could conceivably involve data sets with approximately 10000 points, and because it is desirable to be able to fit surfaces of at least 1000 data points in 1 to 5 seconds for use in interactive visualisations, it is crucial to be able to take advantage of supercomputing resources. This paper describes the adaptation of the surface fitting program to different supercomputing platforms, and the results achieved.
System Dependability Evaluation via a Fault List Generation Algorithm
Authors: D. Todd Smith, Barry W. Johnson, Joseph A. Profeta,  III
Venue: IEEE Transactions on Computers (1996)

The size and complexity of modern dependable computing systems has significantly compromised the ability to accurately measure system dependability attributes such as fault coverage and fault latency. Fault injection is one approach for the evaluation of dependability metrics. Unfortunately, fault injection techniques are difficult to apply because the size of the fault set is essentially infinite. Current techniques select faults randomly resulting in many fault injection experiments which do not yield any useful information. This research effort has developed a new deterministic, automated dependability evaluation technique using fault injection. The primary objective of this research effort was the development and implementation of algorithms which generate a fault set which fully exercises the fault detection and fault processing aspects of the system. The theory supporting the developed algorithms is presented first. Next, a conceptual overview of the developed algorithms is followed by the implementation details of the algorithms. The last section of this paper presents experimental results gathered via simulation-based fault injection of an Interlocking Control System (ICS). The end result is a deterministic, automated method for accurately evaluating complex dependable computing systems using fault injection.
A pragmatic approach to C++, Eiffel and Ada 9X programming
Authors: Gabriela O. de Vivo, Marco de Vivo
Venue: ACM SIGPLAN Notices (1995)

Conceptualizing the world as a set of interacting objects, has ever been the main mechanism of perception associated with humankind. Therefore, the formulation of languages and modeling and design methods based on object orientation (OO) was just a matter of time. After that, a mutual feedback driven process lead to more and better implementations of OO languages as well as to proven OO based techniques for design and modeling. Of course the success of the whole model is related to the analysis of the adequacy of the actual OO languages for the implementation of OO designed systems. This paper reports the results of a simple experiment formulated to find some heuristics associated to the adequacy of the languages C++, Eiffel, and Ada 9X for the implementation of OO designed systems.
The SPLASH-2 programs: characterization and methodological considerations
Authors: Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie, Jaswinder Pal Singh, Anoop Gupta
Venue: Proceedings of the 22nd annual international symposium on Computer architecture (1995)

The SPLASH-2 suite of parallel applications has recently been released to facilitate the study of centralized and distributed shared-address-space multiprocessors. In this context, this paper has two goals. One is to quantitatively characterize the SPLASH-2 programs in terms of fundamental properties and architectural interactions that are important to understand them well. The properties we study include the computational load balance, communication to computation ratio and traffic needs, important working set sizes, and issues related to spatial locality, as well as how these properties scale with problem size and the number of processors. The other, related goal is methodological: to assist people who will use the programs in architectural evaluations to prune the space of application and machine parameters in an informed and meaningful way. For example, by characterizing the working sets of the applications, we describe which operating points in terms of cache size and problem size are representative of realistic situations, which are not, and which re redundant. Using SPLASH-2 as an example, we hope to convey the importance of understanding the interplay of problem size, number of processors, and working sets in designing experiments and interpreting their results.
Feedback techniques for continuity and synchronization in multimedia information retrieval
Authors: P. Venkat Rangan, Srinivas Ramanathan, Srihari Sampathkumar
Venue: ACM Transactions on Information Systems (TOIS) (1995)

Future advances in storage and networking technologies will make it feasible to build multimedia on-demand information servers capable of providing services similar to those of a neighborhood videotape rental store over metropolitan area networks. Such multimedia information servers must not only support retrieval of continuous media units (such as video frames and audio samples), but also preserve synchrony among playback of the different media components constituting a multimedia object. We develop techniques for supporting continuous and synchronous retrieval from multimedia servers. We present feedback techniques by which, during retrieval of multimedia objects from a multimedia server to mediaphones, the multimedia server uses lightweight messages called feedback units transmitted periodically back to it (by mediaphones) to detect impending discontinuities as well as asynchronies at mediaphones. The multimedia server then preventively readjusts media transmission so as to avoid either anomaly, and steers the mediaphones back to synchrony. Given the available buffer sizes at mediaphones and the maximum tolerable asynchrony, we present methods to determine the minimum rate at which feedback units must be transmitted so as to maintain both continuity and synchronization. These feedback techniques remain robust even in the presence of playback rate mismatches and network delay jitter, and their initial simulation for video-audio playback yields a feedback rate of one per 1,000 media units to keep the asynchrony within 250ms, showing that the overhead due to feedback transmission is very small. The constant rate feedback techniques developed in this article form the basis of a prototype on-demand information server being developed at the UCSD Multimedia Laboratory.
Integer Linear Programs and Local Search for Max-Cut
Authors: Svatopluk Poljak
Venue: SIAM Journal on Computing (1995)

The paper deals with the complexity of the local search, a topic introduced by Johnson, Papadimitriou, and Yannakakis. One consequence of their work, and a recent paper by Schaffer and Yannakakis, is that the local search does not provide a polynomial time algorithm to find locally optimum solutions for several hard combinatorial optimization problems. This motivates us to seek "easier" instances for which the local search is polynomial. In particular, it has been proved recently by Schaffer and Yannakakis that the max-cut problem with the FLIP neighborhood is PLS-complete, and hence belongs among the most difficult problems in the PLS-class (polynomial time local search). The FLIP neighborhood of a 2-partition is defined by moving a single vertex to the opposite class. We prove that, when restricted to cubic graphs, the FLIP local search becomes "easy" and finds a local max-cut in $O(n^2) $ steps. To prove the result, we introduce a class of integer linear programs associated with cubic graphs, and provide a combinatorial characterization of their feasibility.
Methods for precise submesh allocation
Authors: Craig Morgenstern
Venue: Scientific Programming (1994)

In this article we describe and compare several recently proposed algorithms for precise submesh allocation in a two-dimensional mesh connected system. The methods surveyed include various frame sliding strategies, the maximum boundary value heuristic, and interval set scan techniques. In addition, a new enhancement to the interval set scan method is described. This enhancement results in an algorithm that has better allocation and run-time performance under a FCFS scheduling policy than any of the other proposed methods. We present results drawn from an extensive simulation study to illustrate the relative efficiency of the various methods.
An analysis of decay-usage scheduling in multiprocessors
Authors: D. H. J. Epema
Venue: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems (1995)

Priority-ageing or decay-usage scheduling is a time-sharing scheduling policy capable of dealing with a workload of both interactive and batch jobs by decreasing the priority of a job when it acquires CPU time, and by increasing its priority when it does not use the (a) CPU. In this paper we deal with a decay-usage scheduling policy in multiprocessor systems modeled after widely used systems. The priority of a job consists of a base priority and a time-dependent part based on processor usage. Because the priorities in our model are time dependent, a queueing-theoretic analysis, for instance for the mean response time, seems impossible. Still, it turns out that as a consequence of the scheduling policy, the shares of available CPU time obtained by jobs converge, and a deterministic analysis for these shares is feasible: for a fixed set of jobs with very large (infinite) processing demands, we derive the relation between their base priorities and their steady-state shares. In addition, we analyze the relation between the values of the parameters of the scheduler and the level of control it can exercise over the steady-state shares. We validate the model by simulations and by measurements of actual systems.
First international workshop on architectures for software systems workshop summary
Authors: David Garlan
Venue: ACM SIGSOFT Software Engineering Notes (1995)

As systems become more complex, the high-level organization of the overall system---the software architecture---becomes a critical aspect of design. Architectural concerns include organization of a system as a composition of components; global control structures; protocols for communication, synchronization, and data access; assignment of functionality to design elements; physical distribution; scaling and performance; dimensions of evolution; and selection among design alternatives.Recently, software architecture has begun to emerge as an important field of study for software engineering practitioners and researchers. Architectural issues are being addressed by work in areas such as module interface languages, domain-specific architectures, software reuse, codification of organizational patterns for software, architectural description languages, formal underpinnings for architectural design, and architectural design environments.While there has been considerable recent activity in this area, much of it has gone on in small groups and many of these efforts are operating without detailed knowledge of other on-going work. This workshop brought together researchers and practitioners interested in software architecture to discuss the current state of the practice and art. The primary goal was to establish a common understanding of the state of the practice, the kinds of research and development efforts that are in progress, and the important challenges for this emerging field.The response to the call for papers for this workshop provides convincing evidence of the increasing interest and importance of software architecture. There were 86 papers submitted, involving over 140 authors. Of these, 32 were chosen for inclusion in the workshop.These papers were distributed to the participants in the form of a workshop proceedings. The proceedings has recently been reissued as a Carnegie Mellon Technical report, "Proceedings of the First International Workshop on Software Architecture", CMU-CS-TR-95-151. Copies may be obtained from CS Documentation, School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213-3891 (tel: 412-268-2596, email: reports@cs.cmu.edu).The workshop organizing committee consisted of David Garlan, Workshop Chair (Carnegie Mellon University), Bob Balzer (USC Information Sciences Institute), Barry Boehm (University of Southern California), Martin Griss (Hewlett Packard Laboratories), Jeffrey Kramer (Imperial College), Doug Lea (SUNY Oswego amp; NY CASE Center), Dewayne Perry (AT amp;T Bell Labs), Mary Shaw (Carnegie Mellon University), Will Tracz (Loral Federal Systems), and Alexander Wolf (University of Colorado at Boulder).
Extraction of circuit models for substrate cross-talk
Authors: T. Smedes, N. P. van der Meijs, A. J. van Genderen
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

An increasingly urgent topic for the realization of densely packed (mixed signal) integrated circuits is prevention of cross-talk via the substrate. This paper proposes a Boundary Element Method (BEM) for calculating an admittance matrix for the substrate in order to analyze the parasitic coupling during layout verification.In contrast with standard BE methods, we propose a Green's function which is specific to the domain and the problem. This allows minimal discretization and a direct extraction of circuit models for the cross-talk. The extraction can be combined with an efficient model reduction technique to obtain more simple, yet accurate models for the cross-talk. The complete extraction process has a linear time complexity and a constant memory usage. The method is fully implemented and integrated in an existing layout-to-circuit extractor.
An analytic model of hierarchical mass storage systems with network-attached storage devices
Authors: Daniel A. Menascé, Odysseas I. Pentakalos, Yelena Yesha
Venue: ACM SIGMETRICS Performance Evaluation Review (1996)

Network attached storage devices improve I/O performance by separating control and data paths and eliminating host intervention during data transfer. Devices are attached to a high speed network for data transfer and to a slower network for control messages. Hierarchical mass storage systems use disks to cache the most recently used files and tapes (robotic and manually mounted) to store the bulk of the files in the file system. This paper shows how queuing network models can be used to assess the performance of hierarchical mass storage systems that use network attached storage devices. The analytic model validated through simulation was used to analyze many different scenarios.
Integrated document and workflow management applied to the offer processing of a machine tool company
Authors: Stefan Morschheuser, Heinz Raufer
Venue: Proceedings of conference on Organizational computing systems (1995)

Introducing document and workflow management systems causes two main problems:How can the supported business processes be adequately modeled?How can existing information systems and databases be integrated?Within this paper, we present tools, methods and other approaches, which are designed to solve these problems. They are illustrated by the offer processing of a machine tool company. This process starts with a customer inquiry for a particular product and finishes with a customized offer.Several levels of integrated document and workflow management are discussed in section 2. This is followed by an introduction to the current offer processing used by our partner company INA Waelzlager Schaeffler KG, in which we highlight its main weaknesses. The fourth section describes a newly developed document-oriented tool to model business processes, and which serves also as a means of analyzing the current offer processing. The subject matter of the next chapter is the prototypical realization of a document and workflow management system at INA, which also comprises integrated application programs. The objective consists of a &ldquo;lean integration&rdquo; in order to avoid methods like total IS-reengineering or the use of highly integrated, but rigid standard software, where these are unreasonable heavy for small to medium enterprises.
Service quality in the management of simulation projects
Authors: Stewart Robinson, Michael Pidd
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Discusses how the concepts of service quality can be applied to simulation projects, the aim being to find a means for improving the quality of simulation studies and so increase the chance of reaching a successful outcome. The terms validity, credibility and acceptability are often used in the context of simulation project success. However, there is some disagreement about the meaning of these terms and only a limited understanding of how they are achieved. This paper sets simulation projects in the context of a service provided to a customer. The service provider's aim is to maximise the quality of the work. A short review of service quality concepts is given. A series of interviews has been performed to establish the factors involved in a customer's assessment of the success of a simulation study. These factors have been summarised in 19 groups (or dimensions). The aim is to create a survey instrument which can be used to assess the quality of a project as it progresses and once it is complete.
Instruction cache fetch policies for speculative execution
Authors: Dennis Lee, Jean-Loup Baer, Brad Calder, Dirk Grunwald
Venue: ACM SIGARCH Computer Architecture News (1995)

Current trends in processor design are pointing to deeper and wider pipelines and superscalar architectures. The efficient use of these resources requires speculative execution, a technique whereby the processor continues executing the predicted path of a branch before the branch condition is resolved.In this paper, we investigate the implications of speculative execution on instruction cache performance. We explore policies for managing instruction cache misses ranging from aggressive policies (always fetch on the speculative path) to conservative ones (wait until branches are resolved). We test these policies and their interaction with next-line prefetching by simulating the effects on instruction caches with varying architectural parameters. Our results suggest that an aggressive policy combined with next-line prefetching is best for small latencies while more conservative policies are preferable for large latencies.
Collaborative realtime process management
Authors: Yvonne Wærn, Patricia Jones
Venue: ACM SIGCHI Bulletin (1995)

Several situations in modern working life imply that people have to cooperate in order to handle dynamic systems. The work is distributed in several respects; people work with different tasks and have different expertise, they are often geographically distributed and they work at different times or cover different time scales. The activities are often time critical and cooperation has to be efficient. The problems involved in these situations have great economical and societal impacts. Approaches to the problems require expertise in several domains.The objectives of the workshop was to identify key features of collaborative process management and to identify critical needs in the domain of collaborative process management.
A Variational Method for Analysing Unit Clause Search
Authors: Henri-M. Mejean, Henri Morel, Gerard Reynaud
Venue: SIAM Journal on Computing (1995)

We expose a variational method for analysing algorithms, as applied to analyse the algorithm UC, which is the Davis-Putnam procedure for a set of clauses of three literals. The variable from a unit clause or, if there is none, the first remaining variable from a fixed list is chosen. The algorithm UC finds all the solutions as a set of cylinders. Following the nomenclature of P. W. Purdom [J. Inform. Process., 13 (1990), pp. 449--455], we call this algorithm "unit clause backtracking with cylinders of solutions." First we give an expression for the number of nodes of the calculation trees of all the inputs. Then we use a variational method to calculate the base $\beta$ of the principal exponential part of the average time of calculation $T$. This "exponential base" is the maximum of three elementary functions $f_i$ of four real variables. These functions are defined on the product of the half positive real line by the 3-dimensional unit real cube. We finally obtain the following short statement. Let $v$ be the number of the variables. Let $c$ be the number of the clauses. Let $\gamma=c/v>1$. Let $\gamma$ be constant when $v$ grows to infinity. The principal exponential part of the average time of UC is $\beta^v$ where $$\beta=\OO({\max} ; 0\leq \lambda\leq 1) 2^\lambda{\bigl(1-{3\lambda^2\over 8}+{\lambda^3\over4}\bigr)}^\gamma.$$ We mean that $\lim\limits_{v\rightarrow\infty}T^{1\over v}=\beta$. As a first consequence of our method we match UC, with the algorithm B without rearrangement (i. e. with a fixed order for introducing the variables). This gives a proof to a conjecture of P. W. Purdom [Artif. Intell., 21 (1983), pp. 117-133].