Now showing items 21-40 of 505

    • Distributed Consensus Revisited 

      Neiger, Gil (Georgia Institute of Technology, 1993)
      Distributed Consensus is a classical problem in distributed computing. It requires the correct processors in a distributed system to agree on a common value despite the failure of other processors. This problem is ...
    • A Theory of Interaction and Independence in Sentence Understanding 

      Mahesh, Kavi (Georgia Institute of Technology, 1993)
      Developing a complete and well-specified computational model of human language processing is a difficult problem. Natural language understanding requires the application of many different kinds of ...
    • Reasoning About Function in Reflective Systems 

      Stroulia, Eleni; Goel, Ashok K. (Georgia Institute of Technology, 1993)
      Functional models have been extensively investigated in the context of several problem-solving tasks such as device diagnosis and design. In this paper, we view problem solvers themselves as devices, use functional models ...
    • The Truth, the Whole Truth, and Nothing but the Truth: Alphabet Independent Two Dimensional Witness Table Construction 

      Amir, Amihood; Benson, Gary; Farach-Colton, Martin (Georgia Institute of Technology, 1993)
      The current explosion of stored information necessitates a new model of pattern matching, that of compressed matching. In this model one tries to find all occurrences of a pattern in a compressed text in time proportional ...
    • LU Logging - an Efficient Transaction Recovery Method 

      Gukal, Sreenivas; Omiecinski, Edward Robert; Ramachandran, Umakishore (Georgia Institute of Technology, 1993)
      In this paper, we present LU-Logging, an efficient transaction recovery method. The method is based on (flexible-redo/minimal-undo) algorithm. The paper describes an implementation which avoids the overheads of deferred ...
    • The Sensible Sharing Approach to a Scalable, High-Performance Database System 

      Gottemukkala, Vibby; Omiecinski, Edward Robert; Ramachandran, Umakishore (Georgia Institute of Technology, 1993)
      Exploiting parallelism has become the key to building high-performance database systems. Several approaches to building database systems that support both inter and intra-query parallelism have been proposed. These ...
    • A Machine Independent Interface for Lightweight Threads 

      Mukherjee, Bodhisattwa; Eisenhauer, Greg Stephen; Ghosh, Kaushik (Georgia Institute of Technology, 1993)
      Recently, lightweight thread libraries have become a common entity to support concurrent programming on shared memory multiprocessors. However, the disparity between primitives offered by operating systems creates a ...
    • The Complexity of Almost-Optimal Coordination 

      Bazzi, Rida Adnan; Neiger, Gil (Georgia Institute of Technology, 1993)
      The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered the complexity of achieving optimal simultaneous coordination under various failure ...
    • Distributed Shared Abstractions (DSA) on Multiprocessors 

      Clemencon, Christian; Mukherjee, Bodhisattwa; Schwan, Karsten (Georgia Institute of Technology, 1993)
      Any parallel program has abstractions that are shared by the program's multiple processes, including data structures containing shared data, code implementing operations like global sums or minima, type instances used ...
    • Using Knowledge to Optimally Achieve Coordination in Distributed Systems 

      Neiger, Gil; Bazzi, Rida Adnan (Georgia Institute of Technology, 1993)
      The problem of coordinating the actions of individual processors is fundamental in distributed computing. Researchers have long endeavored to find efficient solutions to a variety of problems involving coordination. ...
    • A Simulation-based Scalability Study of Parallel Systems 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      Scability studies of parallel architectures have used scalar metrics to evaluate their performance. Very often, it is difficult to glean the sources of inefficiency resulting from the mismatch between the algorithmic ...
    • Improving Performace by Use of Adaptive Objects: Experimentation with a Configurable Multiprocessor Thread Package 

      Mukherjee, Bodhisattwa; Schwan, Karsten (Georgia Institute of Technology, 1993)
      Operating system kernels typically offer a fixed set of mechanisms and primitives. However, recent research shows that the attainment of high performance for a variety of parallel applications may require the ...
    • Causal Memory: Implementation, Programming Support and Experiences 

      John, Ranjit; Ahamad, Mustaque (Georgia Institute of Technology, 1993)
      Distributed Shared memory (DSM) has become an accepted abstraction for programming distributed systems. Although DSM simplifies the programming of distributed applications, maintaining a consistent shared memory can ...
    • Experimentation with Configurable, Lightweight Threads on a KSR Multiprocessor 

      Ghosh, Kaushik; Mukherjee, Bodhisattwa (Georgia Institute of Technology, 1993)
      The implementation of operating system functions can significantly affect the performance of parallel programs. Our research concerns the customization of operating system functionality for different target hardware to ...
    • Experiments with Configurable Locks for Multiprocessors 

      Mukherjee, Bodhisattwa; Schwan, Karsten (Georgia Institute of Technology, 1993)
      Operating system kernels typically offer a fixed set of mechanisms and primitives. However, recent research shows that the attainment of high performance for a variety of parallel applications may require ...
    • A Characterization of Scalable Shared Memories 

      Kohli, Prince; Neiger, Gil; Ahamad, Mustaque (Georgia Institute of Technology, 1993)
      The traditional consistency requirements of shared memory are expensive to provide both in large scale multiprocessor systems and also in distributed systems that implement a shared memory abstraction in software. As a ...
    • Scalable Implementation of Synchronization Primitives on Broadcast Rings 

      Davis, Martin H., Jr.; Ramachandran, Umakishore (Georgia Institute of Technology, 1993)
      Synchronization is an important aspect of parallel program design. By definition synchronization is an aspect of a program where multiple processors participate. Thus it is important to design and implement hardware ...
    • Learning to troubleshoot: Multistrategy learning of diagnostic knowledge for a real-word problem solving task 

      Ram, Ashwin; Narayanan, Sundaram; Cox, Michael Thomas (Georgia Institute of Technology, 1993)
      This article presents a computational model of the learning of diagnostic knowledge based on observations of human operators engaged in a real-world troubleshooting task. We present a model of problem solving and ...
    • Alphabet Dependence in Parameterized Matching 

      Amir, Amihood; Farach-Colton, Martin; Muthukrishnan, S. (Georgia Institute of Technology, 1993)
      The classical pattern matching paradigm is that of seeking occurrences of one string in another, where both strings are drawn from an alphabet set ∑. A recently introduced model is that of parameterized pattern matching; ...
    • On the Use of Directory Services to Support Multi-Protocal Inter-operability 

      Clark, R. J. (Russell J.); Calvert, Kenneth L.; Ammar, Mostafa H. (Mostafa Hamed) (Georgia Institute of Technology, 1993)
      Multi-protocol systems are a vital tool for achieving inter-operability in today's heterogeneous communication networks. An important aspect of these systems is the need to determine which of the multiple available ...