ppxscal/embedding_network huggingface dataset:
Adaptive packet routing in a hypercube
Authors: C-K. Kim, D. A. Reed
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

All commercial hypercubes use fixed-path routing for packet switching. However, it has long been known that adaptive routing reduces packet delay by sending packets via less congested areas. Moreover, the hypercube topology contains many alternative, equal-length paths, suggesting the desirability of adaptive routing. Noting the importance of a communication system and the efficiency of adaptive routing, we investigate the effect of packet routing on communication latency and message throughput in a hypercube. As a feasibility study of adaptive routing, we selected four representative adaptive routing methods for testing on the Intel IPSC: NRCC routing, shortest queue, delta, and hybrid weighted routing. In NRCC routing, a single node, the network routing control center (NRCC), collects network status information and distributes routing tables to all other nodes. In contrast, shortest queue routing is fully distributed; each node selects the link with the shortest queue of outgoing messages that is the part of a shortest path to the destination node. Delta and hybrid weighted routing are hybrid schemes, combining centralized NRCC routing and distributed shortest queue routing. Extensive simulation studies and implementation confirm the superiority of adaptive routing to the fixed-path routing in commercial hypercubes. This result holds for a variety of traffic models, including high temporal locality and traffic surges.
Computational reflection in class based object-oriented languages
Authors: J. Ferber
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

This paper describes various models of computational reflection in class based object oriented language. Two different approaches are covered: the meta-object approach which supposes that every object can have a meta-object describing and monitoring its behavior, and the message reification approach which describes a message as an object. The meta-object approach is discussed more fully showing that it is important to differentiate between structural reflection and computational reflection. We will see that, whereas classes and metaclasses are very important for the former, they cannot cope adequately with the later. Therefore we introduce a model of computational reflection where meta-objects are instances of a class META-OBJECT or of one of its subclasses.
Analysis of the Effects of Delays on Load Sharing
Authors: R. Mirchandaney, D. Towsley, J. A. Stankovic
Venue: IEEE Transactions on Computers (1989)

The authors study the performance characteristics of simple load-sharing algorithms for distributed systems. In the systems under consideration, it is assumed that nonnegligible delays are encountered in transferring tasks from one node to another and in gathering remote state information. Because of these delays, the state information gathered by the load-sharing algorithms is out of date by the time the load-sharing decisions are taken. The authors analyze the effects of these delays on the performance of three algorithms, called forward, reverse, and symmetric. They formulate queueing-theoretic models for each of the algorithms operating in a homogeneous system under the assumption that the task arrival process at each node is Poisson and the service times and task transfer times are exponentially distributed. Each of the models is solved using the matrix-geometric solution technique, and the important performance metrics are derived and studied.
Constraint technology for user-interface construction in ThingLab II
Authors: J. Moloney, A. Borning, B. Freeman-Benson
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

ThingLab II is an object-oriented constraint programming system designed specifically for interactive user interface construction and implemented in Smalltalk-80 For constraints to be effective in building user interfaces, they must not impede the responsiveness of the user interface either at run time or during construction. The necessary speed is attained in ThingLab II by making judicious tradeoffs between compilation and interpretation, and by using a fast, incremental algorithm for constraint satisfaction. The resulting system allows user interface components to be assembled, tested, and modified expediently while maintaining interactive responsiveness.
The State of the Art in Online Handwriting Recognition
Authors: C. C. Tappert, C. Y. Suen, T. Wakahara
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

This survey describes the state of the art of online handwriting recognition during a period of renewed activity in the field. It is based on an extensive review of the literature, including journal articles, conference proceedings, and patents. Online versus offline recognition, digitizer technology, and handwriting properties and recognition problems are discussed. Shape recognition algorithms, preprocessing and postprocessing techniques, experimental systems, and commercial products are examined.
Designer controlled behavioral synthesis
Authors: N. D. Dutt, D. D. Gajski
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper describes features of EXEL, a graphic language that gives the designer control over the behavioral synthesis process. Control is achieved by allowing the designer to partially specify the structural design into which the description is going to be compiled, or by binding desired variables and operators to particular components or connections, and binding desired operations to particular states of the final design. EXEL's compiler runs on SUN-3 workstations and is written in C and SUNVIEW.
A coordinated approach to partitioning and test pattern generation for pseudoexhaustive testing
Authors: W.-B. Jone, C. A. Papachristou
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

