- How to Recover Efficiently and Asynchronously when Optimism Fails
- Algorithmic Combinatorics based on Slicing Posets Vijay K. Garg
- On Detecting Global Predicates in Distributed Computations Neeraj Mittal
- Using Induction to Prove Properties of Distributed Programs \Lambda Vijay K. Garg Alexander I. Tomlinson
- Electronic Notes in Theoretical Computer Science 89 No. 2 (2003) URL: http://www.elsevier.nl/locate/entcs/volume89.html 22 pages
- Brief Announcement: New Bounds for the Controller Problem
- List of Figures vi Preface xix
- Corrections to Randomized Algorithms ffl Page ix of the Preface: The last sentence should read
- Om Prakash Damani Optimistic Protocols for FaultTolerance in Distributed
- A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems
- Detection of Weak Unstable Predicates in Distributed Programs
- Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications
- MPI Mechanic www.clusterworld.com
- Rectangles are Better than Chains for Encoding Partially Ordered Sets
- Concurrent and Distributed Computing in Java Vijay K. Garg
- Brief Announcement: Accurate Byzantine Agreement with Vijay K. Garg,
- Addressing False Causality while Detecting Predicates in Distributed Programs \Lambda
- 2.2. PETERSON'S ALGORITHM 21 1 class Attempt2 implements Lock {
- Department of Computer Science, The University of Texas at Dallas CS 6378: Advanced Operating Systems Chapter 5: Theoretical Foundations Slide 1/44 Distributed Operating Systems
- Cilk: An Efficient Multithreaded Runtime System Robert D. Blumofe Christopher F. Joerg Bradley C. Kuszmaul
- 1 Introduction Most systems designed today have discrete components such as computer programs. Design of
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-11, NO. 6, JUNE 1985 A Simple and Efficient Randomized Byzantine
- Paxos Made Simple Leslie Lamport
- Time and State in Distributed Systems Vijay K. Garg #
- Algorithmic Combinatorics based on Slicing Posets Vijay K. Garg
- ConC: A Language for Concurrent Programming
- A Fusion-based Approach for Handling Multiple Faults in Distributed Systems
- Optimistic Distributed Simulation Based on Transitive Dependency Om P. Damani YiMin Wang Vijay K. Garg \Lambda
- Contact Author: Ashis Tarafdar (ashis@cs.utexas.edu) Tracks: Long Presentation (if not selected in the Long Presentation Track, please consider the abstract
- Leader Election 13.1 Introduction
- Distributed Recovery with KOptimistic Logging Om P. Damani YiMin Wang Vijay K. Garg
- An Efficient Deterministic Algorithm for the Resource Discovery Problem
- Finding Satisfying Global States: All for One and One for Neeraj Mittal 1 , Alper Sen 2 , Vijay K. Garg 2# , and Ranganath Atreya 1
- Finding Satisfying Global States: All for One and One Neeraj Mittal y , Alper Sen z , Vijay K. Garg z and Ranganath Atreya y
- Venkataesh Velamuri Murty Controlling the Order of Events in Distributed Systems
- Remote Method Invocations 13.1 Introduction
- Normality: A Consistency Condition for Concurrent Objects
- The Weighted Byzantine Agreement Problem Vijay K. Garg and John Bridgman
- String Realizers of Posets with Applications to Distributed Vijay K. Garg
- Using Order in Distributed Computing Vijay K. Garg
- Distributed Implementable
- Detection of Global Predicates: Techniques and their Limitations
- An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem
- Models and Clocks 7.1 Introduction
- Enumerating Global States of a Distributed Computation Vijay K. Garg
- Software Fault Tolerance of Distributed Programs Using Computation Slicing Neeraj Mittal
- VIJAY K. GARG Distributed
- Modeling and Analyzing Periodic Distributed Computations
- TCS 5982Our reference P-copyright-v8/2005 1043 NX Amsterdam
- Observation of global properties in distributed systems Vijay K. Garg
- Detection of Global Predicates: Techniques and their Limitations
- Lucal Management of a Global Resource in a Communication Network
- Distributed Maintenance of a Spanning Tree using Labeled Tree Encoding
- An Efficient Randomized Decentralized Algorithm for the Distributed Trigger Counting Problem
- Time and State in Distributed Systems Vijay K. Garg
- MPI Groups, Communicators and Topologies
- Matching Events in a Content-based Subscription System Marcos K. Aguilera' Robert E. Strom2 Daniel C. Stunnan Mark AsHey Tushar D. Chandra*
- Transactional Memory: Architectural Support for Lock-Free Data Structures
- Using the causal domain to specify and verify distributed programs \Lambda y
- Predicate Control: Synchronization in Distributed Computations with Look-ahead
- Detecting Global Predicates in Distributed Computations
- Introduction Distributed System: You know you have one when the crash of a com
- Resource Allocation 8.1 Introduction
- Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
- This paper describes a method to implement fault-tolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines uses a combination of coding theory and
- Observation and Control for Debugging Distributed Computations
- Debugging in a Distributed World: Observation and Control Ashis Tarafdar \Lambda
- An Efficient Algorithm for MultiProcess Shared Events 1 Vijay K. Garg 2
- An Efficient Randomized Decentralized Algorithm for the Distributed Trigger Counting Problem
- ON THE ADVANTAGES OF FREE CHOICE: A SYMMETRIC AND FULLY DISTRIBUTED
- Software Transactional Memory Nir Shavit* Dan Touitou
- Overview of Presentation " Overview of dead-locks
- VIJAY KUMAR GARG Cullen Trust for Higher Education Endowed Professor
- A Selfstabilizing Algorithm for Maintaining A Spanning Tree in a Distributed System
- Ashis Tarafdar Software Fault Tolerance in Distributed Systems
- On Checking Whether a Predicate Definitely Holds Alper Sen and Vijay K. Garg
- Modeling of Distributed Systems by Concurrent Regular Expressions
- Observation Observation
- EE 360P Vijay Garg Spring 2003 1 Introduction
- International Conference on Computer System and Education, IISc, 1994
- SelfStabilizing Spanning Tree Algorithm With a New Design Methodology
- AN ALGORITHM FOR MINIMALLY LATENT GLOBAL VIRTUAL TIME \Lambda
- On Slicing a Distributed Computation Vijay K. Garg
- Guillaume Philippe Brat A (MAX,+) ALGEBRA FOR NONSTATIONARY
- Appears in the Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, February 1999 Practical Byzantine Fault Tolerance
- Causality for Time: How to Specify and Verify Distributed Algorithms
- Distributed Recovery with K-Optimistic Logging Om P. Damani Yi-Min Wang Vijay K. Garg
- Software Fault Tolerance of Distributed Programs Using Computation Slicing Neeraj Mittal
- Predicate Detection on Infinite Computations Anurag Agarwal Vijay K. Garg
- Producing short counterexamples using "crucial events" Sujatha Kashyap1
- Accurate Byzantine Agreement with Feedback Vijay K. Garg
- Efficient Dependency Tracking for Relevant Events in Shared-Memory Systems
- On Reducing the Global State Graph for Verification of Distributed Computations
- Detecting Conjunctions of Global Predicates Vijay K. Garg \Lambda J. Roger Mitchell y
- Distributed Distributed
- Algorithmic Combinatorics based on Slicing Posets Vijay K. Garg
- Using Order in Distributed Computing Vijay K. Garg
- Predicate Control: Synchronization in Distributed Computations with Look-ahead
- Observation of Software for Distributed Systems with RCL ?
- A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems
- A (MAX,+) ALGEBRA FOR NONSTATIONARY PERIODIC TIMED DISCRETE EVENT Guillaume P. Brat, 1 Vijay K. Garg 2
- Vida~ Kum~r G~r~ ilT,l<~nPu% F302, Hall One
- Deriving Distributed Algorithms from a General Predicate J. Roger Mitchell \Lambda Vijay K. Garg y
- Repeated Computation of Global Functions in a Distributed Environment
- Message Passing -Sender and receiver rendezvous to exchange data
- A Non-blocking Recovery Algorithm for Causal Message Logging J. Roger Mitchell
- Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
- Chakarat Skawratananond The Dissertation Committee for Chakarat Skawratananond
- A MaxPlus Algebra of Signals for the Supervisory Control of RealTime Discrete Event Systems *
- Finding Satisfying Global States: All for One and One for All Neeraj Mittal y , Alper Sen z , Vijay K. Garg z and Ranganath Atreya y
- A Distributed Algorithm for Spanning Trees
- Predicate Control: Synchronization in Distributed Computations with Lookahead #
- INFORMATIQUE P U B L I C A T I O N
- The Listings Package Copyright 19962003
- Controller and Estimator for Dynamic Networks Amos Korman
- Observation of global properties in distributed systems Vijay K. Garg
- A Non-blocking Recovery Algorithm for Causal Message Logging J. Roger Mitchell Vijay K. Gargy
- Contact Author: Ashis Tarafdar (ashis@cs.utexas.edu) Tracks: Long Presentation (if not selected in the Long Presentation Track, please consider the abstract
- Happened Before is the Wrong Model for Potential Causality Ashis Tarafdar and Vijay K. Garg
- A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems
- ConC: A Language for Concurrent Programming
- Predicate Control for Active Debugging of Distributed Programs Ashis Tarafdar
- Optimistic Distributed Simulation Based on Transitive Dependency Om P. Damani Yi-Min Wang Vijay K. Garg
- Debugging in a Distributed World: Observation and Control Ashis Tarafdar
- International Conference on Computer System and Education, IISc, 1994
- A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems
- Synchronous Message Passing V. V. Murty and V. K. Garg
- Using Induction to Prove Properties of Distributed Programs Vijay K. Garg Alexander I. Tomlinson
- Monitoring Functions on Global States of Distributed Programs Alexander I. Tomlinson Vijay K. Garg
- AN ALGORITHM FOR MINIMALLY LATENT GLOBAL VIRTUAL TIME
- Implementable Failure Detectors in Asynchronous Systems Vijay K. Garg, J. Roger Mitchell
- Using the causal domain to specify and verify distributed programs y
- Characterization of Message Ordering Specifications and Protocols
- Expressing and Detecting General Control Flow of Distributed Computations
- P U B L I C A T I O N I N T E R N E
- Some Optimal Algorithms for Decomposed Partially Ordered Sets Vijay K. Garg
- Observation of global properties in distributed systems Vijay K. Garg
- Detecting Conjunctive Channel Predicates in a Distributed Programming Environment
- Causality for Time: How to Specify and Verify Distributed Algorithms
- Distributed Recovery with K-Optimistic Logging Yi-Min Wang Om P. Damani Vijay K. Garg
- Concurrent Regular Expressions and their Relationship to Petri Nets Vijay K. Garg 1
- Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution ?
- VIJAY KUMAR GARG Cullen Trust for Higher Education Endowed Professor
- Introduction Contributions
- Weighted Byzantine Agreement Vijay K. Garg John Bridgman
