Results 1 
4 of
4
Determinant algorithms for random planar structures
 In Proc. of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms
, 1997
"... ..."
Simple Competitive Request Scheduling Strategies
 in 11th ACM Symposium on Parallel Architectures and Algorithms
, 1999
"... In this paper we study the problem of scheduling realtime requests in distributed data servers. We assume the time to be divided into time steps of equal length called rounds. During every round a set of requests arrives at the system, and every resource is able to fulfill one request per round. Ev ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we study the problem of scheduling realtime requests in distributed data servers. We assume the time to be divided into time steps of equal length called rounds. During every round a set of requests arrives at the system, and every resource is able to fulfill one request per round. Every request specifies two (distinct) resources and requires to get access to one of them. Furthermore, every request has a deadline of d, i.e. a request that arrives in round t has to be fulfilled during round t +d 1 at the latest. The number of requests which arrive during some round and the two alternative resources of every request are selected by an adversary. The goal is to maximize the number of requests that are fulfilled before their deadlines expire. We examine the scheduling problem in an online setting, i.e. new requests continuously arrive at the system, and we have to determine online an assignment of the requests to the resources in such a way that every resource has to fulfil...
A SelfStabilizing Algorithm for Maximum Matching in Trees
, 1994
"... Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many efficient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many efficient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a distributed, selfstabilizing algorithm for finding a maximum matching in trees. Since our algorithm is selfstabilizing, it does not require any initialization and is tolerant to transient faults. The algorithm can also dynamically adapt to arbitrary changes in the topology of the tree. Keywords: Distributed algorithms, Matching, Selfstabilization, Trees. 1 Introduction Let G = (V; E) be an undirected graph. Two edges in E are said to be adjacent if they share a common endpoint. A matching in G is a set of edges M ` E such that no two edges in M are adjacent. A matching M is called a maximum cardinality matching, or maximum matching in short, if M has largest cardinality among all pos...