ppxscal/embedding_network huggingface dataset:
Efficiency of remote access caches in future SMP-based CC-NUMA multiprocessors: initial results
Authors: E. D. Moreno, S. T. Kofuji
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The paper evaluates the benefits of adding a shared remote access cache (RAC) in SMP based CC-NUMA multiprocessors. We consider symmetric multiprocessor (SMP) nodes as the building blocks for a multiprocessor due to its cost effectiveness, which makes SMP nodes an attractive choice for CC-NUMA designers. We base our experimental evaluation of the future architectures on realistic hardware parameters for state of the art systems components. What distinguishes our work from previous research is that we consider future processors and adequate values to access time to memory/caches/RACs, network and SMP bus speed. We simulate six applications from the SPLASH-2 benchmark suite to compare the performance application of our baseline architecture (current machines) and future architectures (approach-1: slow network and approach-2: fast network) when RACs are used in the system. The simulation results show that for a 32-processor system based on four-processor SMP nodes, the RACs improve the overall system performance by up to 32%, 28% and 20% for our baseline, approach-1, and approach-2, respectively. Similarly, the RACs diminish the execution time by up to 35%, 28.2% and 22% for two-processor SMP nodes. Therefore, our principal conclusion is that RACs reduce the execution time in future systems which have four or two 500 MHz processors per node.
Some Estimates with Nonconforming Elements in the Analysis of Domain Decomposition Methods
Authors: Jin Gu, Zian Hu
Venue:  (1995)

The goal of this paper is to establish some essential estimates, especially the so-called extension theorem, for the nonconforming finite elements with their continuity only at the vertices or the edge midpoints of the elements of the quasi-uniforming mesh[4,5,6,13,14,21]. As in the conforming discrete cases[2,3,20], these estimates play key roles in the analysis of nonoverlap domain decomposition methods with nonconforming elements[8,9,11,12]. It is well-known that the regularity of the solution of an elliptic problem depends on the smoothness of the domain and the boundary condition[7,15,16]. In Sect.1, we present advanced error estimates of the nonconforming approximate solution under weaker assumption on the regularity, based on the second Strang lemma[5]. In Sect.2, we construct and analyse the conforming interpolation operator I_h, which acts as a bridge between the nonconforming element spaces and the conforming element spaces. Based on the results of Sect.1 and Sect.2, plus the known estimates for the conforming element spaces[2,5,18], we obtain, in Sect.3, a series of fundamental inequalities for the nonconforming element spaces, some of which are the extension theorem[8,10], the Poincare inequalities and the maximum norm estimate. We must point out that their applications are omitted here for the length of the present paper, which can be referred to [8,9,11,12].
Symbolic Debugging of Globally Optimized Code: Data Value Problems and Their Solutions
Authors: Ali Adl-Tabatabai, Thomas Gross
Venue:  (1994)

Symbolic debuggers are program development tools that allow a user to interact with an executing process at the source level. In response to a user query, the debugger must be able to retrieve and display the value of a source variable in a manner consistent with what the user expects with respect to the source statement where execution has halted. However, when a program has been compiled with optimizations, values of variables may either be inaccessible in the run-time state or inconsistent with what the user expects. Such problems that pertain to the retrieval of source values are called data value problems. In this paper we address the data value problems caused by global scalar optimizations. We describe in detail how global optimizations cause data value problems and the information a symbolic debugger can provide a user when data value problems occur. We provide a data flow algorithm that detects the impact of two global transformations: code hoisting and dead code elimination. These two transformations capture the effects of global optimizations that cause data value problems. Common optimizations such as dead store elimination, common subexpression elimination, loop invariant code motion, partial redundancy elimination, or non-speculative global instruction scheduling can be expressed in terms of these transformations. Symbolic debugging, endangered variables, suspect variables, noncurrent variables, compiler optimization, data flow analysis
On isomorphisms between the lattice of tolerance relations and lattices of clusterings
Authors: H. Thiele
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

By "mathematical foundations of cluster analysis" we understand the study of (one-to-one) correspondences between "similarity relations" on a given universe U and "clusterings" an U. From classical set theory such correspondences are well-known as bijections and lattice isomorphisms between the set and the lattice of all equivalence relations on a universe U and the set and the lattice of all partitions of U, respectively. In this paper we show that the lattice (even the complete atomistic boolean algebra) of all (crisp!) tolerance relations on U is isomorphic to the lattice (even the complete atomistic boolean algebra) of all subset closed strongly model-compact coverings of U, on the one hand, and to the lattice (even the complete atomistic boolean algebra) of all tolerance coverings, on the other hand.
ARCH, An Object-Oriented Library for Asynchronous and Loosely Synchronous System Programming
Authors: Jean Adamo
Venue:  (1995)

