ppxscal/embedding_network huggingface dataset:
Extending and embedding the python interpreter
Authors: Guido Rossum
Venue:  (1995)

Python is an interpreted, object-oriented programming language. This document describes how to write modules in C or C++ to extend the Python interpreter with new modules. Those modules can define new functions but also new object types and their methods. The document also describes how to embed the Python interpreter in another application, for use as an extension language. Finally, it shows how to compile and link extension modules so that they can be loaded dynamically (at run time) into the interpreter, if the underlying operating system supports this feature. This document assumes basic knowledge about Python. For an informal introduction to the language, see the Python Tutorial. The Python Reference Manual gives a more formal definition of the language. The Python Library Reference documents the existing object types, functions and modules (both built-in and written in Python) that give the language its wide application range.
Developing Distributed Software Systems by Incorporating Meta-Object Protocol (diMOP) with Unified Modeling Language (UML)
Authors: J. Lee, T. Kim, G. Yoon, J. Hong, S. Cha, D. Bae
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Although object-oriented paradigm is becoming a more realistic approach to the development of large-scale software systems, the existing object-oriented notations and methodologies do not fully support the development of distributed object systems. In this paper, we integrate Meta-Object Protocol (MOP) into a de facto standard object-oriented modeling language UML together to build a software architecture for distributed object systems. We propose a high-level extension of conventional MOPs, called diMOP which helps to develop distributed object systems by realizing a reflective architecture. To incorporate diMOP with UML, we introduce two new specification languages: Class Diagram Supporting diMOP (CDSM) and Dynamically Configurable Object-oriented Statemachine (DCOS), which are proposed to replace the class diagram and the state diagram of UML. The two specification languages support to specify dynamic configuration behaviors as well as to incorporate the diMOP. This paper gives a methodology to develop efficiently distributed object systems through UML
GRASP/Ada: Reverse Engineering Tools for Ada
Venue:  (1991)

The GRASP/Ada project (Graphical Representations of Algorithms, Structures, and Processes for Ada) has successfully created and prototyped a new algorithmic level graphical representation for Ada software, the Control Structure Diagram (CSD). The primary impetus for creation of the CSD was to improve the comprehension efficiency of Ada software and thus improve reliability and reduce costs. The emphasis has been on the automatic generation of the CSD from Ada source code to support reverse engineering and maintenance. The CSD has the potential to replace traditional prettyprinted Ada source code. In Phase 1 of the GRASP/Ada project, the CSD graphical constructs were created and applied manually to several small Ada programs. A prototype (Version 1) was designed and implemented using FLEX and Bison running under VMS on a VAX 11-780. In phase 2, the prototype was improved and ported to the Sun 4 platform under UNIX. A user interface was designed and partially implemented using the HP widget toolkit and X Windows. The prototype was applied successfully to numerous Ada programs ranging in size from several hundred to several thousand lines of source code. In Phase 3 of the project, the prototype was prepared for limited distribution (GRASP/Ada Version 3.0) to facilitate evaluation. The user interface was extensively reworked using the Athena widget toolkit and X windows. The current prototype provides the capability for the user to generate CSD from Ada source code in a reverse engineering mode with a level of flexibility suitable for practical application. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Theory of Constant Et^2 CMOS Circuits
Authors: Karl Papadantonakis
Venue:  (2001)

CMOS pulldown networks are characterized by their switching energy (E) and propagation delay (t), and voltage scaling has been shown to allow E or t to be adjusted, while Et^2 remains constant. Previously, this argument about single pulldown stages was applied to arbitrary digital circuits by assuming that the total delay of any such circuit was a sum of single pulldown and pullup stage delays, neglecting the time variation of the input to each stage. In this paper, the statement that Et^2 is independent of voltage scaling is generalized to arbitrary networks of CMOS transitors using only a weaker assumption: that every node has a capacitance.
Network Computers--Ubiquitous Computing or Dumb Multimedia?
Authors: R. G. Herrtwich, T. Kappner
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In May 1996, a group of major hardware and software manufacturers jointly announced a set of guidelines forming an industry standard for a new class of devices called network computers (NCs). The new industry standard-called the Network Computer Reference Profile 1-is designed to accelerate the development of low-cost computing. The group of firms, consisting of Apple, IBM, Oracle, Sun Microsystems and Netscape Communications, unveiled plans to provide network computer operating software and a variety of NC hardware models by the end of 1996. The NC Reference Profile 1 considerably builds upon existing Internet and World Wide Web technology. This paper gives a brief overview of the goals pursued by the introduction of NC Reference Profile 1. It surveys the technologies employed for NCs and discusses their application and market potential in different environments.
Sun Cluster 3 Programming: integrating applications into the SunPlex environment, 1st edition
Authors: Bianco, Peter Lees, Kevin Rabito
Venue:  (2004)

