Results 1  10
of
446
Brief announcement: transaction polymorphism
 In SPAA
, 2011
"... In this work, we present transaction polymorphism, a synchronization technique that provides more control to the programmer than traditional (i.e., monomorphic) transactions to achieve comparable performance to generic lockbased and lockfree solutions. We prove the following results: (i) Lockba ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work, we present transaction polymorphism, a synchronization technique that provides more control to the programmer than traditional (i.e., monomorphic) transactions to achieve comparable performance to generic lockbased and lockfree solutions. We prove the following results: (i) Lockbased synchronization enables strictly higher concurrency than monormophic transactions. (ii) Polymorphic transactions enable strictly higher concurrency than monomorphic transactions. The former result indicates that there exist some transactional programs that will never perform as well as their lockbased counterparts, whatever improvement could be made at the hardware level to diminish the overhead associated with transactional accesses. The latter result shows, however, that transaction polymorphism is a promising solution to cope with this issue.
DISC 2001 Brief Announcements
, 2001
"... . In this paper we study the implementability of different classes of failure detectors in several models of partial synchrony. We show that no failure detector with perpetual accuracy (namely, , , , and ) can be implemented in any of the models of partial synchrony proposed in [2, 4] in sy ..."
Abstract
 Add to MetaCart
. In this paper we study the implementability of different classes of failure detectors in several models of partial synchrony. We show that no failure detector with perpetual accuracy (namely, , , , and ) can be implemented in any of the models of partial synchrony proposed in [2, 4] in systems with even a single failure. We also show that, in these models of partial synchrony, it is necessary a majority of correct processes to implement a failure detector of class Q. 1
Brief Announcement: Swarming Secrets∗
"... We present informationtheoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of changes to the swarm including players joining and leaving the swarm, while swarms may be merged, cloned or split. The schemes ..."
Abstract
 Add to MetaCart
We present informationtheoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of changes to the swarm including players joining and leaving the swarm, while swarms may be merged, cloned or split. The schemes securely and distributively maintain a global state for the swarm, and support an unlimited number of changes to the state according to received input. Our schemes are based on a novel construction of a strongly oblivious universal Turing Machine and on a distributed evaluation of this TM that reveals nothing to an adversary beyond a bound on the space complexity of the TM.
Brief Announcement: An Implementation Report for . . .
, 2006
"... Since the discovery of Gröbner bases, the algorithmic advances in Commutative Algebra have made possible to tackle many classical problems in Algebraic Geometry that were previously out of reach. However, algorithmic progress is still desirable, for instance when solving symbolically a large system ..."
Abstract
 Add to MetaCart
Since the discovery of Gröbner bases, the algorithmic advances in Commutative Algebra have made possible to tackle many classical problems in Algebraic Geometry that were previously out of reach. However, algorithmic progress is still desirable, for instance when solving symbolically a large system of algebraic nonlinear equations. For such a system, in particular if its solution set consists of geometric components of different dimension (points, curves, surfaces, etc) it is necessary to combine Gröbner bases with decomposition techniques, such as triangular decompositions. Ideally, one would like each of the different components to be produced by an independent processor, or set of processors. In practice, the input polynomial system, which is hiding those components, requires some transformations in order to split
Brief Announcement: A Sample Brief Announcement from 2008 for Other Years
"... Distributed consensus can be achieved on asynchronous communication networks when assisted by quantum mechanics. This contradicts the FLP impossibility result by achieving consensus in the presence of faults. Categories and Subject Descriptors ..."
Abstract
 Add to MetaCart
Distributed consensus can be achieved on asynchronous communication networks when assisted by quantum mechanics. This contradicts the FLP impossibility result by achieving consensus in the presence of faults. Categories and Subject Descriptors
Brief Announcement: Deterministic SkipNet
 In Proc 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003