ARCH is a C++-based library for asynchronous and loosely synchronous system programming. The current version offers a set of programming constructs that are outlined below: Threads. The construct is presented as a class from which the user can derive his own classes. The class encapsulates a small set of status variables and offers a set of functions for declaration, initialization, scheduling, priority setting, yielding and stopping. Processes. A process is a more regular and structured programming construct whose scheduling and termination obey additional synchronization rules. Together with the synchronous point-to-point communication system offered in the library (see below), processes favor a parallel programming style similar to OCCAM''s (actually, an extension of it that removes most static features and allows processes to share data). The semantics of this model is well understood and will undoubtedly facilitate the development of correct large asynchronous code. The library has been designed so that the C++ compiler is able to check the static semantics of programs (complete type checking, send-recv correct matching, ...). Synchronous communication. Threads and processes synchronize and communicate via communication channels. There are four types of communication channels for local or remote synchronization or synchronous point-to-point communication. Inter-processor channels are essentially tools for building virtual topologies. The channel classes offer functions to send to or receive from a channel and get the size of the latest received message. More specialized synchronization-communication tools can be derived from channels. Global data and pointers. Beside threads, the library offers basic tools for developing distributed data abstractions. Global data are data that can be defined at given locations in the distributed memory but are visible from all processors. Global pointers are a generalization of C++ pointers that allow for addressing global data at any place over the distributed memory. As usual pointers, global pointers are subjected to arithmetic and logic manipulations (incrementation, dereferencing, indexing, comparision...). The library provides basic operators for global data and pointer definition. Global read/write functions. Global pointer expressions provide global references over the distributed memory that can subsequently be used as arguments to global read/write functions. These functions allow the processors to get access to all global data regardless of their locations over the distributed memory. In their most complete form, the read/write functions operate as remote procedure calls. At the programmer''s level, global read/write functions appear as "one-sided": a read/write operation is executed on the processor that needs to read/write global data but need not be explicitly handled by the processor associated to the memory holding the data. Spread and remote Arrays. Two basic distr
Connect Online!, Student Edition, 1 edition
Authors: Lynne Schrum
Venue:  (2002)

New! Introduce yourself to Jay, Peg, and their spotted dog, Link, in Glencoe’s new computer education textbook, Connect Online: Web Learning Adventures. Connect Online introduces students to the Internet through the use of hands-on activities and by visiting various websites. Students are introduced to the various tools and methods for communicating and researching on the Internet and World Wide Web. They also learn to explore the Internet through integrated activities in math, science, global studies, language arts, and other topics. Table of contents1 First Things First: Getting Started 2 Window to the Web: Navigating and Browsing 3 Talking to the World: Electronic Mail and More 4 Working with Others: Forums, Chats, and Experts 5 Where In the World is ... Search and Research 6 Write Now: Language Arts 7 Count on It: Math Matters 8 Dissecting the Secrets: Science 9 World Wonders: Global Issues Social Studies 10 Cross-Curricular Activities: Antarctica Adventure 11 School Web Sites: Give It a Try 12 The Power of Kids: Art, Careers, Health, Geography 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
Implementing and Evaluating an Efficient Dynamic Load-Balancer for Distributed Molecular Dynamics Simulation
Authors: Naohito Sato, Jean-Marc Jézéquel
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

This paper introduces and evaluates a new efficient dynamic load-balancing scheme for parallel molecular dynamics simulation on distributed memory machines. It decomposes a spatial domain of particles into disjoint parts, each of which corresponds with a processor and dynamically changes its shape to keep almost the same number of particles throughout simulation.In contrast to other similar schemes, ours requires no long-distance inter-processor communications but only those among adjacent processors (thus little communication overheads), whereas it still guarantees fast reduction of load-imbalance among the processors. It owes these advantages mainly to the following features: (1) The sufficiently correct global load information is effectively obtained with step-wise propagation of appropriate information via nearest neighbor communication.(2) In addition to the global load-balancing, another load-balancing procedure is also invoked on each processor without global load information in order to suppress rapid increase or decrease of loads.Thus, information from remote processors can provide reliable values even after a certain period of delay. To evaluate effectiveness of our scheme, we have integrated our load-balancer into the publicly available NAMD simulation system, through replacing its built-in load-balancing component. Preliminary experiments on a cluster of workstations connected through Myrinet switches shows it successfully reduces load-imbalance and improves performance of simulation.
Temperature-aware microarchitecture
Authors: Kevin Skadron, Mircea R. Stan, Wei Huang, Sivakumar Velusamy, Karthik Sankaranarayanan, David Tarjan
Venue: ACM SIGARCH Computer Architecture News (2003)

