Suche
Ergebnisse
-
-
-
Virtual reality and geoinformation systems
(1997)Technical report / Federal Institute of Technology, Computer Science DepartmentReport -
Low-cost fault-tolerant spanning graphs for point sets in the Euclidean plane
(1997)Technical Report / ETH Zurich, Department of Computer ScienceThe concept of the minimum spanning tree (MST) plays an important role in topological network design, because it models a cheapest connected network. In a tree, however, the failure of a vertex can disconnect the network. In order to tolerate such a failure, we generalize the MST to the concept of a cheapest biconnected network. For a set of points in the Euclidean plane, we show that it is NP-hard to find a cheapest biconnected spanning ...Report -
Singularities make spatial join scheduling hard
(1997)Technische Berichte / ETH Zürich, Departement InformatikReport -
An inherent bottleneck in distributed counting
(1997)Technical report / Department Informatik, ETH ZürichA distributed counter allows each processor in an asynchronous message passing network to access the counter value and increment it We study the problem of implementing a distributed counter such that no processor is a communication bottleneck We prove a lower bound of k on the number of messages that some processor must exchange in a sequence of n counting operations spread over n processors where kkk n We propose a counter that achieves ...Report -
Distributed counting at maximum speed
(1997)Technical Report / ETH Zurich, Department of Computer ScienceReport -
-
Balanced distributed search trees do not exist
(1995)Internal report / Eidgenössische Technische Hochschule, Departement InformatikReport -