ppxscal/embedding_network huggingface dataset:
An evaluation of speculative instruction execution on simultaneous multithreaded processors
Authors: Steven Swanson, Luke K. McDowell, Michael M. Swift, Susan J. Eggers, Henry M. Levy
Venue: ACM Transactions on Computer Systems (TOCS) (2003)

Modern superscalar processors rely heavily on speculative execution for performance. For example, our measurements show that on a 6-issue superscalar, 93&percnt; of committed instructions for SPECINT95 are speculative. Without speculation, processor resources on such machines would be largely idle. In contrast to superscalars, simultaneous multithreaded (SMT) processors achieve high resource utilization by issuing instructions from multiple threads every cycle. An SMT processor thus has two means of hiding latency: speculation and multithreaded execution. However, these two techniques may conflict; on an SMT processor, wrong-path speculative instructions from one thread may compete with and displace useful instructions from another thread. For this reason, it is important to understand the trade-offs between these two latency-hiding techniques, and to ask whether multithreaded processors should speculate differently than conventional superscalars.This paper evaluates the behavior of instruction speculation on SMT processors using both multiprogrammed (SPECINT and SPECFP) and multithreaded (the Apache Web server) workloads. We measure and analyze the impact of speculation and demonstrate how speculation on an 8-context SMT differs from superscalar speculation. We also examine the effect of speculation-aware fetch and branch prediction policies in the processor. Our results quantify the extent to which (1) speculation is critical to performance on a multithreaded processor because it ensures an ample supply of parallelism to feed the functional units, and (2) SMT actually enhances the effectiveness of speculative execution, compared to a superscalar processor by reducing the impact of branch misprediction. Finally, we quantify the impact of both hardware configuration and workload characteristics on speculation's usefulness and demonstrate that, in nearly all cases, speculation is beneficial to SMT performance.
Convergence of Algebraic Multigrid Based on Smoothed Aggregation
Authors: Marian Brezina, Jan Mandel, Petr Vanek
Venue:  (1998)

We prove aconvergence estimate for the Algebraic Multigrid Method with prolongations defined by aggregation using zero energy modes, followed by a smoothing. The method input is the problem matrix and a matrix of the zero energy modes. The estimate depends only polylogarithmically on the mesh size, and requires only a weak approximation property for the aggregates, which can be a-priori verified computationally. Construction of the prolongator in the case of a general second order system is described, and the assumptions of the theorem are verified for a scalar problem discretized by linear conforming finite elements.
Towards a 3D Visualization Framework for Construction Planning with Procession
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The construction industry traditionally uses two dimensional visualization techniques to analyze project progress. This usually takes the form of an 's-curve', so-called because of the characteristic plot shape (anecdotally generated by resource application take-up in many projects). Analyzing project progress in this manner provides a 'single view' guide to data trends. The building blocks of projects are 'tasks'. Deeper interpretation of a project might require studying individual s-curves for each task. Indicative patterns can go unrecognized in this mass of unfiltered visual data. 'Procession' is an information visualization software tool. It has been developed to provide a more comprehensive representation of project progress, utilizing a three-dimensional data surface. In addition to offering a 'single view' navigable data-surface, Procession also intelligently filters and emphasizes tasks, according to the significance of their deviant performance parameters. 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
Harmonization of software engineering and system engineering standards
Authors: R. Singh
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Software is increasingly performing vital functions in systems such as consumer products, military, telecommunication, medical, and banking. However, software engineering and conventional engineering have not been integrated into a cohesive and concurrent system engineering. Consequently, software engineering is essentially developing on its own and does not fully participate in hardware/software tradeoff analyses and does not fully contribute to the system at its full potential. The article presents such system software relationship issues and presents some initial solutions that might be implemented to improve the situation.
Design and Analysis of Multi-User Benchmarks for Database Systems
Authors: Dina Bitton, Carolyn Turbyfill
Venue:  (1984)

NOT SUPPLIED
Macromedia Dreamweaver 4 Description: Here Is a Guide That Provides Both Basic and Advanced Instructions for Designing a Web Site without the Use of Javascript or HTML. Professional Web Designers and Those Creating Their First Web
Authors: Francisco Pascual Gonzalez
Venue:  (2002)

