ppxscal/embedding_network huggingface dataset:
PM2: a high performance communication middleware for heterogeneous network environments
Authors: Toshiyuki Takahashi, Shinji Sumimoto, Atsushi Hori, Hiroshi Harada, Yutaka Ishikawa
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This paper introduces a high performance communication middle layer, called PM2, for heterogeneous network environments. PM2 currently supports Myrinet, Ethernet, and SMP. Binary code written in PM2 or written in a communication library, such as MPICH-SCore on top of PM2, may run on any combination of those networks without re-compilation. According to a set of NAS parallel benchmark results, MPICH-SCore performance is better than dedicated communication libraries such as MPICH-BIP/SMP and MPICH-GM when running some benchmark programs.
Management utilization of computers in American local governments
Authors: William H. Dutton, Kenneth L. Kraemer
Venue: Communications of the ACM (1978)

Traditional concepts of management information systems (MIS) bear little relation to the information systems currently in use by top management in most US local governments. What exists is management-oriented computing, involving the use of relatively unsophisticated applications. Despite the unsophisticated nature of these systems, management use of computing is surprisingly common, but also varied in its extent among local governments. Management computing is most prevalent in those governments with professional management practices where top management is supportive of computing and tends to control computing decisions and where department users have less control over design and implementation activities. Finally, management computing clearly has impacts for top managers, mostly involving improvements in decision information.
Improving Java performance using hardware translation
Authors: Ramesh Radhakrishnan, Ravi Bhargava, Lizy K. John
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

State of the art Java Virtual Machines with Just-In-Time (JIT) compilers make use of advanced compiler techniques, run-time profiling and adaptive compilation to improve performance. However, these techniques for alleviating performance bottlenecks are more effective in long running workloads, such as server applications. Short running Java programs, or client workloads, spend a large fraction of their execution time in compilation instead of useful execution when run using JIT compilers. In short running Java programs, the benefits of runtime translation do not compensate for the overhead. We propose using hardware support to perform efficient Java translation coupled with a light weight run time environment. The additional hardware performs the translation of Java bytecodes to native code, thus eliminating much of the overhead of software translation. A translate d code buffer is used to hold the translated code, enabling reuse at the byte code level. The proposed hardware can be used in any general purpose processor without degrading performance of native code. The proposed technique is extremely effective for short running client workloads. A performance improvement of 2.8 times to 7.7 times over a software interpreter is achieved. When compared to a JIT compiler all SPECjvm98 benchmarks except one show a performance improvement ranging from. 2.7 times to 5.0 times. A performance degradation (0.58 times) is observed for one benchmark which is long running. Allowing hardware translation to perform optimizations similar to JIT compilers and Java processors will execute long running programs more efficiently and provide speedups similar to that of client workloads.
Reciprocal hashing: a method for generating minimal perfect hashing functions
Authors: G. Jaeschke
Venue: Communications of the ACM (1981)

A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given. Two algorithms for determining hash functions of reciprocal type are presented and their practical limitations are discussed. Further, some application results are given and compared with those of earlier approaches for perfect hashing.
Documentation of IPL-V
Authors: Allen Newell
Venue: Communications of the ACM (1963)

IPL-V (Information Processing Language-V) is a programming language for list processing and symbol manipulation. It is the fifth of a series of programming languages that has developed as part of a research effort in artificial intelligence and simulation of cognitive processes. This research started in late 1954 at The RAND Corporation and Carnegie Institute of Technology and has remained centered there, so that these two organizations, or more properly the scientists thereof, can be considered the source of the language. The earlier IPL's were coded for the RAND JOHNNIAC, a unique machine of the Princeton class; IPL-V is the only one which has become a &ldquo;public&rdquo; language and where the necessary effort has been made to document and standardize the language.
The merging of the arts with technology
Authors: Jean Gallagher
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper supports the author's opinion that the merging of the arts with technology has been a natural process. She argues her point by citing a brief history of multi-media installations. Additionally, she discusses her recent work as an artist.
VizCraft: a problem-solving environment for aircraft configuration design
Authors: Amit Goel, Chuck A. Baker, Clifford A. Shaffer, Bernard Grossman, Layne T. Watson, Raphael T. Haftka, William H. Mason
Venue: Computing in Science and Engineering (2001)