In this work, we propose a circuit partitioning and test pattern generation algorithm for built-in pseudoexhaustive self-testing of VLSI circuits. The circuit partitioning process is to partition a given circuit into a set of subcircuits such that pseudoexhaustive self-testing will be possible, while the test pattern generation process is to generate the pseudoexhaustive test patterns for each subcircuit using a linear feedback shift register (LFSR). Both problems are considered and solved in the same phase and lead to an efficient and well-coordinated solution. Experiments using computer simulation have been conducted. The results demonstrate that the proposed method is very good, especially for circuits that are highly locally connected.
Compiler technology evaluation
Authors: D. Smith, N. Weiderman
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

The Ada Compiler Evaluation Capability (ACEC) is a U.S. Government sponsored evaluation suite that was first released in the fall of 1988. It consists of over 1000 runtime performance tests and is under continuing development to address additional evaluation concerns. Currently, the government is developing procedures and guidelines to make the collection and reporting of evaluation data a more systematic and formal process. The Compiler Technology Evaluation Panel will address the current status of evaluation technology, and the prospects for improving both compiler technology and the compiler selection process through formal evaluation procedures. The panel will be comprised of four panelists and an &ldquo;ACEC Procedures/Guidelines&rdquo; presenter. The four panelists will consist of two Ada compiler developers, a defense contractor, and a government program representative selected for their knowledge, experience, and different perspectives of Ada compiler evaluation. The presenter will be an AJPO representative who will be providing the current status on the intended use and procedures of the ACEC. This presenter will also serve as a panelist during the question and answer period. The panel is meant to promote discussion and provide insight into embedded systems Ada compiler quality/usability especially as it relates to current and proposed evaluation tests and procedures. To facilitate this discussion, in addition to the ACEC presentation, each of the four panelists have been requested to respond to the following three questions: What is the current overall quality of embedded system Ada Compilers targeted for &ldquo;bare&rdquo; processors? Answers should consider the following: Code generation - correctness, time and space efficiency Runtime system - correctness, time and space efficiency, configurability, and interfacing capability Implementation dependent features for efficiency and their impact on portability Compiler support for good symbolic information Ability to interface with other software integration tools Robustness (freedom from errors) and user interface What is the current overall quality of the ACEC for evaluating Ada compilers for &ldquo;bare&rdquo; processors? Answers should consider the following: Coverage of major evaluation areas Size - number of tests Ease of use and degree of automation Analysis tools and the ability to synthesize results Soundness of the methodology Remembering that language conformity is a critical quality parameter, what has been the impact of the ACVC (test and procedures) on Ada compiler quality? What is and/or what will be the impact of the ACEC (tests and procedures) on Ada compiler quality?
G-base fourth normal form in relational database
Authors: B. K. Seyed-Abbassi, J. C. Thompson
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

G-base Fourth Normal Form is a Grammar based method used to formulate static and dynamic Fourth Normal Forms as a set of Wijngaarden grammars (W-Grammars) in relational database. Static W-grammar models static semantics (attribute level) which are considered to be time independent. Dynamic W-Grammars represent not only the interconnection in attribute level, but also consider the tuples of the relation and the relation of the components of the tuples to one another. The most important result is construction of parsers which are essentially of the class LR(1) for these grammars and thus verification can be done efficiently. Using such systems, a database administrator or a user could test the correctness of a proposed schema without the necessity of possessing a deep knowledge of database theory.
Resolution of Deadlocks in Object-Oriented Distributed Systems
Authors: M. Roesler, W. A. Burkhard
Venue: IEEE Transactions on Computers (1989)

The authors propose and prove a distributed algorithm for detection and resolution of resource deadlocks in object-oriented distributed systems. In particular, the algorithm can be used in conjunction with concurrency control algorithms which are based on the semantic lock model. The algorithm greatly reduces message traffic by properly identifying and eliminating redundant messages. It is shown that both its worst and average time complexities are O(n*e), where n is the number of nodes and e is the number of edges in the waits-for graph. After deadlock resolution, the algorithm leaves information in the system concerning dependence relations of currently running transactions. This information will preclude the wasteful retransmission of messages and reduce the delay in detecting future deadlocks.
A block 6(4) Runge-Kutta formula for nonstiff initial value problems
Authors: J. R. Cash
Venue: ACM Transactions on Mathematical Software (TOMS) (1989)

