Bhaskar Dasgupta, Kishori M. Konwar, Ion I. M, Alex A. Shvartsman
Highly scalable algorithms for robust string
ABSTRACT Autonomous Virtual Mobile Nodes (Extended Abstract) (2008)
Shlomi Dolev, Alex A. Shvartsman, Jennifer Welch, Elad Schiller
This paper presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An Autonomous Virtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with the...
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
1 Introduction In this paper, we introduce a new approach to designing algorithms for mobile ad hoc networks. An ad hoc network uses no pre-existing infrastructure, unlike cellular networks that...
Efficient Parallelism Vs Reliable Distribution: A Trade-Off for Concurrent Computations (2007)
Dimitrios Michailadis, Paris Kanellakis Dimitrios, Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman, Alex A. Shvartsman
. Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is...
Efficient Parallelism Vs Reliable Distribution: A Trade-Off for Concurrent Computations (2007)
Paris Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman
. Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is...
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in mobile ad hoc networks. Our approach is based on associating abstract atomic objects with...
M. Cecilia Bastarrica, Steven A. Demurjian, Alex A. Shvartsman
Low level difficulties in the development of distributed systems that are due to non-standard communication protocols and incompatible components or platforms have largely been solved through...
I 5: A FRAMEWORK FOR ARCHITECTURAL SPECIFICATION OF DISTRIBUTED SYSTEMS (2007)
M. Cecilia Bastarrica, Steven A. Demurjian, Alex A. Shvartsman
ABSTRACT. Architecting, designing, configuring and deploying a sophisticated distributed system is a challenging process that involves many complicated design and specification tasks. A unifying...
Mar'ia Cecilia Bastarrica, Scott Craig, Steven A. Demurjian, Alex A. Shvartsman
is an integrated framework for organizing, designing and documenting distributed systems configuration. It is a valuable tool mainly for large and complex distributed systems. We designed I 5, a...
Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman
Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [9]. Many distributed and parallel algorithms have been developed for this basic problem and several...
Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman
We consider a distributed environment consisting of n processors that need to perform t tasks. We assume that communication is initially unavailable and that processors begin work in isolation. At...
GeoQuorums: Implementing Atomic Memory (2007)
In Mobile Ad, Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
Shlomi Dolev , Seth Gilbert , Nancy A. Lynch , Alex A. Shvartsman 3;2 , and Jennifer L. Welch Department of Computer Science, Ben-Gurion University, dolev@cs.bgu.ac.il MIT CSAIL,...
Two Optimization Techniques for (2007)
M. Cecilia Bastarrica, Rodrigo E. Caballero, Steven A. Demurjian, Alex A. Shvartsman
Performance of a distributed system can be greatly affected by the deployment of the system components over the nodes of the target network. Performance evaluation and tuning after deployment is...
Mobile Ad, Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
Abstract. We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in ad hoc networks. Our approach is based on abstract nodes associated with certain...
Fault-Tolerance and Efficiency in Massively Parallel Algorithms (2006)
Kanellakis, Paris O., Shvartsman, Alex A.
We present an overview of massively parallel deterministic algorithms which combine high fault-tolerance and efficiency. This desirable combination (called robustness here) is nontrivial, since...
Highly Scalable Algorithms for Robust String Barcoding (2005)
DasGupta, Bhaskar, Konwar, Kishori M., Mandoiu, Ion I., Shvartsman, Alex A.
String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms for robust string...
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms, (2005)
Kanellakis, Paris C., Michailidis, Dimitrios, Shvartsman, Alex A.
The CRCW PRAM under dynamic fail-stop (no restart) processor behavior is a fault-prone multiprocessor model for which it is possible to both guarantee reliability and preserve efficiency. To handle...
Highly scalable algorithms for robust string barcoding (2005)
Bhaskar Dasgupta, Kishorim. Konwar, Ioni. Măndoiu, Alex A. Shvartsman
Abstract. String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms for robust...
Highly scalable algorithms for robust string barcoding (2005)
Bhaskar Dasgupta, Kishori M. Konwar, Ion I. Măndoiu, Alex A. Shvartsman
∗ Authors are listed in alphabetical order. Abstract: String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the...
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks (2004)
Dolev, Shlomi, Gilbert, Seth, Lynch, Nancy A., Shvartsman, Alex A., Welch, Jennifer L.
We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memoryin mobile ad hoc networks. Our approach is based on associating abstract atomic objects with...
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks (2004)
Dolev, Shlomi, Gilbert, Seth, Lynch, Nancy A., Shvartsman, Alex A., Welch, Jennifer L.
We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memoryin mobile ad hoc networks. Our approach is based on associating abstract atomic objects with...
Virtual mobile nodes for mobile ad hoc networks (2004)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alex A. Shvartsman, Jennifer L. Welch
Abstract. One of the most significant challenges introduced by mobile networks is coping with the unpredictable motion and the unreliable behavior of mobile nodes. In this paper, we define the...
Virtual Mobile Nodes for Mobile Ad Hoc Networks (Extended Abstract) (2004)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alex A. Shvartsman, Jennifer Welch
Shlomi Dolev Seth Gilbert Nancy A. Lynch Elad Schiller Alex A. Shvartsman zy Jennifer Welch February 24, 2004 Abstract One of the most significant challenges introduced by mobile networks is the...
Virtual mobile nodes for mobile ad hoc networks (2004)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alex A. Shvartsman, Jennifer L. Welch
1 Introduction Devising algorithms for mobile networks is hard. In this paper we present theVirtual Mobile Node Abstraction, which can be used to make this process easier. The key challenge in mobile...
Virtual mobile nodes for mobile ad hoc networks (2004)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alex A. Shvartsman, Jennifer L. Welch
Abstract. One of the most significant challenges introduced by mobile networks is coping with the unpredictable motion and the unreliable behavior of mobile nodes. In this paper, we define the...
Geoquorums: Implementing atomic memory in mobile ad hoc networks (2003)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
Abstract We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memoryin mobile ad hoc networks. Our approach is based on associating abstract atomic objects...
The Do-All Problem with Byzantine Processor Failures (2003)
Antonio Fernández, Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman
Do-All is the abstract problem of using n processors to cooperatively perform m independent tasks in the presence of failures. This problem and its derivatives have been a centerpiece in the study of...
GeoQuorums: Implementing Atomic Memory in Ad Hoc Networks (Extended Abstract) (2003)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
Shlomi Dolev Seth Gilbert Nancy A. Lynch Alex A. Shvartsman Jennifer L. Welch Abstract In this paper, we present a new approach for implementing atomic read/write shared memory in ad hoc networks....
Distributed Scheduling for Disconnected Cooperation (2003)
Grzegorz Malewicz, Grzegorz Malewicz, Grzegorz Malewicz, Alex A. Shvartsman, Bogdan S. Chlebus, Alexander C. Russell
This dissertation studies a cooperation problem where a system of distributed asynchronous devices, that can be disconnected for long and unknown periods, must e#ciently perform a set of tasks
Geoquorums: Implementing atomic memory in mobile ad hoc networks (2003)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
Abstract. We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in ad hoc networks. Our approach is based on abstract nodes associated with certain...
Geoquorums: Implementing atomic memory in mobile ad hoc networks (2003)
Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alex A. Shvartsman, Jennifer L. Welch
We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in mobile ad hoc networks. Our approach is based on associating abstract atomic objects with...
RAMBO: A reconfigurable atomic memory service for dynamic networks (2002)
Nancy Lynch, Alex A. Shvartsman
Abstract. This paper presents an algorithm that emulates atomic read/write shared objects in a dynamic network setting. To ensure availability and faulttolerance, the objects are replicated. To...
Bounding work and communication in robust cooperative computation (2002)
Bogdan S. Chlebus, Leszek G, Dariusz R. Kowalski, Alex A. Shvartsman
(t + p log2 p) against a linearly-bounded adversary; this result is close to lower bound \Omega (t + p log p = log log p).
RAMBO: A reconfigurable atomic memory service for dynamic networks (2002)
Peter M. Musial, Alex A. Shvartsman
Transforming abstract algorithm specifications into executable code is an error-prone process in the absence of sophisticated compilers that can automatically translate such specifications into the...
A.: Local Scheduling for Distributed Cooperation (2001)
Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman
The emergence of mobile computing paradigms has created new dimensions for the problem of performing a collection of tasks in a distributed setting. Indeed, an intrinsic feature of mobile computing...
Performing tasks on synchronous restartable message-passing processors (2001)
Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman
We consider the problem of performing t tasks in a distributed system of p faultprone processors. This problem, called do-all herein, was introduced by Dwork, Halpern and Waarts. Our work deals with...
A.: Local Scheduling for Distributed Cooperation (2001)
Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman
The emergence of mobile computing paradigms has created new dimensions for the problem of performing a collection of tasks in a distributed setting. Indeed, an intrinsic feature of mobile computing...
Performing Tasks on Synchronous Restartable Message-Passing Processors (2001)
Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman
We consider the problem of performing t tasks in a distributed system of p faultprone processors. This problem, called do-all herein, was introduced by Dwork, Halpern and Waarts. Our work deals with...
Optimal Scheduling for Disconnected Cooperation (2001)
Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman, Grzegorz Greg, Malewicz Alex
We consider a distributed environment consisting of n processors that need to perform t tasks. We assume that communication is initially unavailable and that processors begin work in isolation. At...
Performing Tasks on Synchronous Restartable Message-passing Processors (2001)
Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman
We consider the problem of performing t tasks in a distributed system of p faultprone processors. This problem, called do-all herein, was introduced by Dwork, Halpern and Waarts. Our work deals with...
The complexity of synchronous iterative Do-All with crashes (2001)
Chryssis Georgiou, Er Russell, Alex A. Shvartsman
Abstract. Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [8]. Many distributed and parallel algorithms have been developed for this problem and...
Distributed cooperation during the absence of communication (2000)
Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman
Abstract. This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n processors is...
The Complexity of Distributed Cooperation in the Presence of Failures (2000)
Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman
Abstract. We consider the problem of performing N tasks in a distributed system of P processors that are subject to failures. An optimal solution would have the system perform Θ(N) tasks, however...
I : A Framework for Architectural Specification of Distributed Object Systems (1999)
M. Cecilia Bastarrica, Steven A. Demurjian, Alex A. Shvartsman
ABSTRACT. Architecting, designing, configuring and deploying a sophisticated distributed system is a challenging process that involves many complicated design and specification tasks. A unifying...
Efficient Parallel Algorithms on Restartable Fail-Stop Processors, (1998)
Kanellakis, Paris C., Shvartsman, Alex A.
We study efficient deterministic executions of parallel algorithms on restartable fail-stop CRCW PRAMs. We allow the PRAM processors to be subject to arbitrary stop failures and restarts, that are...
Parallel Algorithms with Processor Failures and Delays. (1998)
Buss, Jonathan F., Kanellakis, Paris C., Radge, Prabhakar L., Shvartsman, Alex A.
We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and strongly asynchronous PRAMs. In the first model, synchronous processors are subject to...
How to Write-All Efficiently Even with Contaminated Memory. (1998)
The problem of Write-All -using P-processors write l's into all locations of an array of size N, where P < N- has been used as the basic building block for constructing efficient and fault-tolerant...
Software Architectural Specification for Optimal Object Distribution (1998)
M. Cecilia Bastarrica, Steven A. Demurjian, Alex A. Shvartsman
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its intended functions,...
Software architectural specification for optimal object distribution (1998)
M. Cecilia Bastarrica, Alex A. Shvartsman
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its intended functions,...
Performing Tasks on Restartable Message-Passing Processors (1997)
Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman
This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone processors. The algorithms...
Implementing and Evaluating (1997)
Oleg M. Cheiner, Alex A. Shvartsman
data types and clients, thus demonstrating the utility of the service as a building block suitable for serving as a distributed operating system component. (3) The implementation has been...
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (1995)
Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman
The CRCW PRAM under dynamic fail-stop (no restart) processor behavior is a faultprone multiprocessor model for which it is possible to both guarantee reliability and preserve efficiency. To handle...
Parallel Algorithms with Processor Failures and Delays (1995)
Jonathan F. Buss, Paris C. Kanellakis, Prabhakar L. Ragde, Alex A. Shvartsman
We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and asynchronous PRAMs. In the first model, synchronous processors are subject to arbitrary stop...
Efficient Parallelism Vs Reliable Distribution: A Trade-Off for Concurrent Computations (1994)
Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman
. Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is...
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (1993)
Paris Kanellakis Dimitrios, Paris C. Kanellakis, Dimitrios Michailidis, Dimitrios Michailidis, Alex A. Shvartsman, Alex A. Shvartsman
. The CRCW PRAM under dynamic fail-stop (no restart) processor behavior is a fault-prone multiprocessor model for which it is possible to both guarantee reliability and preserve efficiency. To handle...