ppxscal/embedding_network huggingface dataset:
Selective specialization for object-oriented languages
Authors: Jeffrey Dean, Craig Chambers, David Grove
Venue: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation (1995)

Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing other optimizations. To reduce this overhead, optimizing compilers for object-oriented languages analyze the classes of objects stored in program variables, with the goal of bounding the possible classes of message receivers enough so that the compiler can uniquely determine the target of a message send at compile time and replace the message send with a direct procedure call. Specialization is one important technique for improving the precision of this static class information: by compiling multiple versions of a method, each applicable to a subset of the possible argument classes of the method, more precise static information about the classes of the method's arguments is obtained. Previous specialization strategies have not been selective about where this technique is applied, and therefore tended to significantly increase compile time and code space usage, particularly for large applications. In this paper, we present a more general framework for specialization in object-oriented languages and describe a goal directed specialization algorithm that makes selective decisions to apply specialization to those cases where it provides the highest benefit. Our results show that our algorithm improves the performance of a group of sizeable programs by 65% to 275% while increasing compiled code space requirements by only 4% to 10%. Moreover, when compared to the previous state-of-the-art specialization scheme, our algorithm improves performance by 11% to 67% while simultaneously reducing code space requirements by 65% to 73%.
Race differences in job performance and career success
Authors: Magid Igbaria, Wayne M. Wormley
Venue: Communications of the ACM (1995)

Although blacks have gained entry to the information systems (IS) field and various managerial positions, they continue to experience more restricted career advancement prospects than whites. They have found it difficult to advance professionally and managerially within their organizations. Perhaps, as the management literature suggests, this is because minorities may experience considerable discrimination in their jobs that lowers their performance and ultimately impedes their career advancement [10].
On-line reorganization of sparsely-populated B+-trees
Authors: Chendong Zou, Betty Salzberg
Venue: Proceedings of the 1996 ACM SIGMOD international conference on Management of data (1996)

In this paper, we present an efficient method to do online reorganization of sparsely-populated B+-trees. It reorganizes the leaves first, compacting in short operations groups of leaves with the same parent. After compacting, optionally, the new leaves may swap locations or be moved into empty pages so that they are in key order on the disk. After the leaves are reorganized, the method shrinks the tree by making a copy of the upper part of the tree while leaving the leaves in place. A new concurrency method is introduced so that only a minimum number of pages are locked during reorganization. During leaf reorganization, Forward Recovery is used to save all work already done while maintaining consistency after system crashes. A heuristic algorithm is developed to reduce the number of swaps needed during leaf reorganization, so that better concurrency and easier recovery can be achieved. A detailed description of switching from the old B+-tree to the new B+-tree is described for the first time.
Cogen in six lines
Authors: Peter J. Thiemann
Venue: ACM SIGPLAN Notices (1996)

We have designed and implemented a program-generator generator (PGG) for an untyped higher-order functional programming language. The program generators perform continuation-based multi-level offline specialization and thus combine the most powerful and general offline partial evaluation techniques. The correctness of the PGG is ensured by deriving it from a multi-level specialize. Our PGG is extremely simple to implement due to the use of multi-level techniques and higher-order abstract syntax.
Topology aggregation for hierarchical routing in ATM networks
Authors: Whay C. Lee
Venue: ACM SIGCOMM Computer Communication Review (1995)

This paper provides a tutorial for topology arregation in large hierarchical communication networks. Specifically, it examines some issues of topology aggregation for hierarchical PNNI Routing in ATM networks, presents a complex node representation, and provides some guidelines for topology aggregation. There are two main reasons for topology aggregation. First, topology information must be compressed to avoid excessive complexity in topology adevertisement. Second, the internal topology of a network may have to be hidden for security reasons. A desirable topology aggregation method must adequately represent the topology of a given network for efficient routing and netowrk resource allocation, using a compact advertised topology.
PDS: a performance database server
Authors: Michael W. Berry, Jack J. Dongarra, Brian H. LaRose, Todd A. Letsche
Venue: Scientific Programming (1994)

The process of gathering, archiving, and distributing computer benchmark data is a cumbersome task usually performed by computer users and vendors with little coordination. Most important, there is no publicly available central depository of performance data for all ranges of machines from personal computers to supercomputers. We present an Internet-accessible performance database server (PDS) that can be used to extract current benchmark data and literature. As an extension to the X-Windows-based user interface (Xnetlib) to the Netlib archival system, PDS provides an on-line catalog of public domain computer benchmarks such as the LINPACK benchmark, Perfect benchmarks, and the NAS parallel benchmarks. PDS does not reformat or present the benchmark data in any way that conflicts with the original methodology of any particular benchmark; it is thereby devoid of any subjective interpretations of machine performance. We believe that all branches (research laboratories, academia, and industry) of the general computing community can use this facility to archive performance metrics and make them readily available to the public. PDS can provide a more manageable approach to the development and support of a large dynamic database of published performance metrics.
A discussion on non-blocking/lockup-free caches
Authors: Samson Belayneh, David R. Kaeli
Venue: ACM SIGARCH Computer Architecture News (1996)