Customize Applications for Maximum Availability in Sun Cluster EnvironmentsThe Sun Cluster 3 environment offers developers and administrators a powerful API for creating custom "data services" that maximize the availability and enhance the horizontal scalability of many enterprise applications. Now, here's an authoritative tutorial and reference to building custom data services with the Sun Cluster 3 API. In Sun Cluster 3 Programming, three leading Sun Cluster experts systematically review the tools, programming interfaces, and features that make custom data services possible. Then, through a series of step-by-step examples, they demonstrate how to ensure that applications can recover smoothly from even the most serious failures.This book Reviews every facet of "availability" and what it takes to make software available Provides extensive easy-to-understand code examples, all available for download Covers all areas of agent development, from quick basics to advanced techniques Covers all the APIs provided with Sun Cluster 3 Walks step-by-step through making existing applications available, scalable, and cluster-awareUntil now, this information has been available only in a three-day Sun training course. Now, with the help of Sun's in-house experts, you have all the information you need to build Sun Cluster 3 custom applications that deliver unprecedented levels of application availability.
Experimental Comparison of Memory Management Policies for NUMA Multiprocessors
Authors: P R LaRowe, S C Ellis
Venue:  (1990)

Non-uniformity of memory access is an almost inevitable feature of memory architecture in shared memory multiprocessor designs that can scale to large numbers of processors. One implication of NUMA architectures is that the placement and movement of code and data become crucial to performance. As memory architectures become more complex and the nonuniformity becomes less well hidden, systems software must assume a larger role in providing memory management support for the programmer. This paper investigates the role of the operating system. We take an experimental approach to evaluating a wide-range of memory management policies. The target NUMA environment is BBN''s GP-1000 multiprocessor. Extensive local modifications have been made to the memory management subsystem of BBN''s nX operating system to support multiple policy implementations. Policy comparisons are based on the measured performance of real parallel applications. Our results show that there are memory management policies implemented in our system that can improve the performance of programs written using the simpler uniform memory access (UMA) programming model. While achieving the level of performance of a highly tuned NUMA program is still a difficult problem, some examples come close. There appears to be no single policy that can be considered the best over our set of test applications. Investigations into the contributions made by individual policy features toward overall behavior of the workload provide some insight into the design of a set of effective policies.
Milestones in Computer Science and Information Technology
Authors: Edwin D. Reilly
Venue:  (2003)

:More than 600 A-Z entries describe the most significant advances in computer science and information technology, covering hardware, software, theory, mathematics, programming, languages, memory, architecture, applications, and graphics.
Quotient Tree Partitioning of Undirected Graphs
Authors: Anders Edenbrandt
Venue:  (1984)

The partitioning of the vertices of an undirected graph, in a way that makes its quotient graph a tree, mirrors a way of permuting a square symmetric matrix to allow its factoring with little fil-in. We analyze the complexity of finding the best partitioning and show that it is NP-complete. We also give a new and simpler implementation of an algorithm that finds a maximal quotient tree.
A Performance Evaluation of Hyper Text Transfer Protocols
Authors: Paul Barford, Mark Crovella
Venue:  (1998)