With power density and hence cooling costs rising exponentially, processor packaging can no longer be designed for the worst case, and there is an urgent need for runtime processor-level techniques that can regulate operating temperature when the package's capacity is exceeded. Evaluating such techniques, however, requires a thermal model that is practical for architectural studies.This paper describes HotSpot, an accurate yet fast model based on an equivalent circuit of thermal resistances and capacitances that correspond to microarchitecture blocks and essential aspects of the thermal package. Validation was performed using finite-element simulation. The paper also introduces several effective methods for dynamic thermal management (DTM): "temperature-tracking" frequency scaling, localized toggling, and migrating computation to spare hardware units. Modeling temperature at the microarchitecture level also shows that power metrics are poor predictors of temperature, and that sensor imprecision has a substantial impact on the performance of DTM.
Chopping: A Generalization of Slicing
Authors: Daniel Jackson, Eugene J. Rollins
Venue:  (1994)

A new method for extracting partial representations of a program is described. Given two sets of variable instances, source and sink, a graph is constructed showing the statements that cause definitions of source to affect uses of sink. This criterion can express a wider range of queries than the various forms of slice criteria, which it subsumes as special cases. On the standard slice criterion (backward slicing from a use or definition) it produces better reults than existing algorithms. The method is modular. By treating all statements abstractly as def-use relations, it can present a procedure call as simple statement, so that it appears in the graph as a single node whose role may be understood without looking beyond the context of the call.
Adobe PhotoShop 7: Virtual Classroom
Authors: Ken Milburn
Venue:  (2002)

:Text and multimedia combine to create the ultimate learning experience! This large-format, illustrated guide presents instructional material in an easy-to-follow styleand the CD-ROM features the author speaking directly to you. Using a combination of moving screenshots, animation, and audiovisual presentations, he'll teach you how to use Adobe Photoshop in no time!
A Region-Based Compilation Infrastructure
Authors: Yang Liu, Zhaoqing Zhang, Ruliang Qiao, Roy Dz-ching Ju
Venue: Proceedings of the Seventh Workshop on Interaction between Compilers and Computer Architectures (2003)

The traditional framework for back-end compilation isbased on the scope of functions, which is a naturalboundary to partition an entire program for compilation.However, the sizes and structures of functions may not bethe best scope for program analyses and transformationswhen considering compilation resources (e.g. time andspace), performance, and functionality. This problem isparticularly pronounced when modern compileroptimizations resort to sophisticated and expensivealgorithms to aim at high performance computing.Furthermore, it is often beneficial to give priority tooptimize the more profitable portions of programs. Earlierworks have proposed ways to allow some control on the sizeand structure of optimization scope. In this paper, wedevelop a new region-based compilation framework drivenby the considerations of performance opportunities andcompilation resources. In addition, we allow someoptimization-directed attributes communicated from oneoptimization phase to another on a region basis to guidesubsequent optimizations. This region-based frameworkhas been implemented in the Open Research Compilertargeting Itanium. Processor Family (IPF). Experimentalresults from the SPEC2000Int programs show that thisinfrastructure provides an effective control on formingregions to meet the requirements of different optimizations.For example, the compilation time of instruction schedulingis significantly reduced by this region formationinfrastructure while preserving or improving the overallperformance. At the highest optimization level, theperformance of eon program has a 15.6% improvement byemploying this region-based infrastructure.
Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families
Authors: Saks Michael, Srinivasan Aravind, Zhou Shiyu, Zuckerman David
Venue:  (1999)

Motivated by a problem of filtering near-duplicate Web documents, Broder, Charikar, Frieze \& Mitzenmacher defined the following notion of {\em $\epsilon$-approximate min-wise independent permutation families}. A multiset ${\cal F}$ of permutations of $\{0,1,\ldots,n-1\}$ is such a family if for all $K \subseteq \{0,1,\ldots,n-1\}$ and any $x \in K$, a permutation $\pi$ chosen uniformly at random from ${\cal F}$ satisfies $$|\ \Pr[\min\{\pi(K)\}=\pi(x)]-{1\over |K|}\ |\le{\eps\over |K|}.$$ We show connections of such families with {\em low discrepancy sets for geometric rectangles}, and give explicit constructions of such families ${\cal F}$ of size $n^{O(\sqrt{\log n})}$ for $\eps=1/n^{\Theta(1)}$, improving upon the previously best-known bound of Indyk. We also present polynomial-size constructions when the min-wise condition is required only for $|K| \le 2^{O(\log^{2/3} n)}$, with $\epsilon \geq 2^{-O(\log^{2/3} n)}$.
Conditional Chromatic Numbers with Forbidden Cycles
Authors: Karen Casey, Kathryn Fraughnaugh
Venue:  (1993)

