ppxscal/embedding_network huggingface dataset:
The MAJC Architecture: A Synthesis of Parallelism and Scalability
Authors: Marc Tremblay, Jeffrey Chan, Shailender Chaudhry, Andrew W. Conigliaro, Shing Sheung Tse
Venue: IEEE Micro (2000)

The MAJC(tm) microprocessor architecture was developed by Sun Microsystems to address the extreme computation requirements needed by the emerging world of broadband services. Application performance is reached by exploiting parallelism at multiple levels. First and foremost, the architecture is inherently multithreaded. The ISA supports vertical multithreading, speculative multithreading and chip multiprocessors. Secondly, the MAJC VLIW architecture is capable of advanced speculation and predication. Finally, the architecture is heavily SIMD and treats all data types similarly (unified register file, unified execution resources, etc.).
Compilers for Instruction-Level Parallelism
Authors: Michael Schlansker, Thomas M. Conte, James Dehnert, Kemal Ebcioglu, Jesse Z. Fang, Carol L. Thompson
Venue: Computer (1997)

Instruction-level parallelism allows a sequence of instructions derived from a sequential program to be parallelized for execution on multiple pipelined functional units. If industry acceptance is a measure of importance, ILP has blossomed. It now profoundly influences the design of almost all leading-edge microprocessors and their compilers. ILP's key advantage is that it exploits parallelism without requiring the programmer to rewrite existing applications. This is attractive because today's applications are still programmed sequentially, and many will never be rewritten. Exploiting ILP across a diverse set of performance-critical applications will require renewed emphasis on the role of the compiler. To advance, ILP compilers will require an enormous research effort, much like the one that drove vector compilers to today's relatively mature status. Thus far, however, ILP has yet to receive a similar investment, even though it presents what may be even more complex technical challenges. A number of ILP compilers exist both in academia and in industry, yet the development of ILP is far from complete.
Winning Teams: Performance Engineering during Development
Authors: Robert S. Oshana
Venue: Computer (2000)

In 1995, Raytheon Systems initiated a program to develop a DSP-based array processor that would be used to process large amounts of raw data from a sensor sub-system. But because the next-generation target processor hadn't yet been released, the software development team had to complete a significant amount of the system and software development prior to the availability of the actual hardware. To foster strong algorithmic performance and efficient implementation in this high-risk development environment, they incorporated software performance engineering into their design methods. Loosely defined, software performance engineering is a set of techniques designed to gather data, construct a system performance model, evaluate that model, manage the risk of uncertainty, evaluate alternatives, and verify the models and results.This article explains the author's experience on this project, detailing the areas of SPE that were used through-out the life cycle of this software development program: execution modeling, input modeling, gathering of performance data, tools, design principles, and software engineering.
Online Gaming Starter Kit, 10th edition
Authors: Ed Dille
Venue:  (1997)

:Consumer interest in PC-based multi-player gaming is so intense that even entrenched video game publishers, such as Sega and Acclaim, have redefined their core businesses away from console-based products aimed at males 13-to-18, to serving the more affluent and lucrative 18-to-35 market through the creation of PC-based multiplayer games. Ventana's The Online Gaming Starter Kit shows how to hook up to online games, where to find other gamers online and how to participate in online gaming. This comprehensive reference manual highlights popular online games. Detailed maps, hints and information provide users with a more robust and satisfying online gaming experience.Features and encyclopedic/almanac format that enables easy access and connection to gaming genres and titles.Shows how to start, join and conduct online gaming sessions.Contains tips and strategies for increasing playing skillsSign-up kits for all of major online gaming servicesKali and many other public domain Internet utilities associated with multiplayer gamingLinks to all major online gaming Web sitesNumerous additional game levels, maps, hints, cheat codes and other accessoriesShareware versions of multiplayer games
An estimation of the decision models of senior IS managers when evaluating the external quality of organizational software
Authors: Bonnie Brinton Anderson, Akhilesh Bajaj, Wilpen Gorr
Venue: Journal of Systems and Software (2002)

