Now showing items 1-20 of 505

    • Randomized Multi-Source Broadcast Protocols in Multi-Hop Radio Networks 

      Lee, Chungki; Ammar, Mostafa H. (Mostafa Hamed); Burns, James Edward (Georgia Institute of Technology, 1993)
      In [LBA93], a suite of randomized broadcast protocols was presented for the problem of broadcasting a message in arbitrary multi-hop radio networks. These protocols improved upon that of Bar-Yehuda et al. in most of the ...
    • 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. ...
    • PORTS: A Parallel, Optimistic, Real-Time Simulator 

      Ghosh, Kaushik; Panesar, Kiran S.; Fujimoto, Richard M.; Schwan, Karsten (Georgia Institute of Technology, 1993)
      This paper describes issues concerning the design of an optimistic parallel discrete event simulation system that executes in environments that impose real-time constraints on the simulator's execution. Two key problems ...
    • 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 ...
    • 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 ...
    • 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 ...
    • Causal Memory: Definitions, Implementation, and Programming 

      Ahamad, Mustaque; Neiger, Gil; Kohli, Prince; Burns, James Edward; Hutto, Phillip W. (Georgia Institute of Technology, 1993)
      The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, ...
    • 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 ...
    • Alternative Object Organizations using Prototypes, Delegation and Split Objects 

      Astudillo R., Hernan; Shilling, John J. (Georgia Institute of Technology, 1993)
      Object-based (i.e. classless) models are very effective for elucidating requirements from users, and they support exploratory programming and rapid prototyping. On the other hand, class-based models are preferred 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 ...
    • 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 ...
    • Reorganizing Split Objects 

      Astudillo R., Hernan; Shilling, John J. (Georgia Institute of Technology, 1993)
      Object-based (i.e. classless) models are very effective for elucidating requirements from users, and they support exploratory programming and rapid prototyping. On the other hand, class-based models are preferred to perform ...
    • 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 ...
    • AQUA: Questions that Drive the Explanation Process 

      Ram, Ashwin (Georgia Institute of Technology, 1993)
      In the doctoral dissertation from which this chapter is drawn, Ashwin Ram presented an alternative perspective on the processes of story understanding, explanation, and learning. The issues that Ram explores in that ...
    • An Approach to Scalability Study of Shared Memory Parallel Systems 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      The overheads in a parallel system that limit its scalability need to be identified and separated in order to enable parallel algorithm design and the development of parallel machines. Such overheads may be broadly ...
    • Scalability Study of the KSR-1 

      Ramachandran, Umakishore; Shah, Gautam H.; Ravikumar, S.; Muthukumarasamy, Jeyakumar (Georgia Institute of Technology, 1993)
      Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning from sequential programming. However, ...
    • Leads-to Properties and the But-not-yet Operator 

      Calvert, Kenneth L. (Georgia Institute of Technology, 1993)
      We define a predicate transformer, in terms of which finite disjunctions of leads-to properties can be rewritten as single leads-to properties. Although disjunctions of leads-to properties do not typically arise naturally ...
    • Optical Waveguides in General Purpose Parallel Computers 

      Davis, Martin H., Jr. (Georgia Institute of Technology, 1993)
      This thesis examines how optics can be used in general purpose parallel computing systems. Two basic assumptions are made. First, optical waveguide communications technology will continue to mature and become more ...
    • Issues in the Design of Distributed Shared Memory Systems 

      Mohindra, Ajay (Georgia Institute of Technology, 1993)
      This thesis examines the various system issues that arise in the design of distributed share memory (DSM) systems. This work has been motivated by the observation that distributed systems will continue to become ...