ppxscal/embedding_network huggingface dataset:
A Fine-Grain Parallelizing Compiler
Authors: Alexandru Nicolau
Venue:  (1986)

Percolation Scheduling (PS) is a new technique for compiling programs into parallel code. It attempts to overcome problems that limit the effectiveness and applicability of currently available techniques. PS globally rearranges code past basic block boundaries. Its core is a small set of simple, primitive program transformations defined in terms of adjacent nodes in a program graph. These transformations constitute the lowest level in a system of transformations and guidance rules. Higher levels of this hierarchy control and enhance the applicability of the core transformations and enable us to exploit both fine grained and coarse parallelism. Unlike other, more ad hoc approaches, PS is based on rigorous definitions of the computational model and of the core transformations. The correctness and termination of the transformations is proven here. The completeness of the transformations is also discussed. As a result our system implementation can proceed on a sound basis. In particular, PS enjoys greater adaptability and independence between the levels than would be possible otherwise. This has greatly facilitated the implementation of the first prototype version of our compiler, which is now complete. This paper describes PS in detail. The correctness aspects as well as illustrations of the effectiveness of our techniques are presented. Architectures which may benefit from the use of PS are also discussed.
Formal Specification of Virtual Process Topologies
Authors: Kamran Kazemi, Chris McDonald
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel programming environment provides high level abstractions for inter-process communication, relieving the application developer of the cumbersome task of mapping logical neighbors to their task identifiers within message passing systems. The novel approach of separating topological specification from the APIs provided extreme flexibility to the developers of the applications using regular topologies. We believed that the task of supporting process topologies could be made even easier and, in this paper, present our new method which uses recurrence relations to define topologies. Within the new environment, the recurrence relationships can be passed to the topology server, which then is used in the generation of the topological specification.
Digital Photography Special Effects
Authors: Michael Freeman
Venue:  (2002)

:Digital cameras and imaging technologies have exploded the boundaries of photography. A photograph is no longer a fixed image imbedded in film, but raw material that can then be edited and otherwise altered. Thanks to an array of image editing programs, filters, and plug-ins, photos can be easily corrected, manipulated, and enhanced. Creativity is now limited merely by artists imaginations and their technological expertise. Digital Photography Special Effects, from high-profile photographer and special effects wizard Michael Freeman, is a detailed, up-to-date guide that helps beginners as well as veteran photographers expand both their creative powers and their technological know-how. Freeman applies more than a decade of hands-on digital imaging experience to discuss the hardware, software, and photographic gear required to make a lasting impression with a digital photo. He explains the essential plug-ins, filters, and editing programs needed to enhance the raw material of a digital photograph, and he demonstrates the basic techniques an artist needs to know in order to use a digital camera to its full effect. Some 500 stunning full-color illustrations round out this important guide that makes the complexities of digital photography simple to understand, and the art of taking digital photos a pleasure for everyone to enjoy. Contains essential information required to master digital special effects Interest in digital photography continues to grow at a rapid pace, encompassing all skill levels Features jargon-free text and 500 stunning, full-color illustrations Michael Freeman is the author of the best-selling The Complete Guide to Digital Photography
Design and Analysis of Clusters with Single I/O Space
Authors: Roy S. C. Ho, Kai Hwang, Hai Jin
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Support of Single System Image (SSI) services is the main approach that enables better utilization of PC/workstation clusters. Some SSI services can be easily built with the support of other low-level, elementary, SSI services. In this paper, we describe Single I/O Space architecture for achieving a SSI at the I/O subsystem level. Furthermore, we demonstrate how the Single I/O Space can facilitate the development of other key SSI services. Typical SSI services, which can benefit from the Single I/O Space, include single file hierarchy, single memory space, checkpointing systems and single process space with process migration facilities. Benchmark performance results show that our design achieves both performance and storage size scalabilities that are essential to building I/O-intensive clusters.
A penetration analysis of the Michigan Terminal System
Authors: B. Hebbard, P. Grosso, T. Baldridge, C. Chan, D. Fishman, P. Goshgarian, T. Hilton, J. Hoshen, K. Hoult, G. Huntley, M. Stolarchuk, L. Warner
Venue: ACM SIGOPS Operating Systems Review (1980)

The successful penetration testing of a major time-sharing operating system is described. The educational value of such a project is stressed, and principles of methodology and team organization are discussed as well as the technical conclusions from the study.
A Lightweight Approach to Consistency of Scenarios and Class Models
Authors: Martin Glinz
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