:Here is a guide that provides both basic and advanced instructions for designing a Web site without the use of JavaScript or HTML. Professional Web designers and those creating their first Web sites will find that the many examples, sample projects, and insider tricks and tips will make it easy to master this simple method.Para disenadores y usuarios domesticos, este libro ofrece un metodo sencillo de aprendizaje que incluye ejemplos, trucos, utilidades y dos macroejercicios, uno nivel basico y otro mas avanzado. Todo ello permite disenar sitios Web completos, sin necesidad de conocer lenguajes de programacion como HTML o Javascript."Franciso Pascual is the author of Netscape Communicator 4 and Access 97: Guía de campo. 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
Automated Stream-Based Analysis of Fault-Tolerance
Authors: Scott Stoller, Fred B. Schneider
Venue:  (1998)

A rigorous, automated approach to analyzing fault-tolerance of distributed systems is presented. The method is based on a stream model of computation that incorporates approximation mechanisms. One application is described: a protocol for fault-tolerant
Multiple View Geometry in Computer Vision, 2 edition
Authors: Richard Hartley, Andrew Zisserman
Venue:  (2003)

:A basic problem in computer vision is to understand the structure of a real world scene given several images of it. Recent major developments in the theory and practice of scene reconstruction are described in detail in a unified framework. The book covers the geometric principles and how to represent objects algebraically so they can be computed and applied. The authors provide comprehensive background material and explain how to apply the methods and implement the algorithms directly.
Misperception, communication and diversity
Authors: Jin Akaishi, Takaya Arita
Venue: Proceedings of the eighth international conference on Artificial life (2002)

It is commonly agreed upon that misperception is detrimental. However, misperception might have a beneficial effect from a collective viewpoint when individuals mis-percept incoming information that promotes a specific kind of behavior, which leads to an increase in diversity. First, this paper proposes our hypothesis regarding adaptive property of misperception based on the argument of the relationship between misperception and behavioral diversity, and the effects of communication on diversity. Then, a simple computational model is constructed for a resource-searching problem by using the multi-agent modeling method. We investigate both direct misperception, that are caused when obtaining information directly from surrounding environment, and indirect misperception, that are caused when obtaining information indirectly through communication by conducting simulation experiments. The experimental results have shown that misperception could increase diversity in behavior of agents, thus could be adaptive, while accurate communication could decrease a diversity of agent behavior, which might decrease fitness. This paper also discusses a correlative relationship between direct misperception and indirect misperception. We believe that the study on adaptive property of misperception based on an innovative frame of reference and a powerful methodology in the field of complex system or artificial life would shed light on fundamental issues in cognitive science, memetics and engineering.
Optimal Isosurface Extraction from Irregular Volume Data
Authors: Paolo Cignoni, Claudio Montani, Enrico Puppo, Roberto Scopigno
Venue:  (1996)

A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a data structure called interval tree, which encodes a set of intervals on the real line, and supports efficient retrieval of all intervals containing a given value. Each cell in the volume data is associated with an interval bounded by the extreme values of the field in the cell. All cells intersected by a given isosurface are extracted in O(m + log h) time, with m the output size and h the number of different extreme values (min or max). The implementation of the method is simple. Tests have shown that its practical performance reflects the theoretical optimality. EMAIL:: r.scopigno@cnuce.cnr.it
The Specification-Based Testing of a Trusted Kernel: MK++
Authors: Richard L. Ford, Richard T. Simon, William R. Bevier, Lawrence M. Smith
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

The MK++ kernel, a descendant of Mach, was designed and implemented at the Open Group Research Institute. Independently, Computational Logic had developed a formal specification for the Mach kernel interface. We report on the adaptation of this specification to MK++, and its use in the derivation of a testing strategy for the MK++ implementation. The results and utility of the tests are discussed.
Determining an Out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programming
Authors: Thomas H. Cormen
Venue:  (1997)

We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. Our algorithm uses a recursive divide-and-conquer strategy, and each stage in the recursion presents several possibilities for how to split the problem into subproblems. We give a recurrence for the algorithm''s I/O complexity on the Parallel Disk Model and show how to use dynamic programming to determine optimal splits at each recursive stage. The algorithm to determine the optimal splits takes only Theta(lg^2 N) time for an N-point FFT, and it is practical. The out-of-core FFT algorithm itself takes considerably longer.
HighLAP: a high level system for generating, representing, and evaluating assembly sequences
Authors: F. Rohrdanz, H. Mosemann, F. M. Wahl
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In this paper we present our high level assembly planning system HighLAP. HighLAP generates and evaluates all assembly sequences of a mechanical assembly with minimal user interaction. For the evaluation of all feasible assembly sequences several criteria are taken into account. HighLAP considers for example the separability and the manipulability of the generated (sub)assemblies, Furthermore, the necessity of reorientation for a mating operation and parallelism during plan execution is considered. Another important criterion is the stability of the generated (sub)assemblies. Most of the assembly planners developed up to date use heuristics or user defined criteria to determine assembly stability for plan evaluation. In order to bring automatic assembly planning closer to reality HighLAP performs a powerful geometrical and physical reasoning. The system presented is the first assembly planning system taking into account the range of all stable orientations of an assembly considering friction for plan evaluation.
Address management and connection control for multicast communication applications
Authors: A. Eleftheriadis, S. Pejhan, D. Anastassiou
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