The VizCraft problem-solving environment aids aircraft designers during conceptual design. It integrates simulation codes that evaluate a design with visualizations for analyzing a design individually or in contrast to other designs.
Parallel data mining for association rules on shared-memory multi-processors
Authors: M. J. Zaki, M. Ogihara, S. Parthasarathy, W. Li
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Data mining is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases. High-level inference from large volumes of routine business data can provide valuable information to businesses, such as customer buying patterns, shelving criterion in supermarkets and stock trends. Many algorithms have been proposed for data mining of association rules. However, research so far has mainly focused on sequential algorithms. In this paper we present parallel algorithms for data mining of association rules, and study the degree of parallelism, synchronization, and data locality issues on the SGI Power Challenge shared-memory multi-processor. We further present a set of optimizations for the sequential and parallel algorithms.Experiments show that a significant improvement of performance is achieved using our proposed optimizations. We also achieved good speed-up for the parallel algorithm, but we observe a need for parallel I/O techniques for further performance gains.
Average probe complexity of non-dominated coteries (brief announcement)
Authors: Tiko Kameda, Feng Xiao, Malika Guerni-Mahoui
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

When nodes may fail, it is desirable to minimize the expected number of probes required to find a quorum. We show some properties of &ldquo;probe trees&rdquo;, propose several heuristics for finding an optimal probe strategy, and compare their performance.
Work-arounds and Boundary Crossing in a High TechOptronics Company: The Role of Co-operative Workflow Technologies
Authors: Niall Hayes
Venue: Computer Supported Cooperative Work (2000)

This study examines how some employees coped with the exceptions that they encountered with their on-going use of a co-operative workflow technology in an optronics company. By drawing on the case material, this paper will indicate that approaches which view work as being capable of being planned and managed through the formal authority of the hierarchy are insufficient. Instead, this paper will suggest that exception handling, work-arounds and improvisation are more characteristic of human activity. Computer supported co-operative work will be conceptualised as being embedded in a dynamic relationship between the context it is situated within, and the actors that engage in it. The principles underlying ethnography have informed the research approach.
Measuring long term effects of technology transfer in developing nations: the case of Internet training at the Romanian Academy of Science
Authors: Stephen R. Ruth
Venue: Information Technology for Development (2000)

