Optimal Communication Coverage for Free-Space-Optical MANET Building Blocks (2009)
Murat Yuksel, Jayasri Akella, Shivkumar Kalyanaraman, Partha Dutta
Abstract- Existence of line of sight (LOS) and alignment between the communicating antennas is one of the key requirements for free-space-optical (FSO) communication. To ensure uninterrupted data...
Wireless Netw, Murat Yuksel, Jayasri Akella, Shivkumar Kalyanaraman, Partha Dutta, M. Yuksel, ...
Free-space-optical mobile ad hoc networks: Auto-configurable
ACM SIGACT News Distributed Computing Column 10 (2009)
Sergio Rajsbaum, Deconstructing Paxos, Romain Boichat, Partha Dutta, Svend Frølund, Rachid Guerraoui
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases,...
A Market-based Approach to Multi-factory Scheduling (2009)
Vytelingum, Perukrishnen, Macbeth, Douglas K., Dutta, Partha, Stranjak, Armin, Rogers, Alex, Jennings, Nick
In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations of scheduling in a centralised...
Multi-parametric bifurcations in a piecewise smooth map with square-root singularity (2009)
Dutta, Partha, Avrutin, Viktor, Schanz, Michael, Banerjee, Soumitro
Considering the concept of multi-parametric bifurcations, the piecewise smooth linear normal form map can exhibit many typical bifurcation phenomena, which can not be observed in smooth dynamical...
A New Channel Assignment Mechanism for Rural Wireless Mesh Networks (2008)
Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi
villages gateway node Fig. 1. A rural wireless mesh network. Abstract — In this paper we present a new channel allocation scheme for IEEE 802.11 based mesh networks with point-topoint links,...
Partha Dutta, Romain Boichat, Rachid Guerraoui
Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion...
How Fast can a Distributed Atomic Read be? 1 (2008)
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Marko Vukolic
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as failure...
THE TIME-COMPLEXITY OF LOCAL DECISION IN DISTRIBUTED AGREEMENT ∗ (2008)
Partha Dutta, Rachid Guerraoui, Bastian Pochon
Abstract. Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of...
Distributed Computing manuscript No. (will be inserted by the editor) (2008)
Partha Dutta, Rachid Guerraoui, Idit Keidar
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery mode following...
ACM SIGACT News Distributed Computing Column 11 (2008)
Sergio Rajsbaum The, Sergio Rajsbaum, Romain Boichat, Partha Dutta, Rachid Guerraoui
this paper how to reconstruct, in a modular manner, powerful variants of Paxos. In particular, we show how to (1) alleviate the need for stable storage access if some processes remain up for...
Optimistic Erasure Coded Distributed Storage (2008)
Dutta, Partha, Guerraoui, Rachid, Levy, Ron
Erasure coded storage provides a cheap and space efficient way to tolerate failures through the use of networked commodity servers. Erasure coded data is kept on n different servers out of which f...
Optimistic Erasure-Coded Distributed Storage (2008)
Dutta, Partha, Guerraoui, Rachid, Levy, Ron R.
We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system....
Romain Boichat, Partha Dutta, Rachid Guerraoui
Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion...
The Inherent Price of Indulgence [Preliminary Version] (2007)
Partha Dutta, Rachid Guerraoui
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower...
Tight Bounds on Early Local Decisions in Uniform Consensus (Extended Abstract) (2007)
Partha Dutta, Rachid Guerraoui, Bastian Pochon
Abstract. When devising a uniform consensus algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for...
The Time-Complexity of Local Decision in Distributed Agreement (2007)
Dutta, Partha, Guerraoui, Rachid, Pochon, Bastian
Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of distributed...
Villagenet: A low-cost, 802.11-based mesh network for rural regions (2007)
Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi
Abstract — VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-shelf IEEE...
Dutta, Partha., Schneegurt, Mark A. Advisor
[Author's abstract] Many studies of hyper saline environments have been performed, mainly on aquatic systems. However, the microbial community in terrestrial thallasohaline environments has not been...
Thesis (M.S.)--Wichita State University, Dept. of Biological Sciences.
Thesis (M.S.)--Wichita State University, College of Liberal Arts and Sciences, Dept. of Biological Sciences.
Time-complexity bounds on agreement problems (2005)
In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing...
Time-complexity bounds on agreement problems (2005)
In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing...
The Inherent Price of Indulgence (2005)
Dutta, Partha, Guerraoui, Rachid
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower...
A Lower Bound for Total Order Broadcast (2005)
Dutta, Partha, Guerraoui, Rachid, Levy, Ron R., Pochon, Bastian
We give a lower bound for total order broadcast algorithms in an asynchronous system with a perfect failure detector P. We consider a set of n processes that communicate by message-passing using...
How Fast can a Distributed Atomic Read be? (2005)
Dutta, Partha, Guerraoui, Rachid, Levy, Ron R., Vukolic, Marko
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as failure...
Time-complexity bounds on agreement problems / (2005)
Thèse no 3261 sc. EPF Lausanne.
How Fast Can Eventual Synchrony Lead to Consensus? (2005)
Partha Dutta, Rachid Guerraoui, Leslie Lamport
It is well known that the consensus problem can be solved in a distributed system if, after some time T S , no process fails and there is some upper bound # on how long it takes to deliver a message....
Leslie Lamport Microsoft (2005)
Partha Dutta, Rachid Guerraoui
It is well known that the consensus problem can be solved in a distributed system if, after some time TS, no process fails and there is some upper bound δ on how long it takes to deliver a message....
Best-case complexity of asynchronous Byzantine consensus (2005)
Partha Dutta, Rachid Guerraoui, Marko Vukolić
Abstract. This paper establishes the first theorem relating resilience, time complexity and authentication in distributed computing. We study consensus algorithms that tolerate Byzantine failures and...
Best-case complexity of asynchronous Byzantine consensus (2005)
Partha Dutta, Rachid Guerraoui, Marko Vukolić
Abstract. This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus...
Building blocks for mobile free-space-optical networks (2005)
Jayasri Akella, Chang Liu Ψ, David Partyka, Murat Yuksel, Shivkumar Kalyanaraman, Partha Dutta
Abstract- Existence of line of sight (LOS) and alignment between the communicating antennas are one of the key requirements for free-space-optical (FSO) communication. To ensure uninterrupted data...
Cooperative Information Sharing to Improve Distributed Learning (2004)
Dutta, Partha, Dasmahapatra, Srinandan, Gunn, Steve, Jennings, Nick, Moreau, Luc
Effective coordination in partially observable MAS requires agent actions to be based on reliable estimates of non-local states. One way of generating such estimates is to allow the agents to share...
How fast can a distributed atomic read be? (2004)
Dutta, Partha, Guerraoui, Rachid, Levy, Ron R., Chakraborty, Arindam
This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider...
Fast Non-Blocking Atomic Commit: An Inherent Trade-off (2004)
Dutta, Partha, Guerraoui, Rachid, Pochon, Bastian
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t > 3...
The Overhead of Consensus Failure Recovery (2004)
Dutta, Partha, Guerraoui, Rachid, Keidar, Idit
Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free periods, and a slower recovery mode following failures. A lot of work...
Asynchronous Byzantine Consensus: Complexity, Resilience and Authentication (2004)
Dutta, Partha, Guerraoui, Rachid, Vukolic, Marko
We present a consensus algorithm that tolerates Byzantine process failures and arbitrarily long periods of network asynchrony. Our algorithm is the first to match the general time-complexity lower...
The Complexity of Asynchronous Byzantine Consensus (2004)
Dutta, Partha, Guerraoui, Rachid, Vukolic, Marko
This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus algorithms...
Fast Non-Blocking Atomic Commit: An Inherent Trade-off (2004)
Partha Dutta, Rachid Guerraoui, Bastian Pochon
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t an...
How Fast can a Distributed Atomic Read be? (2004)
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Arindam Chakraborty
This paper addresses the problem of designing an ecient implementation of a basic atomic read-write data structure over an asynchronous message-passing system.
Fast non-blocking atomic commit: an inherent trade-off (2004)
Partha Dutta, Rachid Guerraoui, Bastian Pochon
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3...
Early Local Decisions in Distributed Agreement (2003)
Dutta, Partha, Guerraoui, Rachid, Pochon, Bastian
When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all...
Romain Boichat, Partha Dutta, Rachid Guerraoui
The Island of Paxos used to host a great civilisation which had developed a sophisticated parttime parliament protocol. Paxons codied various aspects of their parliament protocol which enabled them...
www.elsevier.com/locate/ipl Fast non-blocking atomic commit: an inherent trade-off (2003)
Partha Dutta, Rachid Guerraoui, Bastian Pochon
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t � 3...
An Efficient Universal Construction for Message-PassingSystems (2002)
Dutta, Partha, Frolund, Svend, Guerraoui, Rachid, Pochon, Bastian
A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a novel...
Fast Indulgent Consensus with Zero Degradation (2002)
Dutta, Partha, Guerraoui, Rachid
This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail...
The Inherent Price of Indulgence (2002)
Partha Dutta, Rachid Guerraoui
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower...
Fast Indulgent Consensus with Zero Degradation (2002)
Partha Dutta, Rachid Guerraoui
This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail...
An efficient universal construction for message-passing systems (2002)
Partha Dutta, Rachid Guerraoui, Bastian Pochon
Abstract A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a...
The Inherent Price of Indulgence (2002)
Partha Dutta And, Partha Dutta, Rachid Guerraoui
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower...
Boichat, Romain, Dutta, Partha, Frolund, Svend, Guerraoui, Rachid
The Paxos part-time parliament protocol of Lamport provides a non trivial but very practical way to implement fault-tolerant deterministic services over a distributed message passing system. This...
Dutta, Partha, Boichat, Romain, Guerraoui, Rachid
Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion...
Romain Boichat Partha, Partha Dutta, Svend Frølund, Rachid Guerraoui
The Paxos part-time parliament protocol of Lamport provides a very practical way to implement a fault-tolerant deterministic service by replicating it over a distributed message passing system. The...
A study of turbulent lean-premixed prevaporized combustion with emphasis on fuel dispersion (1995)
An experimental/computational investigation of turbulent spray processes affecting premixing-prevaporization in liquid-fueled lean-premixed combustors is reported. Low combustor emissions levels and...