An architecture and associated protocols are presented for managing multicast addresses and performing connection control for multicast communication applications. A scheme to partition the multicast address space on the basis of the network number is proposed (an underlying IP-based internetworking environment is assumed), and its performance and scaling characteristics are discussed. A protocol is then developed to provide for dynamic allocation and release of multicast addresses, as well as maintaining state information for a connection. The protocol is independent of the address partitioning scheme; it is also shown to be robust and efficient. Finally, we describe two different mechanisms that enable the use of a common port number by all session participants.
Distributed Auction Servers Resolving Winner and Winning Bid without Revealing Privacy of Bids
Authors: Hiroaki Kikuchi, Shinji Hotta, Kensuke Abe, Shohachiro Nakanishi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

We have developed an electronic auction system with a set of distributed servers that collaborate to resolve a winning bid without revealing the secrecy of bids. This paper describes the system architecture and shows the performance in terms of the round complexity and the bandwidth consumption for a message. Based on the actual measurements, the upper bound of number of bidding prices is identified. In addition, by adding some steps to the basic auction protocol in [KHT98], we improve the security of protocol so that even the winner must not know the second highest bid.
Accommodating Simplicity and Complexity in Metadata: Lessons from the Dublin Core Experience
Authors: Carl Lagoze
Venue:  (2000)

The Dublin Core Metadata Element Set (DCMES) grew out of a recognized need for improved resource discovery of web resources. Initial work on the DCMES focused on the requirement of simplicity: "ordinary" users should be able to formulate descriptive records based on a relatively simple schema (fifteen free-text elements). Over the years there has been a movement within the Dublin Core community to use the DCMES for more complex and specialized resource description tasks and, correspondingly, develop mechanisms for incorporating such complexity within the basic element set. This work has generally been called qualified Dublin Core. We examine the notion of accommodating complexity in a simple metadata model and argue that the dual requirements are incompatible. We discuss the role of events and processes in more expressive metadata and how simple resource-centric models, such as DCMES, are not equipped to express these semantics
Verifying Temporal Properties without using Temporal Logic
Authors: Bowen Alpern, Fred B. Schneider
Venue:  (2001)

An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented. The approach is based on using Buchi automata to specify properties. To show that a program satisfies a given property, proof obligations are derived from the Buchi automaton for that property. These obligations are discharged by devising suitable invariant assertions and variant functions for the program. The approach is shown to be sound and relatively complete. A mutual exclusion protocol illustrates its application.
Foundation ActionScript for Macromedia Flash MX, 1 edition
Authors: Sham Bhangal, Ben Renow-Clarke
Venue:  (2002)

:With the release of Flash MX, scripting in Flash has moved from being a desirable asset to an essential skill in the world of web design. If you've used Flash a little and are scared of the idea of code, but even more scared of missing out, this is the book for you. This book will take you from never having coded in Flash before to an all-round proficiency in ActionScript, with fully-worked examples and a case study that turns into a fully fledged top ActionScript site by the end of the book. This is no simple update of friends of ED's earlier Flash 5-based Foundation ActionScript: the book has been re-written end to end to take account of the very different ways in which ActionScript is used in Flash MX.
Design Guidance through the Controlled Application of Constraints
Authors: Aaron G. Cass, Leon J. Osterweil
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

