Rainer Gawlick

Learn More
When proving the correctness of algorithms in distributed systems, one generally considers safety conditions and liveness conditions. The Input/Output (I/O) automaton model and its timed version have been used successfully, but have focused on safety conditions and on a restricted form of liveness called fairness. In this paper we develop a new I/O(More)
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, real-time database servers, and the provision of permanent virtual channels in large-scale communications(More)
Emerging high speed Broadband Integrated Services Digital Networks (B-ISDN) will carry tra c for services such as video-on-demand and video teleconferencing { that require resource reservation along the path on which the tra c is sent. As a result, such networks will need e ective admission control algorithms. The simplest approach is to use greedy(More)
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al [1] and Raghavan and Upfal [22] as a model for routing in all-optical(More)
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memory system, a powerful tool for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, `-exclusion, randomized consensus, and multi-writer multi-reader atomic registers. Solutions to(More)
Emerging high speed Broadband Integrated Services Digital Networks (B-ISDN) are expected to carry traac for services like video-on-demand and video teleconferencing which will require resource reservation along the path on which the traac is sent. As a result, such networks will need eecient routing and admission control algorithms. The simplest approach is(More)
Much of modern systems programming involves designing algorithms for distributed systems in which the nodes have access to information about time. Time information can be used to estimate the time at which system or environment events occur, to detect process failures, to schedule the use of resources, and to synchronize activities of different system(More)
This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing(More)
Contracts have traditionally been regarded as means of individual commitment. This article offers a broader vision, viewing contracts as potential means of bilateral commitment as well. Drawing on a burgeoning literature in economics, this article explains that commitment to stick with an original contract, even if both parties later want to modify that(More)