Today, object-oriented requirements specifications typically combine a scenario (or use case) model and a class model for expressing functional requirements. With any such combination, the problem of consistency between these two models arises. In this paper, we present a lightweight approach to consistency between a scenario model and a class model. We assume semi-formal, loosely coupled models that are complementary: scenarios model the external system behavior; the class model specifies the internal, state-dependent functionality that cannot be expressed easily in a scenario (but is required to specify external behavior properly). We achieve consistency by minimizing overlap between the two models and by systematically cross-referencing corresponding information. We give a set of rules that can be used both for developing a consistent specification and for checking the consistency of a completed specification. Some rules can be checked automatically, the others are rules for manual inspection.
Water: Simplified Web Services and XML Programming, 1 edition
Authors: M. Plusch, Christopher Fry
Venue:  (2003)

:Here, by the co-creator of the language himself, is the ultimate guide to Water, an exciting, flexible new programming language designed to speed and simplify the way you develop Web services and applications. In these pages, Mike Plusch guides you through Water programming with hands-on tutorials and over 1,000 examples that include the source code and output. You'll discover how, by programming in XML syntax with Water, you can streamline the creation of complex Web services -- for example, how a complete Web service can be implemented in one line of code. Loaded with valuable code, this book is the next best thing to having the developer of Water on your staff.
Compact Representations of Logic Functions using Heterogeneous MDDs
Authors: Shinobu NAGAYAMA, Tsutomu SASAO
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In this paper, we propose a compact representationof logic functions using Multi-valued Decision Diagrams(MDDs) called heterogeneous MDDs. In a heterogeneousMDD, each variable may take a different domain. By partitioningbinary input variables and representing each partitionas a single multi-valued variable, we can produce aheterogeneous MDD with 16% smaller memory size than aReduced Ordered Binary Decision Diagram (ROBDD), andwith as small memory size as the Free Binary Decision Diagrams(FBDDs). We minimized a large number of benchmarkfunctions to show the compactness of heterogeneousMDDs.
How to Make Assured Service More Assured
Authors: Wei Lin, Rong Zheng, Jennifer C. Hou
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

In this paper, we study why the current assurance services (AS) architecture with profilers/markers at edge routers and with queue management mechanisms (RIO) at core routers cannot achieve throughput assurance and fairness. Based on the findings of the simulation study, we propose an enhanced version of the time sliding window (TSW) profiler, called the enhanced TSW (ETSW). We also design two enhanced versions of the RIO queue management mechanism, called respectively, the (r, RTT)-adaptive algorithm and the dynamic RIO (DRIO) algorithm, to improve the degree of throughput assurance and fairness for assured services. Both queue management mechanisms are derived based on rigorous, analytical reasoning. To validate the proposed design, we implement the proposed mechanisms, along with the 2-window TCP scheme [3] the three color-marker scheme [6], and the CSFQ scheme [11] in ns-2 [12], and examine their behavior under a variety of network topologies and traffic sources. The simulation results indicate that both DRIO and (r, RTT)-adaptive algorithms, when combined with ETSW, do fulfill more satisfactorily the throughput assurance and fairness requirements, especially under the case that AS flows require different target rates, incur different round trip times, or co-exist with non-responsive UDP flows.
Ternary Multiplication Circuits Using 4-Input Adder Cells and Carry Look-Ahead
Authors: Andreas Herrfeld, Siegbert Hentschke
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

We introduce a new implementation of a ternary adder with four inputs and two outputs. This ternary adder reduces the number of digits in a multiplication compared with a binary multiplication. One advantage of the ternary adder is that four instead of three inputs within a binary representation will be summed up. In this paper we will compare the complexity of binary against ternary multipliers. Timing diagrams will be given for the binary and the ternary case with an optimal order of the adder inputs. Finally, we present a ternary carry look-ahead circuit for a further reduction of total time delay.
A Complexity-Theoretic Approach to Incremental Computation
Authors: S. Sairam, Jeffrey S Vitter, Roberto Tamassia
Venue:  (1991)