We seek to facilitate development of high quality software designs and architectures by using rigorous process definitions to guide application of the complex structure of relations and constraints that define well formedness. We identify various types of constraints and demonstrate specific instances of these types. We endorse the value of maintaining the integrity of these constraints by reacting to their violation with diagnostics and remedies. The sheer number and diversity of these constraints, however, indicates the desirability of a mechanism for controlling the scope and effect of their enforcement. Thus, we propose to use proactive process specifications to control the enforcement of, and reaction to, the various constraints. This will result in a process driven system that supports designers and architects by guiding them through orderly development and rework processes, disciplined by the application of constraint enforcement at the right times and in the right ways. This work entails research in defining both types and instances of constraints with programmable enforcement strategies, in embedding such constraints in processes, and in appropriate process definition formalisms.
A Modeling Method and Evaluation of Divided-Loop Networks
Authors: Jun Sasaki, Takashi Mitsuishi, Yutaka Funyu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper proposes a modeling method of divided-loop networks. First, traffic performances are compared by numerical simulation among straight networks, simple-loop networks and divided-loop networks. Next, a modeling method of divided-loop networks is proposed. Then, reliability and construction cost of the networks are described and evaluated. Finally, total cost, including construction cost and damage cost by failure, is discussed. Applicable conditions of divided-loop networks are shown by calculated results.
On Edge Coloring Bipartite Graphs
Authors: Richard Cole, John E. Hopcroft
Venue:  (1980)

NO SUPPLIED
A Software Architecture for Zero-Copy RPC in Java
Authors: Chi Chang, Thorsten von Eicken
Venue:  (1998)

RPC has established itself as one of the more powerful communication paradigms for distributed computing. In recent years, object-oriented languages have impacted RPC semantics, with a number of variants providing remote method invocation and various forms of distributed object systems. At the same time, performance has changed little with the bottleneck being the network transport, in particular the in-kernel protocol implementations. This paper describes J-RPC, an RPC architecture that leverages user-level network interfaces (UNI) to circumvent the kernel on the critical path. It describes how the wire format and the RPC system can be engineered to allow zero-copy reception of Java objects and zero-copy transmission of arrays. All objects received are fully type-checked and can be directly used by the receiving program. The design is connection-oriented for performance and leverages the JVM''s garbage collector when managing receive buffers. An implementation built from an off-the-shelf JVM and a commercial UNI is used to evaluate the architecture and the tradeoffs of type-safe, zero-copy data marshaling.
'Web-CALL': A Language Learning Support System Using Internet
Authors: Satoru Fujii, Jun Iwata, Mayumi Hattori, Mutsumi Iijima, Tadanori Mizuno
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

The online language learning support system, ¿Web-CALL¿ is the software that enables language teachers to produce web-based teaching materials and enables students to study them online. It is the user-friendly software, which even beginners in computers can use easily. Teachers can produce web-page materials without knowledge of HTML or any computer programming. Students can study at their own pace regardless of time and location. Furthermore, teachers can interact with students via email. When students have questions, they can email their teachers. The teaching materials database on the server is available in LAN or Internet. Teachers of language have tested this system in their classes. To evaluate the ¿Web-CALL¿ lesson, they compared ¿Web-CALL¿ class with a normal, traditional, teacher-oriented class. At the end of both the ¿Web-CALL¿ class and the normal class, students took a test which consisted of four types of questions; Comprehension check, Grammar A (multiple-choice), Grammar B (translation) and Grammar C (put in order). The ¿Web-CALL¿ class was superior to normal class in Comprehension and Grammar C. More than 80% students surveyed after ¿Web-CALL¿ classes have assessed the system to be useful and helpful in language learning.
Proving Properties of Parallel Programs: An Axiomatic Approach
Authors: Susan S. Owicki, David Gries
Venue:  (1975)

This paper presents an axiomatic technique for proving a number of properties of parallel programs. Hoare has given a set of axioms for partial correctness of parallel programs, but they are not strong enough in most cases. Here we define a deductive system which is in some sense complete for partial correctness. The information in a partial correctness proof is then used to prove such properties as mutual exclusion, blocking and termination.
A principled approach to fast partitioning of uncompressed video
Authors: D. A. Adjeroh, M. C. Lee, C. U. Orji
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

One basic technique often used to reduce the huge computation involved in video partitioning is by selective processing of a subpart of the video frames. However, the choice of this proportion has so far been made randomly, without any formal basis. An ad hoc selection of this subpart cannot always guarantee a reduction in computation while ensuring effective partitioning. The paper argues for a principled basis for the selection of such parameters to ensure effective and efficient partitioning of video sequences. It presents a formal method for determining the optimal window size and the minimum thresholds which ensure that decisions on scene similarity are made on a reliable, effective and principled basis. To account for illumination variations and possible motion in the video, the use of neighbourhood-based colour ratio features is proposed, which avoids the huge computational requirements of explicit motion compensation operations.