The increased usage of software in large corporations, coupled with the explosion in software availability has made it important to evaluate software quality (SQ) from the point of view of its consumers. In this study, we focus on the external quality (quality from the point of view of the consumer) of off-the-shelf software used in large corporations. We refine external software quality into four factors. Next, we utilize conjoint analysis (CA) to study the relative values of these factors in the decision models of senior IS managers, when evaluating software for use by their organization. Our results indicate that software used in large corporations today has evolved, so that, contrary to earlier studies that indicate learnability and features as important, it is now the reliability of the software that is the primary factor in IS managers' decision models. The findings have implications for IS theory, and provide guidelines for resource allocation for software developers, IS managers, researchers in the area of software reliability and designers of IS curricula.
Identifying Untestable Faults in Sequential Circuits
Authors: Hsing-chung Liang, Chung Len Lee, Jwu E. Chen
Venue: IEEE Design Test (1995)

We propose an efficient method to identify untestable faults in sequential circuits. The method is based on a controllability calculation and a symbolic simulation procedure which propagates the characteristics of unknown initial states of flip-flops throughout the circuit. The obtained information is used to identify the flip-flops which cannot be initialized and the circuit lines which cannot be justified to definite values. The untestable faults are classified into four types and each type of them is identified efficiently by using the described rules. The method has been experimentally incorporated into a test generation system and the results show that it is very useful in identifying untestable faults and improving efficiency of a test generation system.
A Scheduling Scheme for Controlling Allocation of CPU Resources for Mobile Programs
Authors: Manoj Lal, Raju Pandey
Venue: Autonomous Agents and Multi-Agent Systems (2002)

There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. In this paper, we present a scheduling scheme for allocating resources to a mix of real-time and non real-time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implements a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints.
An audio watermarking method using a two-dimensional pseudo-random array
Authors: Ryuki Tachibana, Shuichi Shimizu, Seiji Kobayashi, Taiga Nakamura
Venue: Signal Processing (2002)

In this paper, we describe a multiple-bit audio watermarking method which is robust against wow-and-flutter, random sample cropping, and pitch shifting. Though these processings are easy to perform, they are difficult for audio watermarks to survive, because they introduce mis-synchronization between the embedded and detection watermarks. Our main ideas against these mis-synchronization attacks are a two-dimensional pseudo-random array (PRA), magnitude modification, and non-linear subbands. The embedding algorithm modifies the magnitudes of segmented areas in the time-frequency plane of the content, according to a two-dimensional pseudo-random array, while the detection algorithm correlates the magnitudes with the PRA. The two-dimensional array makes the watermark robust against cropping because, even when some portions of the content are heavily degraded, other portions of the content can match the PRA and contribute to watermark detection. Secondly, the magnitude modification enables detection even from displaced detection windows. This is because magnitudes are less influenced than phases by fluctuations of the analysis windows caused by random cropping. The last idea, wider bandwidths at higher frequencies, keeps the correspondence of the embedded and detection PRA even for pitch-shifted content. We theoretically and experimentally analyze the robustness of the proposed algorithm against a variety of signal degradations.
Small-Scale XMI Programming: A Revolution in UML Tool Use?
Authors: Perdita Stevens
Venue: Automated Software Engineering (2003)

The main motivation for the development of the OMG's XML Metadata Interchange Format (XMI) was the need to have a standard way for UML tools to interchange UML models. However, the fact that UML models, saved as XML documents, are now accessible to standard XML tools, opens up new possibilities to which less attention has so far been paid. This paper discusses how XMI can be exploited for performing model analysis and housekeeping tasks and for the integration of third party or in-house tools. With the help of examples we focus on what can be achieved with small-scale XMI programming by a single developer in hours rather than days. We suggest that this new capability may have important and positive implications for the future of UML modelling using tools.
Hierarchical Error Detection in a Software Implemented Fault Tolerance (SIFT) Environment
Authors: Saurabh Bagchi, Balaji Srinivasan, Keith Whisnant, Zbigniew Kalbarczyk, Ravishankar K. Iyer
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

This paper proposes a hierarchical error detection framework for a Software Implemented Fault Tolerance (SIFT) layer of a distributed system. A four-level error detection hierarchy is proposed in the context of Chameleon, a software environment for providing adaptive fault-tolerance in an environment of commercial off-the-shelf (COTS) system components and software. The design and implementation of a software-based distributed signature monitoring scheme, which is central to the proposed four-level hierarchy, is described. Both intralevel and interlevel optimizations that minimize the overhead of detection and are capable of adapting to runtime requirements are proposed. The paper presents results from a prototype implementation of two levels of the error detection hierarchy and results of a detailed simulation of the overall environment. The results indicate a substantial increase in availability due to the detection framework and help in understanding the trade-offs between overhead and coverage for different combinations of techniques.
Flood search under the California split strategy
Authors: Y. Baryshnikov, E. Coffman, P. Jelenković, P. Momčilović, D. Rubenstein
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