We present a new complexity-theoretic approach to incremental computation. We define complexity classes that capture the intuitive notion of incremental efficiency and study their relation to existing complexity classes. We show that all common logs p-complete problems for poly are incrplt-complete for poly. This suggests that non-redundant problems that seem inherently unparallelizable also seem hard to dynamize. We show that a form of transitive closure is complete under incremental reduction for nlgsp and give similar problems which are incrementally complete for the classes logsp and non-uniform nick. We show that under certain restrictions problems which have efficient dynamic solutions also have efficient parallel solutions. We also look at the time complexity of circuit value and network stability problems restricted to comparator gates. We show that the dynamic version of the comparator-circuit value problem and ``Lex-First Maximal Matching'''' problem is in logsp and that of the comparator-network stability problem and ``Man-Optimal Stable Marriage Problem'''' is in logsp given an oracle which operates in nlgsp. This shows that the dynamic versions of these problems are solvable quickly in parallel even though there are no known nick algorithms to solve them from scratch.
On the Performance of k-ary n-cube Interconnection Networks
Authors: William J. Dally
Venue:  (1986)

The performance of k-ary n-cube interconnection networks is analyzed under the assumption of constant wire bisection. It is shown that low-dimensional k-ary n-cube networks (e.g., tori) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width.
Measuring the Cost of Storage Management
Authors: David Tarditi, Amer Diwan
Venue:  (1995)

We study the cost of storage management for garbage-collected programs compiled with the Standard ML of New Jersey compiler. We show that the cost of storage management is not the same as the time spent garbage collecting. For many of the programs, the time spent garbage collecting is less than the time spent doing other storage-management tasks.
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms
Authors: Paris C. Kanellakis, Dimitris Michailidis, Alex A. Shvartsman
Venue:  (1994)