Abstract Version 1.1 of the Hyper Text Transfer Protocol (HTTP) was principally developed as a means for reducing both document transfer latency and network traffic. The rationale for the performance enhancements in HTTP/1.1 is based on the assumption that the network is the bottleneck in Web transactions. In practice, however, the Web server can be the primary source of document transfer latency. In this paper, we characterize and compare the performance of HTTP/1.0 and HTTP/1.1 in terms of throughput at the server and transfer latency at the client. Our approach is based on considering a broader set of bottlenecks in an HTTP transfer; we examine how bottlenecks in the network, CPU, and in the disk system affect the relative performance of HTTP/1.0 versus HTTP/1.1. We show that the network demands under HTTP/1.1 are somewhat lower than HTTP/1.0, and we quantify those differences in terms of packets transferred, server congestion window size and data bytes per packet. We show that when the CPU is the bottleneck, there is relatively little difference in performance between HTTP/1.0 and HTTP/1.1. Surprisingly, we show that when the disk system is the bottleneck, performance using HTTP/1.1 can be much worse than with HTTP/1.0. Based on these observations, we suggest a connection management policy for HTTP/1.1 that can improve throughput, decrease latency, and keep network traffic low when the disk system is the bottleneck.
Bit Flip Injection in Processor-Based Architectures: A Case Study
Authors: G. C. Cardarilli, F. Kaddour, A. Leandri, M. Ottavi, S. Pontarelli, R. Velazco
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper presents the principles of two different approaches for the study of the effect of transient bit flips on the behavior of processor-based digital architectures: one of them based on the on-line "injection" and execution of pieces of code (called CEU codes) using a suitable hardware architecture, while the other is performed using a behavioral level processor description, being based on the so-called "saboteurs" method. Results obtained for benchmark programs executed by a widely used commercial 8-bit microprocessor, allow to validate both approaches which provide inputs for an original error rate prediction methodology. The comparison of predictions to measured error rates issued from radiation ground testing validates the proposed error rate prediction approach.
The Sensitivity of the Matrix Exponential
Authors: Charles Van Loan
Venue:  (1976)

In this paper we examine how the matrix exponenetial $e^{At}$ is affected by perterbations in A. Elementary techniques using log norms and the Jordan and Schur factorizations indicate that $e^{At}$ is least sensitive when A is normal. Through the formulation of an exponential condition number, insight is gained into the connection between the condition of the eigensystem of A and the sensitivity of $e^{At}$.
Computer Science Curriculum for the Year 2000
Authors: Department Science
Venue:  (1990)

This report documents the initial phases of a study by members of the Brown Department of Computer Science for revision of its computer science curriculum. It is a working paper designed to stimulate discussion, both within the department and externally, prior to committing to a specific course of action. It is the basis for a departmental proposal to the National Science Foundation. By making these preliminary ideas available to a wider audience, we hope to contribute to the national debate concerning curriculum revision, and to obtain feedback for our own curriculum development. Comments on these ideas will be appreciated. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Resource-aware exploration of the emergent dynamics of simulated systems
Authors: Sven A. Brueckner, H. Van Dyke Parunak
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The emerging science of simulation enables us to explore the dynamics of large and complex systems even if a formal representation and analysis of the system is intractable and a construction of a real-world instantiation for the purpose of experimentation is too expensive. A computer simulation model can be run for many more configurations and the accumulated observations deepen our understanding of the system's operation, but it is very important that we have tools that help us manage the huge numbers of experiments that need to be run and the massive data sets that are collected. Furthermore, as we explore vast parameter spaces of simulation model, we need guidance in finding regions of interest in a resource efficient way.In this paper we use a model of agent-based graph coloring to introduce a software infrastructure for the systematic execution of experiments across large regions of parameter space (parameter sweep). Furthermore, we present a multi-agent system that searches large parameter spaces automatically for regions of interest specified by a fitness function. The fitness function captures the researcher's interest in certain system dynamics. We specify a function that searches for overlap regions that accompany phase changes in the simulation model. The agents search the parameter space by executing simulation experiments in regions of high fitness. As a consequence, the use of computational resources is minimized.
Communication in GLOBE: an object-based worldwide operating system
Authors: P. Homburg, M. van Steen, A. S. Tanenbaum
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Current paradigms for interprocess communication are not sufficient to describe the exchange of information at an adequate level of abstraction. They are either too low-level, or their implementations cannot meet performance requirements. As an alternative, we propose distributed shared objects as a unifying concept. These objects offer user-defined operations on shared state, but allow for efficient implementations through replication and distribution of state. In contrast to other object-based models, these implementation aspects are completely hidden from applications.
Programming with transactions and chemical abstract machine
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The coordination style programming language T-Cham extends chemical abstract machine (Cham) with transactions. The Cham is an interactive computational model based on chemical reaction metaphor, where a computation proceeds as a succession of chemical reactions. A transaction is a piece of sequentially executed codes and could be written in any language, such as C, Pascal, or Fortran etc., as long as it satisfies its pre-condition and post-condition. Every transaction begins its execution whenever its execution condition is satisfied. A T-Cham program can be executed in a parallel, distributed, or sequential manner based on the available computer resources.
Computer Architecture
Authors: William F. Gilreath, Phillip A. Laplante
Venue:  (2003)