Technology diffusion in developing nations is dependent on a continuous flow of good training for all users and potential users. Yet relatively little analysis of the results of this training has been done beyond cursory post-course evaluations. Despite the extensive investments in IT training by donors, multilateral organizations and the national governments, the return on investment for these courses and programs is not clear. This study aims to give a more explicit, long term perspective on IT training in developing nations by employing a popular evaluation model used widely in industry. The Kirkpatrick model treats the training event as only a first step in a process that ultimately involves changing attitudes, behaviors and even life styles. The Romanian Internet Academy case is a pilot study aimed at exploring longer term changes in attitudes and behaviors. While many predictor variables are appropriate, only age, gender, academic productivity and academic discipline were used in this preliminary study. Results indicate that this process can yield useful results for determining the true value of these courses and, just as important, can lead to establishing policies for improving results significantly.
Fast firewall implementations for software-based and hardware-based routers
Authors: Lili Qiu, George Varghese, Subhash Suri
Venue: ACM SIGMETRICS Performance Evaluation Review (2001)

Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and diffserv. Classification can be based on an arbitrary number of fields in the packet header. Performing classification quickly on an arbitrary number of fields is known to be difficult, and has poor worst-case complexity.In this paper, we re-examine two basic mechanisms that have been dismissed in the literature as being too inefficient: backtracking search and set pruning tries. We find using real databases that the time for backtracking search is much better than the worst-case bound; instead of Omega;((logN)k-1), the search time is only roughly twice the optimal search time1. Similarly, we find that set pruning tries (using a DAG optimization) have much better storage costs than the worstcase bound. We also propose several new techniques to further improve the two basic mechanisms. Our major ideas are (i) backtracking search on a small memory budget, (ii) a novel compression algorithm, (iii) pipelining the search, (iv) the ability to trade-off smoothly between backtracking and set pruning, and (v) algorithms to effectively make use of hardware if hardware is available. We quantify the performance gain of each technique using real databases. We show that on real firewall databases our schemes, with the accompanying optimizations, are close to optimal in time and storage.
A geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects
Authors: Malay Kumar, Satyandra K. Gupta
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper describes a geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects. In multi-stage molding process, the desired multi-material object is produced by carrying out multiple molding operations in a sequence, adding one material in the target object in each mold-stage. We model multi-material objects as an assembly of single-material components. Each mold-stage can only add one type of material. Therefore, we need a sequence of mold-stages such that (1) each mold-stage only adds one single-material component either fully or partially, and (2) the molding sequence completely produces the desired object. In other to find a feasible mold-stage sequence, our algorithm decomposes the multi-material object into a number of homogeneous components to find a feasible sequence of homogeneous components that can be added in sequence to produce the desired multi-material object. Our algorithm starts with the final object assembly and considers removing components either completely or partially from the object one-at-a-time such that it results in the previous state of the object assembly. If the component can be removed from the target object leaving the previous state of the object assembly a connected solid then we consider such decomposition a valid step in the stage sequence. This step is recursively repeated on new states of the object assembly, until the object assembly reaches a state where it only consists of one component. When an object-decomposition has been found that leads to a feasible stage sequence, the gross mold for each stage is computed and decomposed into two or more pieces to facilitate the molding operation. We expect that our algorithm will provide a step towards automating the design of multi-stage molds and therefore will help in reducing the mold design lead-time for multi-stage molds.
Software engineering education: on the right track with Ada
Authors: John W. McCormick
Venue: ACM SIGAda Ada Letters (2000)

An introductory undergraduate course in real-time embedded software development should acquaint students with the fundamental scientific issues of real-time computing and practical skills in software development. While the theoretical issues can be covered without a laboratory, real-time embedded programming skills require the experiences that a laboratory provides. A major problem is finding equipment suitable for teaching these skills. For over a decade I have used a computer controlled model railroad in my real-time embedded systems course
Experience with an extensible language
Authors: Edgar T. Irons
Venue: Communications of the ACM (1970)

An operational extensible language system is described. The system and its base language are appraised with respect to efficiency, flexibility, and utility for different categories of users.
Memory allocation with lazy fits
Authors: Yoo Chung, Soo-Mook Moon
Venue: ACM SIGPLAN Notices (2001)

Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where conventional fits such as best fit or first fit are used as backup. Some experimental results showing how lazy fits might perform are shown, and shows that the approach has the potential to be useful in actual systems.
Denotational semantics of a behavioral subset of VHDL
Authors: F. Nicoli
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper introduces a denotational semantics of a behavioral subset of VHDL. This subset is restricted to basic data types only and does not allow for clauses in wait statement. We consider the full model of time and resolution, we give a precise definition of the simulation mechanism. Easy translation rules from VHDL to Boyer-Moore logic can be derived from that semantics.
An exact algorithm for solving difficult detailed routing problems
Authors: Kolja Sulimma, Wolfgang Kunz
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Channel routing is an NP-complete problem. Therefore, it is likely that there is no efficient algorithm solving this problem exactly.In this paper, we show that channel routing is a fixed-parameter tractable problem and that we can find a solution in linear time for a fixed channel width.We implemented our approach for the restricted layer model. The algorithm finds an optimal route for channels with up to 13 tracks within minutes or up to 11 tracks within seconds.Such narrow channels occur for example as a leaf problem of hierarchical routers or within standard cell generators.
A hypothetical computer to simulate microprogramming and conventional machine language
Authors: Jerry E. Sayers, David E. Martin
Venue: ACM SIGMICRO Newsletter (1989)