In our previous contribution in the June 1996 issue of CAN, we presented a discussion on lockup-free caches. The article raised a couple of issues with the audience, which we will attempt to address in this addendum.
The state of HTML
Authors: Dennis J. Bouvier
Venue: ACM SIGICE Bulletin (1995)

In the brief history of the World Wide Web (WWW), much has changed. Millions of web pages have been published in a very short time. Next to the Web content, the most dynamic aspect of the WWW is the development of HyperText Markup Language (HTML). This paper explores the various version of HTML and gives a status report on HTML standards development.
A Mixed $l_{\infty}/{\cal H}_{\infty}$ Optimization Approach to Robust Controller Design
Authors: Mario Sznaier
Venue: SIAM Journal on Control and Optimization (1995)

In spite of its practical importance, the problem of designing controllers capable of satisfying mixed time/frequency domain performance requirements under model uncertainty remains, to a large extent, open. In this paper we propose a design procedure for minimizing the maximum amplitude of a regulated error to a specified input while, at the same time, addressing model uncertainty through bounds on the ${\cal H}_\infty$ norm of a relevant transfer function. This problem is of interest in optimal tracking applications where the objective is to achieve minimum tracking error while, at the same time, maintaining an adequate robustness level. We show that for the SISO case, the problem can be solved by solving sequence of problems, each one consisting of a finite-dimensional convex optimization and an unconstrained Nehari approximation problem
Current research directions in software engineering for parallel and distributed systems
Authors: Innes Jelly, Ian Gorton
Venue: ACM SIGSOFT Software Engineering Notes (1996)

In March 1996, the First IFIP Workshop on Software Engineering for Parallel and Distributed Systems was held in Berlin, Germany. The two day workshop was co-sponsored by the German Computer Society GI (Gesellschaft fur Informatik), and organised in association with the International Software Engineering Conference--- ICSE 18.The aim of the workshop was to provide a forum for exchange of information and publication of the latest technological and theoretical advances in software engineering for parallel and distributed systems. Our previous experience of running short workshop on this topic in Aachen, Germany (1993), Como, Italy (1994) and Hawaii, USA (1995) had indicated that there was a growing need for this specialized event [1], [2], [3]. The International Programme Committee was formed from a group of experts in different countries and application areas, all of whom were enthusiastic to explore and publicize contemporary research in parallel and distributed software engineering.In this report we discuss the rationale for the workshop, detail its outcomes and look at some of the research issues that it highlighted. The proceedings of the workshop are published by Chapman and Hall [4], and full information is available on the PDSE Web page: http://www.dcs.shef.ac.uk/~prc/PDSE.html
Constructive and virtual model linkage
Authors: David R. Pratt, Matthew A. Johnson
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The U.S. Army has two disparate combat models, Janus and Distributed Interactive Simulation (DIS) based systems. Both facilitate training, tactical development and weapons analysis. However, a major problem is that entities existing in the Janus Combat Model cannot interact with DIS entities. This paper address how to make this interaction possible, producing a synergy between the combined models, each model benefiting the other. The first step was to identify the differences between the Janus and DIS environments. Next, a software architecture was developed to store and manipulate data regarding both simulations. A communications architecture was created to allow data flow between the two environments. Finally, algorithms were developed to allow for interaction between Janus and DIS entities. The resulting product, the World Modeler (WM), integrates Janus, a two dimensional, constructive combat model, into the three dimensional, entity-level virtual battlefield of DIS. Janus entities interact in real-time with other entities in the DIS virtual world. It is a software system operating on a low-end Silicon Graphics (SGI) workstation with TCP/IP and UDP/IP networking capabilities.
Pipelined memory shared buffer for VLSI switches
Authors: Manolis Katevenis, Panagiota Vatsolaki, Aristides Efthymiou
Venue: ACM SIGCOMM Computer Communication Review (1995)