We study a version of the problem of searching peer-to-peer networks by means of floods, or expanding rings; when a network reduces to a path, then the term flood becomes the more familiar search term "scan," which is the focus of this paper.
Temporal Synchronization Models for Multimedia Data
Authors: Elisa Bertino, Elena Ferrari
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Multimedia information systems are considerably more complex than traditional ones in that they deal with very heterogeneous data such as text, video, and audio¿characterized by different characteristics and requirements. One of the central characteristics of multimedia data is that of being heavily time-dependent in that they are usually related by temporal relationships that must be maintained during playout. In this paper, we discuss problems related to modeling temporal synchronization specifications for multimedia data. We investigate the characteristics that a model must possess to properly express the timing relationships among multimedia data, and we provide a classification for the various models proposed in the literature. For each devised category, several examples are presented, whereas the most representative models of each category are illustrated in detail. Then, the presented models are compared with respect to the devised requirements, and future research issues are discussed.
Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications
Venue: International Conference on APL (2002)

Welcome to the city of Madrid in the palindrome year of 2002. You will notice that most things in this conference are palindromes. The conference starts on 2002/7/22, where the year, the month and the day are each palindromes (remember that every one figure number is a palindrome). The subject matter for the conference (Array Processing Languages: Lore, Problems and Applications) gives raise to a nice acronym (APL-LPA 2002) which is also a palindrome.This conference will provide you with a nice chance to meet many people working on the field of array processing languages. It will also allow you to look towards the past, the present and the future of this very interesting set of languages, to see how they are used to solve interesting research problems, and to hear how they are used in real-life applications.I am pleased to present the APL2002 program. In this edition we have decided to offer a three-fold emphasis, in order to cover some of the hottest topics in our area. We encouraged the submission of papers dealing with the following issues:- Lore: That intends to cover the history of Array Programming Languages, including historical considerations on design, implementations, applications, difficulties, standards wars, divergence, vendors, etc.- Problems: That deals with the current use of Array Programming Languages in research and innovation, stressing the advantages provided by the use of the language in building a prototype or the final system. Some straightforward descriptions of advanced research questions are presented, as well as some proposals for extensions for Array Programming Languages.- Applications: Finally, some papers present the actual use of Array Programming Languages for real-life applications, with successful case studies and comparisons with other languages.I am happy to report that the response has been enthusiastic. More than 30 papers were submitted, 25 of them being selected for presentation at the conference. I expect that many of the presentations will encourage lively and enriching debates during the conference. I hope that you will enjoy the program.
Reorganizing Circuits to Aid Testability
Authors: Rajiv Gupta, Rajagopalan Srinivasan, Melvin A. Breuer
Venue: IEEE Design Test (1991)

A method of partitioning a circuit canonically into disjoint subcircuits and to group similarly connected storage elements is described. The method is being used in a program called Crete (for Clouding, hierarchical Reorganization, Equivalence determination, Test-methodology embedding, and Editing). Crete partitions and reorganizes the hierarchical description of a circuit so that the designer can apply design-for-testability or built-in self-test techniques to the new hierarchy. The partitioning preserves the designer's circuit hierarchy as much as possible to allow the easy identification of equivalence among partitioned groups. The method reduces the time needed for both test generation and test application in designs that use full scan, partial scan, and built-in self-test techniques. Results for a Viterbi decoder validate the concepts underlying Crete.
Social Activity Indicators for Groupware
Authors: Mark S. Ackerman, Brian Starr
Venue: Computer (1996)

A well-known problem with the adoption of groupware systems is that people do not think it's worth participating in them unless a sizable group of people are already doing so. Thus, the lack of a critical mass of users is often a barrier to starting these systems. People will also stop using a groupware-or computer-supported cooperative work system if participation falls below a certain level. This threshold effect can be quite sudden, and it can kill a group- communication system. At the other extreme, people are attracted to systems having considerable activity-the activity itself excites and motivates people. In short, people pay more attention when they know other people are paying attention. We have repeatedly encountered these situations in our own work. Our experiences led us to consider what user-interface mechanisms could provide a motivating sense of social activity. We developed social activity indicators to show how much and what kind of activity is going on in groupware systems. This article describes three types of indicators we have built. As distributed applications, such as concurrent engineering or business-process systems, become even more prevalent, it will be important to consider the interface requirements for making these systems socially usable and useful.
The Architectural and Operating System Implications on the Performance of Synchronization on ccNUMA Multiprocessors
Authors: Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou
Venue: International Journal of Parallel Programming (2001)

