• Macros That Work 

  Clinger, William D.; Rees, Jonathan (University of Oregon, 1991-01)

  This paper describes a modified form of Kohlbecker's algorithm for reliably hygienic (capture-free) macro expansion in block-structured languages, where macros are source-tos-ource transformations specified using a ...
• How to Read Floating Point Numbers 

  Clinger, William D. (University of Oregon, 1990-06-05)

  Consider the problem of converting decimal scientific notation for a number into the best binary floating point approximation to that number, for some fixed precision. This problem cannot be solved using arithmetic of ...
• Broadcast Time in Communication Networks 

  Blaha, Kenneth D. (University of Oregon, 1979-05)

  Broadcasting is the information dissemination process whereby a set of messages is transmitted from one member to all other members of a communication network . We model a communication network by a graph and place ...
• Broadcasting in Trees with Multiple Originators 

  Farley, Arthur M.; Proskurowski, Andrzej (University of Oregon, 1980)

  Broadcasting is the information dissemination process in a communication network whereby all sites of the network become informed of a given message by calls made over lines of the network. We present an algorithm which, ...
• Negotiation Behavior During Multiple Agent Specification: A Need for Automated Conflict Resolution 

  Robinson, Willam N. (University of Oregon, 1989-09-06)

  Negotiation is part of specification. During specification acquisition, users negotiate amongst themselves and with analysts. During specification design, designers negotiate amongst themselves and with a project leader. ...
• Mapping Divide-and-Conquer Algorithms to Parallel Architectures 

  Lo, V.; Rajopadhye, S. V.; Gupta, S.; Keldsen, D.; Mohamed, M.; Telle, Jan (University of Oregon, 1990-01-19)

  In this paper, we identify the binomial tree as an ideal computation structure for parallel divide-and-conquer algorithms. We show its superiority to the classic full binary tree structure with respect to speedup and ...
• Architected Failure Handling for AND-Parallel Logic Programs 

  Meyer, David M.; Conery, John S. (University of Oregon, 1989-03-24)

  In this paper, we present an architected approach to failure handling for independent AND parallel logic programs. That is, the architecture presented here represents its failure handling algorithm as a sequence of simple ...
• A Determinacy Testing Algorithm for Nondeterminate Flat Concurrent Logic Programming Languages 

  Tick, E.; Korsloot, M. (University of Oregon, 1990-11)

  This paper describes an algorithm for the code generation of determinacy testing for nondeterminate flat concurrent logic programming languages. Languages such as Andorra and Pandora require that procedure invocations ...
• Reliability of Partial k-tree Networks 

  Mata-Montero, Erick (University of Oregon, 1990-06-08)

  Recent developments in graph theory have shown the importance of the class of partial k- trees. This large class of graphs admits several algorithm design methodologies that render efficient solutions for a large number ...
• Resilience of Partial k-tree Networks 

  Mata-Montero, Erick (University of Oregon, 1989-10-20)

  The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network has been shown to be a #P-complete problem for planar networks and to take O(n)^2 time for ...
• Resilience of Partial k-tree Networks with Edge and Node Failures 

  Mata-Montero, Erick (University of Oregon, 1989-10-20)

  The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an ...
• Little Big LISP 

  Marti, Jed B. (University of Oregon, 1981-05)

  This manual describes the Little Big LISP system for the Z80 microcomputer. The manual describes data structures, defined functions, operating procedures, a compiler, an RLISP parser, and support packages.
• OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures 

  Lo, Virginia M.; Rajopadhye, Sanjay; Gupta, Samik; Keldsen, David; Mohamed, Moataz A.; Telle, Jan (University of Oregon, 1990-01-19)

  The mapping problem in message-passing parallel processors involves the assignment of tasks in a parallel computation to processors and the routing of inter-task messages along the links of the interconnection network. We ...
• RAGA: Musical Gantt Charts for Scheduling in Distributed Real Time Systems 

  Lo, Virginia M.; Pall, Gurdeep Singh (University of Oregon, 1991-01)

  We propose a simple extension to Gantt charts, called RAGA scores, for use in distributed real time scheduling. RAGA scores use a small set of symbols borrowed from musical notation to enrich the expressive power of the ...
• Distributed Shared Memory: A Survey of Issues and Algorithms 

  Lo, Virginia M.; Nitzberg, Bill (University of Oregon, 1991-01-07)

  A distributed shared memory (DSM) is an implementation of the shared memory abstraction on a multicomputer architecture which has no physically shared memory. Shared memory is important (as a programming model) not only ...
• Algorithms For Static Task Assignment And Symmetric Contraction In Distributed Computing Systems 

  Lo, Virginia M. (University of Oregon, 1988-05-05)

  In this paper, we look at the mapping problem, which was posed within the domain of parallel processing, and we redefine that problem for use in distributed computing systems whose underlying communication medium is a ...
• The Design of Template Immune Networks: Path Immunity 

  Farley, Arthur M.; Proskurowski, Andrzej (University of Oregon, 1989-03-24)

  A network is specified by a topology definition and a protocol definition. A network's topology, represented as a graph, defines its interconnection structure, while the protocol defines its operational behavior. A ...
• The Hybrid Solution for Concurrent Operations on B-Trees 

  Ellis, Carla Schlatter (University of Oregon, 1980-03)

  B-trees are useful for supporting large ordered indexes in database systems. Several solutions have recently been proposed to deal with the problem of allowing concurrent operations in data structures related to B-trees. ...
• Context, User Models and Interface Design 

  Douglas, Sarah A. (University of Oregon, 1988-07-12)

  Most of the existing analytical descriptions of users characterize their performance as a function of the cognitive representation of the command sequences of the computer-based task (e.g. Anderson, Farrell, & Sauers, ...
• Detecting and Repairing Tutoring Failures 

  Douglas, Sarah A. (University of Oregon, 1988-06-21)

  During the course of studying a number of protocols of human tutors working with human students, I became aware of a complex process of interaction failure and repair. Although much ITS research has been devoted to the ...

View more submissions