A new selection is made for an efficient two-step block Runge-Kutta formula of order 6. The new formula is developed using some of the efficiency criteria recently investigated by Shampine, and as a result, a block formula with much improved performance is obtained. An important property of this new formula is that there is a &ldquo;natural&rdquo; interpolating polynomial available. This can be used to compute approximate solution values at off-step points without the need to compute any additional function evaluations. The quality of this interpolant is examined, and it is shown to have certain desirable properties. The performance of the new block Runge-Kutta formula is evaluated using the DETEST test set and is shown to be more efficient than certain other standard Runge-Kutta formulas for this particular test set.
Cancellativity in finitely presented semigroups
Authors: Paliath Narendran, Colm Ó'Dúnlaing
Venue: Journal of Symbolic Computation (1989)

The question of whether a monoid presented by a finite Thue system is cancellative is shown to be undecidable (its negation is semidecicable), even when the Thue system is Church-Rosser. A decision procedure is described for the case of monadic Church-Rosser Thue systems and general commutative Thue systems. For canonical commutative systems, the negation of the problem is in NP.
Reuse of compiler analysis in a programming environment
Authors: M. P. Blivens, M. L. Soffa
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Productivity in the development of software can be increased by reusing code and design analysis. Following this approach we have developed an incremental optimizing compiler that reuses target code and compiler analysis. In order to be practical, it shares a database of information with other tools in a programming environment. The analysis performed by a compiler is reused to greatly reduce the recompilation time during program development and to incrementally produce target code that is optimized across a larger unit than the unit of recompilation. The resulting code is as optimized as that produced in a batch environment, while saving up to 96% of the time for recompilation. The database used in the incremental optimizing compiler is also useful for other tools in a programming environment and is an approach to solving the problems of debugging optimized code.
Lower bounds for orthogonal range searching: part II. The arithmetic model
Authors: Bernard Chazelle
Venue: Journal of the ACM (JACM) (1990)

Lower bounds on the complexity of orthogonal range searching in the static case are established. Specifically, we consider the following dominance search problem: Given a collection of n weighted points in d-space and a query point q, compute the cumulative weight of the points dominated (in all coordinates) by q. It is assumed that the weights are chosen in a commutative semigroup and that the query time measures only the number of arithmetic operations needed to compute the answer. It is proved that if m units of storage are available, then the query time is at least proportional to (log n/log(2m/n))d&ndash;1 in both the worst and average cases. This lower bound is provably tight for m = &OHgr;(n(log n) d&ndash;1+&egr;) and any fixed &egr; > 0. A lower bound of &OHgr;(n/log log n)d) on the time required for executing n inserts and queries is also established. &mdash;Author's Abstract
Discrete simulation application-scheduling staff for the emergency room
Authors: A. P. Kumar, R. Kapur
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The Emergency Room Services (ER) of a hospital is a complex probabilistic system where discrete event simulation can be applied. This paper presents the simulation analysis of the ER at Georgetown University Hospital (GUH), using a unique approach to schedule nursing staff.The analysis was accomplished in three phases as follows:a) Patient Classification system: A patient classification system, consisting of five patient acuity levels, was designed to identify degrees of resource needs by objectively delineating the nursing tasks at each acuity level.b) Data Collection and Data Base: A PC based database was specifically designed to collect ER workload information such as patient arrival time and acuity of patient by hour of the day.c) Modeling and Simulation: The model was designed to be sensitive to hourly patient acuity mix levels, since the workload in the ER is primarily dictated by this.The simulation was conducted using SIMAN, a PC based language for a period of 1,000 hours. The first 120 hours of the simulation run were ignored to allow the system to reach steady state. Upon arrival the patients were assigned an acuity, triaged and based on acuity sent either directly to the treatment area or to registration and then treatment area.In the treatment area a patient was seen every hour by the nurse staff till the length of stay was completed. The number of nurses and amount of direct nursing care provided to a patient depended upon the acuity level.Auxiliary patient care such as nurses accompanying a patient to the CT SCAN unit was also incorporated into the model after the treatment block. The auxiliary care parameters were based on probabilities derived from the database.The current schedule was first simulated to validate the model by comparing simulation output with real time data. Ten different types of schedules such as all 8 hour shifts or all 12 hour shifts with lesser number of staff were simulated to examine the impact these schedules had on the ER patient workload.The primary outputs of the SIMAN simulation reports were; patient wait time prior to being seen in the treatment area, patient queue lengths in the waiting area and staff utilization by time of day. .Based on the simulation experiments a feasible cost effective schedule consisting of 12 hours shift is being implemented. The Information System designed in Phase II is now being integrated with the Hospital Information Systems ER Log to provide periodic decision support reports to the ER managers.
Shift-reduce conflicts in LR parsers
Authors: S. D. Pezaris
Venue: ACM SIGPLAN Notices (1989)