This paper investigates the performance of synchronization algorithms on ccNUMA multiprocessors, from the perspectives of the architecture and the operating system. In contrast with previous related studies that emphasized the relative performance of synchronization algorithms, this paper takes a new approach by analyzing the sources of synchronization latency on ccNUMA architectures and how can this latency be reduced by leveraging hardware and software schemes in both dedicated and multiprogrammed execution environments. From the architectural perspective, the paper identifies the implications of directory-based cache coherence on the latency and scalability of synchronization instructions and examines if and how can simple hardware that accelerates these instructions be leveraged to reduce synchronization latency. From the operating system's perspective, the paper evaluates in a unified framework, user-level, kernel-level and hybrid algorithms for implementing scalable synchronization in multiprogrammed execution environments. Along with visiting the aforementioned issues, the paper contributes a new methodology for implementing fast synchronization algorithms on ccNUMA multiprocessors. The relevant experiments are conducted on the SGI Origin2000, a popular commercial ccNUMA multiprocessor.
A New Way to Query GISs on the Web
Authors: Serena Coetzee, Judith Bishop
Venue: IEEE Software (1998)

Geographic information systems store a wealth of information for diverse applications, and users must often access GISs from various vendors and residing on varying platforms. To meet this need, the authors created a spatial query mechanism for GISs that is distributed and open, giving users access to many different GISs across the Internet.
An Empirically-Based Process for Software Architecture Evaluation
Authors: Mikael Lindvall, Roseanne Tesoriero Tvedt, Patricia Costa
Venue: Empirical Software Engineering (2003)

Software systems undergo constant change causing the architecture of the system to degenerate over time. Reversing system degeneration takes extra effort and delays the release of the next version. Improved architecture is intangible and does not translate into visible user features that can be marketed. Due to a lack of representative metrics, technical staff has problems arguing that stopping degeneration is indeed necessary and that the effort will result in an improved architecture that will pay off. We believe that architectural metrics would give technical staff better tools to demonstrate that the architecture has improved. This paper defines and uses a set of architectural metrics and outlines a process for analyzing architecture to support such an argument. The paper reports on a case study from a project where we restructured the architecture of an existing client-server system written in Java while adding new functionality. The modules of the existing version of the system were &ldquo;library-oriented&rdquo; and had a disorganized communication structure. The new architecture is based on components and utilizes the mediator design pattern. The goal of the study is to evaluate the new architecture from a maintainability perspective. The paper describes our evaluation process, the metrics used, and provides some preliminary results. The architectural evaluation shows that the components of the system are only loosely coupled to each other and that an architectural improvement has occurred from a maintenance perspective. The process used to evaluate the architecture is general and can be reused in other contexts.
Reinventing GTE with Information Technology
Authors: Richard Brandau, Tony Confrey, Alin D'Silva, Christopher J. Matheus, Robert Weihmayer
Venue: Computer (1999)

Over the past decade, the role of information technology as a key business enabler within the telecommunications industry has increased significantly. One reason for this increase has been the continuous change in enabling technologies available to IT organizations. These include operating systems, distributed computing environments, middleware, user-interface technologies, server-side facilities and services languages, and software development methodologies. At the same time, the telecommunications industry has itself undergone continuous change, altering how we think about the industry and how it operates. These changes are influencing, and in turn being influenced by, information technology. To illustrate the growing impact of IT within GTE, this article chronicles the evolution of GTE's Network Management System. Although the authors focus primarily on the NMS, they broadly identify three major phases in the application of IT within GTE: the initial, reengineering, and reinvention phases. Each phase exemplifies the larger forces at play, from both a business and an IT perspective. Their case study depicts the successful strategic alignment of a typical telecommunications company's IT and business sectors. Developments in information technology provided the opportunity for this alignment; changes in the information services industry made seizing that opportunity an urgent priority. As always, the challenge now is to find the next opportunity.
Jitter Testing for Gigabit Serial Communication Transceivers
Authors: Yi Cai, Bernd Laquai, Kent Luehman
Venue: IEEE Design Test (2002)

Proper testing of transceivers requires the ability not only to measure generated jitter but also to inject in-band as well as out-of-band jitter for an appropriate receiver tolerance test.