Now showing items 1-12 of 12

    • Algebraic Specification of a Communication Scheduler 

      Mathai, Joseph; Moitra, Abha (Cornell University, 1984-06)
      A distributed programming language normally incorporates one mechanism by which processes communicate with each other. This mechanism can be used to transfer information or to synchronize the flow of control in the ...
    • Analysis of Hard Real-Time Systems 

      Moitra, Abha (Cornell University, 1985-07)
      In this paper we study hard real-time systems: systems where strict time deadlines have to be met. We analyze a special case as well as a general model for hard real-time systems and study pre-emptive, static, scheduling ...
    • Automatic Construction of CSP Programs from Sequential Non-Deterministic Programs 

      Moitra, Abha (Cornell University, 1984-03)
      In this paper we describe a systematic method for transforming a sequential program, written in a guarded command language, into a distributed program, written in CSP. The variables of the sequential program are first ...
    • Complete, Effective and Abstract System For Reasoning About Networks of Processes 

      Wagner, Catherine; Moitra, Abha (Cornell University, 1989-03)
      We present a complete recursive set of axioms for reasoning about networks of bounded asynchronous processes with finite resources. We also present an effective procedure for hiding internal channels of a network. Our ...
    • Derivation of a Maximally Parallel Algorithm for Balancing Binary Search Trees 

      Moitra, Abha; Iyengar, S. Sitharama (Cornell University, 1984-09)
      A recent trend in program methodologies is to derive efficient parallel programs from sequential programs. This paper explores the question of transforming a sequential algorithm into an efficient parallel algorithm by ...
    • Discussion of Parallel Algorithms 

      Moitra, Abha; Iyengar, S. Sitharama (Cornell University, 1986-06)
      In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively ...
    • Finitary Choice Cannot Express Fairness: A Metric Space Technique 

      Moitra, Abha; Panangaden, Prakash (Cornell University, 1986-10)
    • Multilevel Data Structures Models and Performance 

      Moitra, Abha; Iyengar, S. Sitharama; Bastani, F.; Yen, I. (Cornell University, 1985-05)
      We advocate a stepwise method of deriving high performance implementation of a set of operations. This method is based on the ability to organize the data into a multilevel data structure so as to provide an efficient ...
    • Parallel Algorithms For Maximum Matching And Other Problems On Interval Graphs 

      Moitra, Abha; Johnson, Richard C. (Cornell University, 1988-07)
      In this paper, we consider parallel algorithms on interval graphs. An interval graph is a graph having a one-to-one correspondence with a sequence of intervals on the real line, such that each vertex maps to an interval ...
    • Proof Rules for Fault-Tolerant Distributed Programs 

      Joseph, Mathai; Moitra, Abha; Soundararajan, Neelam (Cornell University, 1984-10)
      Proving properties of fault tolerant distributed programs is a complex task as such proofs must take into account failures at all possible points in the execution of individual processes. The difficulty in accomplishing ...
    • A Proof System for Dataflow Networks with Indeterminate Modules 

      Moitra, Abha; Panangaden, Prakash (Cornell University, 1986-09)
      In this paper we discuss a model for dataflow networks containing indeterminate operators and the associated proof system. The model is denotational and associates with each network the set of possible behaviors. The ...
    • Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 

      Bilardi, Gianfranco; Moitra, Abha (Cornell University, 1989-05)
      It is shown that the time to compute a monotone boolean function depending upon $n$ variables on a CREW-PRAM satisfies the lower bound $T = \Omega$(log $l$ + (log $n$)/$l$), where $l$ is the size of the largest prime ...