The conditional chromatic number X(G,P) of a graph G with respect to a graphical property P is the minimum number of colors needed to color the nodes of G such that each color class induces a subgraph of G with property P. The conditional chromatic number with respect to various properties has been studies by numerous authors. We investigate X(G,P) where P is the property of having no cycle of length j for fixed j<=3. We find the conditional chromatic number with forbidden cycles for graphs of large size and for all graphs with order at most six.
Type-Theoretic Methodology for Practical Programming Languages
Authors: Karl Crary
Venue:  (1998)

The significance of type theory to the theory of programming languages has long been recognized. Advances in programming languages have often derived from understanding that stems from type theory. However, these applications of type theory to practical programming languages have been indirect; the differences between practical languages and type theory have prevented direct connections between the two. This dissertation presents systematic techniques directly relating practical programming languages to type theory. These techniques allow programming languages to be interpreted in the rich mathematical domain of type theory. Such interpretations lead to semantics that are at once denotational and operational, combining the advantages of each, and they also lay the foundation for formal verification of computer programs in type theory. Previous type theories either have not provided adequate expressiveness to interpret practical languages, or have provided such expressiveness at the expense of essential features of the type theory. In particular, no previous type theory has supported a notion of partial functions (needed to interpret recursion in practical languages), and a notion of total functions and objects (needed to reason about data values), and an intrinsic notion of equality (needed for most interesting results). This dissertation presents the first type theory incorporating all three, and discusses issues arising in the design of that type theory. This type theory is used as the target of a type-theoretic semantics for a expressive programming calculus. This calculus may serve as an internal language for a variety of functional programming languages. The semantics is stated as a syntax-directed embedding of the programming calculus into type theory. A critical point arising in both the type theory and the type-theoretic semantics is the issue of admissibility. Admissibility governs what types it is legal to form recursive functions over. To build a useful type theory for partial functions it is necessary to have a wide class of admissible types. In particular, it is necessary for all the types arising in the type-theoretic semantics to be admissible. In this dissertation I present a class of admissible types that is considerably wider than any previously known class.
The Brown Workstation Environment: A User Interface Design Toolkit
Authors: Steven P. Reiss, John T. Stasko
Venue:  (1989)

The Brown Workstation Environment is a graphics toolkit that currently runs on top of the X Window System. It provides an extensive set of graphics management programming tools for simple input and output, menus, windows, text editing, terminal emulation, and structured diagrams. Its implementation stresses ease of use by the programmer by providing higher-level, simplified packages as well as the usual low-level components.
A Bayesian Approach to Reliability Prediction and Assessment of Component Based Systems
Authors: H. Singh, V. Cortellessa, B. Cukic, E. Gunel, V. Bharadwaj
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

It is generally believed that component-based software development leads to improved application quality, maintainability and reliability. However, most software reliability techniques model integrated systems. These models disregard system's internal structure, taking into account only the failure data and interactions with the environment.We propose a novel approach to reliability analysis of component-based systems. Reliability prediction algorithm allows system architects to analyze reliability of the system before it is built, taking into account component reliability estimates and their anticipated usage. Fully integrated with the UML, this step can guide the process of identifying critical components and analyze the effect of replacing them with the more/less reliable ones. Reliability assessment algorithm, applicable in the system test phase, utilizesthese reliability predictions as prior probabilities. In the Bayesian estimation framework, posterior probability of failure is calculated from the priors and test failure data.
Fault Characterization and Testability Considerations in Multi-Valued Logic Circuits
Authors: Mostafa Abd-El-Barr, Maher Al-Sherif, Mohamed Osman
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

With the growing interest and the emergence of various implementations of Multiple-Valued logic (MVL) circuits, testability issues of these circuits are becoming crucial. Fault characterization is an early step in the test generation process. It is aimed at finding fault models that best describe the possible faults expected to occur in a given class of circuits or technology. Layout and device level studies on CMOS and BiCMOS circuits revealed that the stuck-at model is not adequate to represent the actual physical defects. In this paper, our aim is to characterize faults in a CMOS functionally complete set of MVL operators. The set has been implemented using existing standard binary CMOS technology. This enables us to characterize faults in these operators using the same techniques used for standard binary CMOS. Fault categories in MVL circuits and recommendations for testability will be given.