Future Generation Grids
Proceedings of the Workshop on Future Generation Grids November 1–5, 2004, Dagstuhl, Germany
Page
%P
15 Result(s)
-
Chapter and Conference Paper
Building Large Compressed PDBs for the Sliding Tile Puzzle
The performance of heuristic search algorithms depends crucially on the effectiveness of the heuristic. A pattern database (PDB) is a powerful heuristic in the form of a pre-computed lookup table. Larger PDBs ...
-
Chapter and Conference Paper
A Structured Overlay for Multi-dimensional Range Queries
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 con...
-
Book
-
Chapter and Conference Paper
Topic 6: Grid and Cluster Computing: Models, Middleware and Architectures
Grid computing is a major research area with strong involvement from both academia and the computing industry. The common vision is that Grid computing represents the culmination of truly general distributed c...
-
Chapter
On Adaptability in Grid Systems
With the increasing size and complexity, adaptability is among the most badly needed properties in today’s Grid systems. Adaptability refers to the degree to which adjustments in practices, processes, or struc...
-
Chapter
Entwicklung der Spielbaum-Suchverfahren: Von Zuses Schachhirn zum modernen Schachcomputer
Moderne Schachprogramme haben eine Spielstärke erreicht, die nur noch von Weltmeistern übertroffen wird — und das auch nicht immer. Die zunehmende Überlegenheit der Maschine über den Menschen ist hauptsächlich...
-
Chapter and Conference Paper
Efficient Synchronization of Replicated Data in Distributed Systems
We present nsync, a tool for synchronizing large replicated data sets in distributed systems. nsync computes nearly optimal synchronization plans based on a hierarchy of gossip algorithms that take the network to...
-
Chapter and Conference Paper
Concepts and Technologies for a Worldwide Grid Infrastructure
Grid computing got much attention lately—not only from the academic world, but also from industry and business. But what remains when the dust of the many press articles has settled? We try to answer this ques...
-
Chapter and Conference Paper
A Cache Simulator for Shared Memory Systems
Due to the increasing gap between processor speed and memory access time, a large fraction of a program’s execution time is spent in accesses to the various levels in the memory hierarchy. Hence, cache-aware p...
-
Chapter and Conference Paper
Metacomputing and Grid Computing
The growing number of computers accessible through a network, such as the Internet, has meant that these computers can be collectively employed to solve complex problems. Since the networks that connect such m...
-
Chapter and Conference Paper
Clusters for Data-Intensive Applications in the Grid
Large-scale data-intensive applications like the high energy physics codes developed at Cern rely to a great extent on the ability to utilize geographically distributed computing and data-storage resources. Co...
-
Chapter and Conference Paper
Metacomputing
The basic idea about metacomputing is to utilize a variety of geographically dis- persed resources, such as computers, storage systems, data sources and special devices, which are seen by the user as a single ...
-
Chapter and Conference Paper
Resource management for high-performance PC clusters
With the recent availability of cost-effective network cards for the PCI bus, researchers have been tempted to build up large compute clusters with standard PCs. Many of them are operated with workstation clus...
-
Chapter
RSD — Resource and Service Description
RSD (Resource and Service Description) is a scheme for specifying resources and services in complex heterogeneous computing systems and metacomputing environments. At the system administrator level, RSD is use...
-
Chapter and Conference Paper
A symbolic approach to interval constraint problems
We report on a symbolic approach to solving constraint problems, which uses relation algebra. The method gives good results for problems with constraints that are relations on intervals. Problems of up to 500 ...
