Now showing items 1-20 of 488

    • Multi-Destination Communication Over Single-Hop Lightwave WDM Networks 

      Rouskas, George N.; Ammar, Mostafa H. (Mostafa Hamed) (Georgia Institute of Technology, 1993)
      The importance of computer applications and telecommunication services relying on efficient multi-destination communication is growing rapidly. It is now likely that a significant portion of the overall traffic in ...
    • 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 ...
    • 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 ...
    • 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 ...
    • Parallel and Configurable Protocols: Experiences with a Prototype and an Architectural Framework 

      Lindgren, Bert; Krupczak, Bobby; Ammar, Mostafa H. (Mostafa Hamed); Schwan, Karsten (Georgia Institute of Technology, 1993)
      As network speeds increase, a major concern regarding communication protocols is their limited throughput and latency due to processing overheads at network nodes. Furthermore, novel network applications and expanded ...
    • 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 ...
    • A Survey of Real-Time Operating Systems -- Preliminary Draft 

      Mukherjee, Bodhisattwa; Schwan, Karsten; Ghosh, Kaushik (Georgia Institute of Technology, 1993)
      This paper describes current research in real time operating systems. Due to its importance to real-time systems, we begin this survey with a brief summary of relevant results in real-time scheduling and synchronization. ...
    • Multi-Model Fault-Tolerant Programming in Distributed Object-Based Systems 

      Chelliah, Muthusamy; Ahamad, Mustaque (Georgia Institute of Technology, 1993)
      Many transaction models, and computation replication schemes based on such models have been proposed in the literature. All these techniques for software fault tolerance, referred to herein as action models, provide data ...
    • Implementation of Scalable Blocking Locks using an Adaptative Thread Scheduler 

      Mukherjee, Bodhisattwa; Schwan, Karsten (Georgia Institute of Technology, 1993)
      Blocking locks are commonly used in parallel programs to improve application performance and system throughput. However, most implementations of such locks suffer from two major problems -- latency and scalability. In ...
    • Lower Bounds for Perfect Matching in Restricted Boolean Circuits 

      Sengupta, Rimli; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      We consider three restrictions on Boolean circuits: bijectivity, consistency and multilinearity. Our main result is that Boolean circuits require exponential size to compute the bipartite perfect matching function when ...
    • Machine Abstractions and Locality Issues in Studying Parallel Systems 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      We define a set of overhead functions that capture the salient artifacts representing the interaction between parallel application characteristics and architectural features. An execution-driven simulation testbed 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 ...
    • 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 ...
    • FA{S,T}ER Scaled Matching 

      Amir, Amihood; Calinescu, Gruia (Georgia Institute of Technology, 1993)
      The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, finding ...
    • 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 ...
    • Space-Efficient Atomic Snapshots in Synchronous Systems 

      Neiger, Gil; Singh, Ranu (Georgia Institute of Technology, 1993)
      We consider the problem of implementing an atomic snapshot memory in synchronous distributed systems. An atomic snapshot memory is an array of memory locations, one per processor. Each processor may update its own ...
    • Maximum Agreement Subtree In a Set Of Evolutionary Trees 

      Amir, Amihood; Keselman, Dmitry (Georgia Institute of Technology, 1993)
      The maximum agreement subtree approach is one method of reconciling different evolution trees for the same set of species. Recently, dynamic programming ideas were used by Steele and Warnow to provide polynomial time ...
    • 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. ...
    • 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 ...