Switch chips are building blocks for computer and communication systems. Switches need internal buffering, because of output contention; shared buffering is known to perform better than multiple input queues or buffers, and the VLSI implementation of the former is not more expensive than the latter. We present a new organization for a shared buffer with its associated switching and cut-through functions. It is simpler and smaller than wide or interleaved organizations, and it is particularly suitable for VLSI technologies. It is based on multiple memory banks, addressed in a pipelined fashion. The first word of a packet is transferred to/from the first bank, followed by a "wave" of similar operations for the remaining words in the remaining banks. An FPGA-based prototype is operational, while standard-cell and full-custom chips are being submitted for fabrication. Simulation of the full-custom version indicates that, even in a conservative 1-micron CMOS technology, a 64 Kbit central buffer for an 8 times;8 switch operates at 1 Gbps/link (worst case) and fits in 45 mm2 including crossbar and cut-through.
Large eddy simulation of a spatially-developing boundary layer
Authors: Xiaohua Wu, Kyle D. Squires, Thomas S. Lund
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

A method for generation of a three-dimensional, time-dependent turbulent inflow condition for simulation of spatially-developing boundary layers is described. Assuming self-preservation of the boundary layer, a quasi-homogeneous coordinate is defined along which streamwise inhomogeneity is minimized (Spalart 1988). Using this quasi-homogeneous coordinate and decomposition of the velocity into a mean and periodic part, the velocity field at a location near the exit boundary of the computational domain is re-introduced at the in- flow boundary at each time step. The method was tested using large eddy simulations of a flat-plate boundary layer for momentum thickness Reynolds numbers ranging from 1470 to 1700. Subgrid scale stresses were modeled using the dynamic eddy viscosity model of Germano et al. (1991). Simulation results demonstrate that the essential features of spatially-developing turbulent boundary layers are reproduced using the present approach without the need for a prolonged and computationally expensive laminar-turbulent transition region. Boundary layer properties such as skin friction and shape factor as well as mean velocity profiles and turbulence intensities are in good agreement with experimental measurements and results from direct numerical simulation. Application of the method for calculation of spatially-developing complex turbulent boundary layers is also described.
WWW based structuring of codesigns
Authors: P. G. Plöger, J. Wilberg, M. Langevin, R. Composano
Venue: Proceedings of the 8th international symposium on System synthesis (1995)

Abstract: This paper describes a codesign environment based on the WWW (World Wide Web) and its implementation. Tool invocations and their respective results are linked using hypertext documents. We show how to configure a WWW browser for spawning design tools and how frequent tasks like documentation generation and retrieval are facilitated. The design flow can be adopted to the given application very easily. In addition we introduce the concept of a work flow called 'design by documentation'. A WWW link to the results is given and experience using it in a codesign project is described.
Addressing high frequency effects in VLSI interconnects with full wave model and CFH
Authors: Ramachandra Achar, Michel S. Nakhla, Q. J. Zhang
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Abstract: In order to accurately characterize dispersive system of VLSI interconnects at higher frequencies, full wave analysis which takes into account all possible field components and satisfies all boundary conditions is required. However, conventional circuit simulation of interconnects with full wave models is extremely CPU expensive. This paper presents a new method to extend the moment matching technique, complex frequency hopping, to the case of interconnects modeled with full wave analysis. Formulation of circuit equations is modified to incorporate interconnect stencil from full wave analysis. A new algorithm for the moment generation for interconnect networks with full wave models has been developed. Full wave analysis has been carried out with the efficient 'spectral domain approach'. Results have shown that the proposed method is accurate while it yields a speed up of one to three orders of magnitude over conventional simulation techniques. Subject Terms: circuit analysis computing; VLSI; integrated circuit interconnections; circuit CAD; high-frequency effects; VLSI interconnects; high frequency effects; full wave model; CFH; spectral domain approach; dispersive system; full wave analysis; boundary conditions; moment matching technique; complex frequency hopping
Exploiting the JPEG Compression Scheme for Image Retrieval
Authors: Michael Shneier, Mohamed Abdel-Mottaleb
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

We address the problem of retrieving images from a large database using an image as a query. The method is specifically aimed at databases that store images in JPEG format, and works in the compressed domain to create index keys. A key is generated for each image in the database and is matched with the key generated for the query image. The keys are independent of the size of the image. Images that have similar keys are assumed to be similar, but there is no semantic meaning to the similarity.
Standards pipeline
Authors: George S. Carson
Venue: ACM SIGGRAPH Computer Graphics (1996)

This edition of the Standards Pipeline reports on recent activities of Accredited Standards Committee X3H3 whose area of work is computer graphics and image processing. X3H3 also serves as U.S. counterpart to ISO/IEC JTCI/SC24 (Computer Graphics and Image Processing).
Key-based partitioned bit-sliced signature file
Authors: Pavel Zezula, Paolo Ciaccia, Paolo Tiberio
Venue: ACM SIGIR Forum (1995)

