Florian Schintke

Learn More
We present Scalaris, an Erlang implementation of a distributed key/value store. It uses, on top of a structured overlay network, replication for data availability and majority based distributed transactions for data consistency. In combination, this implements the ACID properties on a scalable structured overlay. By directly mapping the keys to the overlay(More)
— Core grid technologies are rapidly maturing, but there remains a shortage of real grid applications. One important reason is the lack of a simple and high-level application programming toolkit, bridging the gap between existing grid middleware and application-level needs. The Grid Application Toolkit (GAT), as currently developed by the EC-funded project(More)
We present a transaction processing scheme for structured overlay networks and use it to develop a distributed Wiki application based on a relational data model. The Wiki supports rich metadata and additional indexes for navigation purposes. Ensuring consistency and durability requires handling of node failures. We mask such failures by providing high(More)
We introduce SONAR, a structured overlay to store and retrieve objects addressed by multi-dimensional names (keys). The overlay has the shape of a multi-dimensional torus, where each node is responsible for a contiguous part of the data space. A uniform distribution of keys on the data space is not necessary, because denser areas get assigned more nodes. To(More)
Large Grid systems not only provide massive aggregated computing power but also an unprecedented amount of distributed storage space. Unfortunately, the dynamic behavior of the Grid, caused by varying resource availability, unpredictable data updates, and the impact of local site policies make it difficult to exploit the full capabilities of Data Grids. We(More)
SUMMARY We present a scheme for reserving job resources with imprecise requests. Typical parameters such as the estimated runtime, the start time or the type or number of required CPUs need not be fixed at submission time but can be kept fuzzy in some aspects. Users may specify a list of preferences which guide the system in determining the best matching(More)
The Testbed and Applications working group of the Eu-ropean Grid Forum (EGrid) is actively building and experimenting with a grid infrastructure connecting several research-based supercomputing sites located in Europe. This paper reports on our first feasibility study: running a self-migrating version of the Cactus simulation code across the European grid(More)
Consistent hashing is at the core of many P2P protocols. It evenly distributes the keys over the nodes, thereby enabling logarithmic routing effort 'with high probability'. However, consistent hashing incurs unnecessary overhead as shown in this paper. By removing consistent hashing from Chord, we derived a protocol that has the same favorable logarithmic(More)