The CRCW PRAM under dynamic fail-stop (no restart) processor behavior is a fault-prone multiprocessor model for which it is possible to both guarantee reliability and preserve efficiency. To handle dynamic faults some redundancy is necessary in the form of many processors concurrently performing a common read or write task. In this paper we show how to significantly decrease this concurrency by bounding it in terms of the number of actual processor faults. We describe a low concurrency, efficient and fault-tolerant algorithm for the Write-All primitive: ``using $\leq N$ processors, write 1''s into $N$ locations''''. This primitive can serve as the basis for efficient fault-tolerant simulations of algorithms written for fault-free PRAMs on fault-prone PRAMs. For any dynamic failure pattern $F$, our algorithm has total write concurrency $\leq |F|$ and total read concurrency $\leq 7\,|F|\log N$, where $|F|$ is the number of processor faults (for example, there is no concurrency in a run without failures); note that, previous algorithms used $\Omega(N \log N)$ concurrency even in the absence of faults. We also describe a technique for limiting the per step concurrency and present an optimal fault-tolerant EREW PRAM algorithm for Write-All, when all processor faults are initial.
Application of the M/Pareto Process to Modeling Broadband Traffic Streams
Authors: Timothy D. Neame, Moshe Zukerman, Ronald G. Addie
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In this paper we examine the usefulness of the M/Pareto process as a model for broadband traffic. We show that the queuing performance of the M/Pareto process depends upon the level of aggregation in the process. When the level of aggregation is high, the M/Pareto converges to a long range dependent Gaussian process. For lower levels of aggregation, the M/Pareto is capable of modeling the queuing performance of real broadband traffic traces.
Accelerating Internet Streaming Media Delivery using Network-Aware Partial Caching
Authors: Shudong Jin, Azer Bestavros, Arun Iyengar
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Internet streaming applications are affected by adverse network conditions such as high packet loss rates and long delays. This paper aims at mitigating such effects by leveraging the availability of client-side caching proxies. We present a novel caching architecture and associated cache management algorithms that turn edge caches into accelerators of streaming media delivery. A salient feature of our caching algorithms is that they allow partial caching of streaming media objects and joint delivery of content from caches and origin servers. The caching algorithms we propose are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit-rate requirements, and the available bandwidth between clients and servers. Using realistic models of Internet bandwidth derived from proxy cache logs and measured over real Internet paths, we have conducted simulations to evaluate the performance of various cache management alternatives. Our experiments demonstrate that network-aware caching algorithms can significantly reduce service delay and improve overall stream quality. Our experiments also show that partial caching is particularly effective when bandwidth variability is not very high.
Accuracy of Profile Maintenance in Optimizing Compilers
Authors: Youfeng Wu
Venue: Proceedings of the Sixth Annual Workshop on Interaction between Compilers and Computer Architectures (2002)

Modern processors rely heavily on optimizing compilers to deliver their performance potentials. The compilers on the other hand rely greatly on profile information to focus the optimization efforts and to better match the generated code with the target machines. Maintaining the profile in optimizing compiler is important as many optimizations can benefit from the profile information and they often are performed one after the other. Maintaining a profile is however tedious and error-prone. Erroneous profile is not easy to detect as it affects only the performance, not the correctness, of a program. Maintaining a profile also inherently loses accuracy, as the profile update operations often have to use probabilistic approximation. In this paper, we measure the accuracy of maintaining CFG profiles in a high-performance optimizing compiler. Our data indicates that the compiler maintains the profile more accurately within individual functions than globally across functions, and function inlining may be responsible for the loss of profile accuracy globally. We also identify a number of research issues related to profile maintenance.
Knowledge-based simulation of regulatory action in lambda phage
Authors: T. Shimada, M. Hagiya, M. Arita, S.-Y. Nishizaki, Chew Lim Tan
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

We have developed a knowledge-based, discrete-event simulation system to simulate proteins-regulated genetic action in lambda phage. Lambda phage is a kind of virus which infects Escherichia coli (E. Coli). Specifically, we simulate the decision between two developmental pathways, that is, lytic growth and lysogenic growth on such conditions as mutation. The novelty of this work is the employment of two different levels of abstraction in a genetic model for the purpose of achieving greater precision. Our model is composed of a roughly abstracted level for the noncritical parts which constitute most parts of our model, and a precisely abstracted level for the critical parts. In the former level, our model is a discrete-event simulation in qualitative representation on a knowledge-based system. In the latter level, it is based on reaction formulae in quantitative representation.
The Design of a Unified Package for the Solution of Stochastic Petri Net Models
Authors: B J Dugan, Andrea Bobbio, Gianfranco Ciardo, S K Trivedi
Venue:  (1984)

This paper describes the philosophical differences between three current SPN models in an attempt to merge the most important (and non-contradictory) aspects into one. It previews the design of a package for the solution of this unified model.
Some algorithms for solving special tridiagonal block Toeplitz linear systems
Authors: Borislav V. Minchev
Venue: Journal of Computational and Applied Mathematics (2003)

This paper is focused on different methods and algorithms for solving tridiagonal block Toeplitz systems of linear equations. We consider the El-Sayed method (Ph.D. Thesis, 1996) for such systems and propose several modifications that lead to different algorithms, which we discuss in detail. Our algorithms are then compared with some classical techniques as far as implementation time is concerned, number of operations and storage. Comments and conclusions for computing efficiency of the proposed new algorithms are given. Numerical experiments corroborating the theoretical results are also presented.
Development of a Link Layer Protocol Using UML
Authors: K. Chandra Sekaran
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper presents a report on the development of a link layer protocol using an object oriented formal method. It describes the steps involved in the conceptualization, analysis and design of the L2CAP (Logical Link Control and Adaptation Layer Protocol) of the Bluetooth architecture. UML (Unified Modeling Language) is the formal modeling language used in this work. It has been shown how the static, dynamic and operational aspects of the system are captured using various UML diagrams.
Basis Sets for Geometry Optimizations of Second-Row Transition Metal Inorganic and Organometallic Complexes
Authors: Andrew L. Sargent, Michael B. Hall
Venue:  (1991)

Modest-sized basis sets for the second-row transition metal atoms are developed for use in geometry optimization calculations. Our method is patterned after previous work on basis sets for first-row transition metal atoms. The basis sets are constructed from the minimal basis sets of Huzinaga and are augmented with a set of diffuse p and d functions. The exponents of these diffuse functions are chosen to minimize both the difference between the calculated and experimental equilibrium geometries and the total molecular energies for several second-row transition metal inorganic and organometallic complexes. Slightly smaller basis sets, based on the same Huzinaga minimal sets but augmented with a set of diffuse s and p functions rather than diffuse p and d functions, are also presented. The performance of these basis sets is tested on a wide variety of second-row transition metal inorganic and organometallic complexes and is compared to pseudopotential basis sets incorporating effective core potentials.
A Fast Algorithm for Finding k-Nearest Neighbors with Non-Metric Dissimilarity
Authors: Bin Zhang, Sargur N. Srihari
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Fast nearest neighbor (NN) finding has been extensively studied. While some fast NN algorithms using metrics rely on the essential properties of metric spaces, the others usingnon-metric measures fail for large-size templates. However, in some applications with very large size templates, the best performance is achieved by NN methods based on the dissimilaritymeasures resulting in a special space where computations cannot be pruned by the algorithms based-on the triangular inequality. For such NN methods, the existing fast algorithms except condensing algorithms are not applicable. In this paper, a fast hierarchical search algorithm is proposed to find k-NNs using a non-metric measure in a binary feature space. Experiments with handwritten digit recognition show that the new algorithm reduces on average dissimilarity computations by more than 90% while losing the accuracy by less than 0:1%, with a 10% increase in memory.