:Computer Architecture: A Minimalist Perspective is designed to meet the needs of a professional audience composed of researchers, computer hardware engineers, software engineers, computational theorists, and systems engineers. The book is also intended for use by upper division undergraduate students and early graduate students studying computer architecture or embedded systems. It is an excellent text for use as a supplement or alternative in traditional Computer Architecture Courses or in courses entitled "Special Topics in Computer Architecture."
A Hardware and Software Monitor for High-Level System-on-Chip Verification
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Verification of today's Systems-on-Chip (SoC) occur at low abstraction-levels, typically at register-transfer level (RTL). As the complexity of SoC designs grows, it is increasingly important to move verification to higher abstraction-levels. Hardware/software co-simulation is a step in this direction, but is not sufficient due to inaccurate processor models, and slow hardware simulation speeds. System-level monitoring, commonly used for event-based software debugging, provides information about task scheduling events, inter-task communication and synchronisation, semaphores/resources, I/O interrupts, etc. We present MAMon, a monitoring system that can both monitor the logic-level and the system-level in single/multiprocessor SoCs. A small hardware probe-unit is integrated in the SoC design and connects via a parallel-port link to a host-based monitoring tool environment. The probe-unit collects all events in the target system in run-time, and timestamps them with a resolution of 1 µs. The events are then stored in a database on the host for further processing. The paper will describe MAMon and how it works for software and hardware monitoring. The paper also describe how system-level monitoring can be achieved non-instrusively by using a hardware-based Real-Time Kernel.
The site-perimeter of bargraphs
Authors: M. Bousquet-Mélou, A. Rechnitzer
Venue: Advances in Applied Mathematics (2003)

The site-perimeter enumeration of polyominoes that are both column- and row-convex is a well understood problem that always yields algebraic generating functions. Counting more general families of polyominoes is a far more difficult problem. Here we enumerate (by their site-perimeter) the simplest family of polyominoes that are not fully convex--bargraphs. The generating function we obtain is of a type that, to our knowledge, has never been encountered so far in the combinatorics literature: a q-series into which an algebraic series has been substituted.
A two-dimensional moving finite element method with local refinement based on a posteriori error estimates
Authors: Jens Lang, Weiming Cao, Weizhang Huang, Robert D. Russell
Venue: Applied Numerical Mathematics (2003)

In this paper, we consider the numerical solution of time-dependent PDEs using a finite element method based upon rh-adaptivity. An adaptive horizontal method of lines strategy equipped with a posteriori error estimates to control the discretization through variable time steps and spatial grid adaptations is used. Our approach combines an r-refinement method based upon solving so-called moving mesh PDEs with h-refinement. Numerical results are presented to demonstrate the capabilities and benefits of combining mesh movement and local refinement.
Short containers in Cayley graphs
Authors: Gao Shuhong, Hsu D. Frank
Venue:  (2001)

The star diameter of a graph measures the minimum distance from any source node to several other target nodes in the graph. For a class of Cayley graphs from abelian groups, a good upper bound for their star diameters is given in terms of the usual diameters and the orders of elements in the generating subsets. This bound is tight for several classes of graphs including hypercubes and directed $n$-dimensional tori. The technique used is the so-called disjoint ordering for a system of subsets, due to Gao, Novick and Qiu (1998).
A Comparison of Streams and Time Advance As Paradigms for Multimedia Systems
Authors: Roger B. Dannenberg, Dean Rubine
Venue:  (2001)

Keywords: Multimedia, streams, time advance, synchronization, audio, video, real time, operating systems 20 pages [FTP: CMU-CS-94-124.ps] A common model for multimedia systems is the stream, an abstraction representing the flow of continuous time-dependent data such as audio samples and video frames. The primary feature of streams is the ability to compose processes by making stream connections between them. An alternative time-advance model is related to discrete-event simulations. Data is computed in presentation order, but in advance of the actual presentation time. Timestamped, buffered data is subsequently output with low latency. The primary feature of time-advance systems is accurate output timing. Stream-based and time-advance systems are compared in terms of the programming model, flow control, buffering, support for interaction, synchronization, modularity issues, and real-time requirements.
A Formal Analysis of Dealock Behaviour in Workflows
Authors: Kiepuszewski A.H.M. ter Hofstede and B.
Venue:  (1999)

Although workflow management has established itself as an important area of research, little consensus has been reached as to what should be essential ingredients of a workflow specification language. As a result, the market is flooded with workflow management systems, based on different paradigms and using a large variety of concepts. It is not the intention of this paper to propose yet another workflow modelling language, rather, it seeks to formally define a collection of widely used workflow modelling concepts and to use their definition in an investigation of the deadlock properties of a number of commercially supported workflow modelling languages. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player