, 2003
"... We present a deterministic scalable overlay network. In contrast, most previous overlays use randomness or hashing (pseudorandomness) to achieve a uniform distribution of data and routing traffic. 1. DETERMINISTIC SKIPNET Many selforganizing peertopeer overlay networks have been proposed as buil ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a deterministic scalable overlay network. In contrast, most previous overlays use randomness or hashing (pseudorandomness) to achieve a uniform distribution of data and routing traffic. 1. DETERMINISTIC SKIPNET Many selforganizing peertopeer overlay networks have been proposed as building blocks for distributed applications. For most of these overlays, such as Chord [4], their primary purpose is to form a distributed hash table. SkipNet [2] is a new overlay based on Skip Lists that organizes nodes and data primarily by their sorted string names, as Skip Lists do, rather than by hashes of those names. Consequently, SkipNet supports useful locality properties in addition to the usual distributed hash table functionality. This paper describes Deterministic SkipNet, a variant of
Brief announcement: Detecting malicious routers
 In Proceedings of the twentythird annual ACM symposium on Principles of Distributed Computing
, 2004
"... Network routers occupy a unique role in modern distributed systems. They are responsible for cooperatively shuttling packets amongst themselves in order to provide the illusion of a network with universal pointtopoint connectivity. However, this illusion is shattered – as are implicit assumptions ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Network routers occupy a unique role in modern distributed systems. They are responsible for cooperatively shuttling packets amongst themselves in order to provide the illusion of a network with universal pointtopoint connectivity. However, this illusion is shattered – as are implicit assumptions of availability, confidentiality or integrity – when network routers are subverted to act in a malicious fashion. By compromising a router, an attacker may drop, delay, reorder, corrupt, modify or divert any of the packets passing through. Such a capability can then be used to deny service to legitimate hosts, to implement ongoing network surveillance or to provide an efficient maninthemiddle functionality for attacking end systems. Tolerating compromised routers requires three problems to be addressed: TRAFFIC VALIDATION: Given the distributed
Brief Announcement: DeadlineAware Scheduling
 of BigData Processing Jobs,” in SPAA
, 2014
"... ABSTRACT This paper presents a novel algorithm for scheduling big data jobs on large compute clusters. In our model, each job is represented by a DAG consisting of several stages linked by precedence constraints. The resource allocation per stage is malleable, in the sense that the processing time ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ABSTRACT This paper presents a novel algorithm for scheduling big data jobs on large compute clusters. In our model, each job is represented by a DAG consisting of several stages linked by precedence constraints. The resource allocation per stage is malleable, in the sense that the processing time of a stage depends on the resources allocated to it (the dependency can be arbitrary in general). The goal of the scheduler is to maximize the total value of completed jobs, where the value for each job depends on its completion time. We design an algorithm for the problem which guarantees an expected constant approximation factor when the cluster capacity is sufficiently high. To the best of our knowledge, this is the first constantfactor approximation algorithm for the problem. The algorithm is based on formulating the problem as a linear program and then rounding an optimal (fractional) solution into a feasible (integral) schedule using randomized rounding.
Brief Announcement: The Theory Of Network Tracing
"... A widely used mechanism for computing the topology of any network in the Internet is Traceroute. Using Traceroute, one simply needs to choose any two nodes in a network and then obtain the sequence of nodes that occur between these two nodes, as specified by the routing tables in these nodes. Thus, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A widely used mechanism for computing the topology of any network in the Internet is Traceroute. Using Traceroute, one simply needs to choose any two nodes in a network and then obtain the sequence of nodes that occur between these two nodes, as specified by the routing tables in these nodes. Thus, each use of Traceroute in a network produces a trace of nodes that constitute a simple path in this network. In every trace that is produced by Traceroute, each node occurs either by its unique identifier or by the anonymous identifier “*”. In this paper, we introduce the first theory aimed at answering the following important question. Is there an algorithm to compute the topology of a network N from a trace set T that is produced by using Traceroute in N, assuming that each edge in N occurs in at least one trace in T, and that each node in N occurs by its unique identifier in at least one trace in T? Our theory shows that the answer to this question is “No ” in general. But if N is a tree, or is an odd ring, then the answer is “Yes”. On the other hand, if N is an even ring, the answer is “No”, but if N is a “mostly regular ” even ring, then the answer is “Yes”.
Results 1  10
of
446