A new signature file organization is proposed as a combination of two orthogonal partitioning strategies, the key-based and the bit-sliced, respectively. The design results from theoretical analysis of these elementary approaches in which performance is analytically studied respecting a simplified abstract storage structure model. The new organization is able to achieve very high search performance for queries containing arbitrary number of query terms - bit-sliced (key-based) organization is good only for queries containing few (many) terms, quite bad performance is obtained in the other cases. Update performance is also discussed and a generalization of the method, able to adjust the trade-off between the search efficiency and the maintenance costs, is put forward for consideration. The proposal is also compared with similar approaches in the field of signature files.
Motion recovery for video content classification
Authors: Nevenka Dimitrova, Forouzan Golshani
Venue: ACM Transactions on Information Systems (TOIS) (1995)

Like other types of digital information, video sequences must be classified based on the semantics of their contents. A more-precise and completer extraction of semantic information will result in a more-effective classification. The most-discernible difference between still images and moving pictures stems from movements and variations. Thus, to go from the realm of still-image repositories to video databases, we must be able to deal with motion. Particularly, we need the ability to classify objects appearing in a video sequence based on their characteristics and features such as shape or color, as well as their movements. By describing the movements that we derive from the process of motion analysis, we introduce a dual hierarchy consisting of spatial and temporal parts for video sequence representation. This gives us the flexibility to examine arbitrary sequences of frames at various levels of abstraction and to retrieve the associated temporal information (say, object trajectories) in addition to the spatial representation. Our algorithm for motion detection uses the motion compensation component of the MPEG video-encoding scheme and then computes trajectories for objects of interest. The specification of a language for retrieval of video based on the spatial as well as motion characteristics is presented.
Analysis of an efficient algorithm for the hard-sphere problem
Authors: Alan T. Krantz
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1996)

Many similar algorithms for performing simulations of hard-sphere have been presented. Among these algorithms are those designed by Rapaport (RAP), Lubachevsky (LUB), Krantz (HAD), and Marin (HYBRID). These algorithms exhibit a similar design in that they each use an O(logn) event queue which becomes the overwhelming bottleneck when simulating large systems. In this paper the design of HAD is presented and contrasted to RAP, LUB and HYBRID. Next, both an empirical and analytic analysis of HAD's performance are presented which show that HAD scales well. Finally, using the design differences of these algorithms, the performance of HAD is compared to RAP, LUB and HYBRID.
Library of Congress Digital Library effort
Authors: Herbert S. Becker
Venue: Communications of the ACM (1995)

The Library of Congress has been actively seeking gift funds to continue the digitization efforts begun five years ago by its American Memory pilot project, which has successfully digitized more than 210,000 items. Many of these items have been made available to 44 test sites around the United States, and selected items from this project are also available via the Library of Congress's World-Wide Web server (http://www.loc.gov). Last October, the library received a total of $13 million in grant and gift funds to digitize its American historical collections, many of which are unique, and to help it identify instructional uses of digitized library materials.
C interfaces and implementations: techniques for creating reusable software
Authors: David R. Hanson
Venue:  (1996)

Every programmer and software project manager must master the art of creating reusable software modules; they are the building blocks of large, reliable applications. Unlike some modern object-oriented languages, C provides little linguistic support or motivation for creating reusable application programming interfaces (APIs). While most C programmers use APIs and the libraries that implement them in almost every application they write, relatively few programmers create and disseminate new, widely applicable APIs. C Interfaces and Implementations shows how to create reusable APIs using interface-based design, a language-independent methodology that separates interfaces from their implementations. This methodology is explained by example. The author describes in detail 24 interfaces and their implementations, providing the reader with a thorough understanding of this design approach.Features of C Interfaces and Implementations: Concise interface descriptions that comprise a reference manual for programmers interested in using the interfaces. A guided tour of the code that implements each chapter's interface tp help those modifying or extending an interface or designing related interfaces. In-depth focus on "algorithm engineering:" how to package data structures and related algorithms into reusable modules. Source code for 24 APIs and 8 sample applications is examined, with each presented as a "literate program" in which a thorough explanation is interleaved with the source code. Rarely documented C programming tricks-of-the-trade. Convenient access to all source code in the book via the World Wide Web at http://www.cs.princeton.edu/software/cii/
How to evaluate object-oriented software development?
Authors: Bruno Stiglic, Marjan Heričko, Ivan Rozman
Venue: ACM SIGPLAN Notices (1995)

Adoption of object-oriented technology by the software industry is to a large extent interfered with a lack of appropriate evaluation criteria. Measures of object-oriented systems are necessary in order to realize and achieve expected benefits and advantages of object technology. This paper presents some evaluation criteria, measures and metrics, suitable for object-oriented software development. The implemented prototype of OOMetTool that provides an automatic support for metric data gathering is described and some initial findings are presented.