Microprogramming is not generally available to programmers because it may involve modification of a machine's native language. A hypothetical computer can provide a simulator for microprogramming projects and add considerably to one's understanding of the subject of microprogramming and the concept of a multilevel machine. The classical text, Structured Computer Organization by Andrew S. Tanenbaum, contains a design for such a hypothetical computer. This paper presents an implementation of this machine with a user interface to permit development of microprograms as well as development of programs at the conventional machine language programming level. The user interface is similar to that of MS-DOS's DEBUG program. In addition to providing the basis for projects in Computer Architecture and Computer Organization classes, the simulator is being used as a simplified hypothetical machine in a Systems Programming class for the development of assembler, linker, and loader projects.
The implementation of temporal intervals in qualitative simulation graphs
Authors: Ricki G. Ingalls, Douglas J. Morrice, Andrew B. Whinston
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

In this paper we develop and implement a simulation modeling methodology that combines discrete event simulation with qualitive simulation. Our main reason for doing so is to extend the application of discrete event simulation to systems found in business for which precise quantitative information is lacking. The approach discussed in this paper is the implementation of temporal interval specifications in the discrete event model and the construction of a temporal interval clock for the qualitative simulation model.
K-pair delay constrained minimum cost routing in undirected networks
Authors: Guangting Chen, Guoliang Xue
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)&brvbar;i = l,&hellip;,k} where si is ith source node, ti is ith destination node, and di, is the ith delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.
Infrared communication to control software applications
Authors: Walter V. Romero
Venue: Journal of Computing Sciences in Colleges (2001)

Computers are becoming more and more easy to use. From a sequence of keys pressed to a click of a mouse button users can make choices or events happen. However, people are required to sit at a computer. If they are away from the computer they cannot use the computer. There are, however, many ways to solve this problem. For instance, by voice, people can speak what they want accomplished and the computer can make it happen. Another way is by a remote controller. This research proposes a way to use a Universal Remote Controller and an infrared receiver, to control a computer application.
An interactive router for analog IC design
Authors: T. Adler, J. Scheible
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We present an interactive two layer router integrated in an analog IC design environment used in an SDL (schematic driven layout) design flow. Special features are its customizability, the treatment of arbitrary polygons and an advanced handling of source/target polygons in order to avoid net internal design rule violations during connection phase A global routing algorithm is used to split the route into separate parts each routable in a single layer. After via placement a specialized maze router performs the advanced single layer routes in 90 or 45 degree mode. The resulting route can be modified by interactive via movement and rerouting of obsolete partial routes.
Use of the Hough transformation to detect lines and curves in pictures
Authors: Richard O. Duda, Peter E. Hart
Venue: Communications of the ACM (1972)

Hough has proposed an interesting and computationally efficient procedure for detecting lines in pictures. This paper points out that the use of angle-radius rather than slope-intercept parameters simplifies the computation further. It also shows how the method can be used for more general curve fitting, and gives alternative interpretations that explain the source of its efficiency.
Querying the trajectories of on-line mobile objects
Authors: Dieter Pfoser, Christian S. Jensen
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

Position data is expected to play a central role in a wide range of mobile computing applications, including advertising, leisure, safety, security, tourist, and traffic applications. Applications such as these are characterized by large quantities of wirelessly Internet-worked, position-aware mobile objects that receive services where the objects' position is essential. The movement of an object is captured via sampling, resulting in a trajectory consisting of a sequence of connected line segments for each moving object. This paper presents a technique for querying these trajectories. The technique uses indices for the processing of spatiotemporal range queries on trajectories. If object movement is constrained by the presence of infrastructure, e.g., lakes, park areas, etc., the technique is capable of exploiting this to reduce the range query, the purpose being to obtain better query performance. Specifically, an algorithm is proposed that segments the original range query based on the infrastructure contained in its range. The applicability and limitations of the proposal are assessed via empirical performance studies with varying datasets and parameter settings.