In this note, the shift-reduce conflicts of LR(1) and LR(0) are compared. It is concluded that, if LR(1) has no shift-reduce conflicts, or, if the LR(1) shift-reduce conflicts are resolved in favor of the shift, then all shift-reduce conflicts of the corresponding LR(0) can be correctly resolved by the simple rule: resolve in favor of the shift. With this resolution, LR(0) is adequate for parsing the C grammar.
Performance analysis of high-speed computers
Authors: J. Helin, K. Kaski
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The choice of a computer system depends on many factors of which one of the most important criterion is the performance. In scientific/engineering environments where high-speed (mini)supercomputers are widely used, performance evaluation process is very complex due to the multidimensional nature of a computer's performance. Many of these computers are able to do scalar, vector and parallel processing. In this report different performance evaluation and analysis methods for high-speed computers have been developed. Attention has been paid to the compilers, program development, scalar, vector and parallel floating point computation and I/O. A method how to calculate single performance numbers has been presented and with this method the overall performances of computers can be estimated. A throughput test has been developed to measure the multiprogramming support of the operating system and hardware as well as the overheads in context switching, paging and swapping. These methods have been used to evaluate in practice the performances of some recently announced high-speed computers: Alliant FX/80, Ardent Titan, Convex C2, ETA-10P, FPS Model 500, and Stellar GS1000 and GS2000. Most of the results have been compared to those of a conventional scalar computer, VAX 8700.
Inference of finite automata using homing sequences
Authors: R. L. Rivest, R. E. Schapire
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

We present new algorithms for inferring an unknown finite-state automaton from its input/output behavior in the absence of a means of resetting the machine to a start state. A key technique used is inference of a homing sequence for the unknown automaton. Our inference procedures experiment with the unknown machine, and from time to time require a teacher to supply counterexamples to incorrect conjectures about the structure of the unknown automaton. In this setting, we describe a learning algorithm which, with probability 1-&dgr;, outputs a correct description of the unknown machine in time polynomial in the automaton's size, the length of the longest counterexample, and log (1/&dgr;). We present an analogous algorithm which makes use of a diversity-based representation of the finite-state system. Our algorithms are the first which are provably effective for these problems, in the absence of a &ldquo;reset.&rdquo; We also present probabilistic algorithms for permutation automata which do not require a teacher to supply counterexamples. For inferring a permutation automaton of diversity D, we improve the best previous time bound by roughly a factor of D3/logD.
Improved HELLFIRE, successful use of the Ada language in an embedded, real-time application
Authors: B. Miller
Venue: Proceedings of the conference on TRI-Ada '88 (1989)

The Missile Systems Division of Rockwell International has been involved in the successful development of embedded, highly real-time, Ada software for controlling the guidance of the AGM-114 HELLFIRE antitank missile. This project is the first operational tactical missile application using Ada. This software development effort was a very typical embedded project, with many of the typical embedded project challenges. Using Ada for an embedded, real-time system provided Rockwell with a distinctive set of advantages and disadvantages. It was not only the use of Ada, but a total &ldquo;Software Engineering&rdquo; approach that resulted in the overall success of the software project.
A program generator for efficient evaluation of fourier series
Authors: B. R. Miller
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

Many fields require the evaluation of large multi-variate Fourier series, but the naive method of calling sine and cosine for each term can be prohibitive where computing resources are constrained or the series are extremely large (30,000 terms). Although the number of such calls can be reduced by using trigonometric identities, such a reduction is usually not possible by hand. Indeed, even when it is carried out by computer, care must be taken to generate compact programs and avoid generating large numbers of intermediate terms. We describe here an algorithm for automatically generating very efficient Fortran programs directly from the mathematical description of the series to be evaluated. The resulting Fortran programs are 5-7 times faster than the naive version and sometimes significantly more compact.
A string theory for time dependent complex systems and its application to automatic decomposition
Authors: G. C. Fox, W. Furmanski
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

We introduce a string or world line formalism that provides a general description of time dependent complex systems. We show that it can be applied to mapping general problems onto both sequential and parallel computers. In principle it unifies the concepts of an optimizing compiler with that of parallel decomposition. We show that it reproduces and smoothly interpolates both our original load balancing methods for loosely synchronous problems and optimal communication and combining algorithms such as index and fold. We evaluate two explicit implementations, the neural_router and neural_accumulator, which use an optimizing neural network.