Entries For: February 2009
You can access the sources of the latest development version using the web interface at the following address :
The sources can be downloaded using the command line svn client with the following command:
svn checkout svn://scm.gforge.inria.fr/svn/xtreemos/PATH_TO_COMPONENT
XtreemOS is an open source project, released under BSD and GPL licenses (check the LICENSE file of each component for details). Developers interested in the project are encouraged to look at the source, and propose patchs, bugfix or ideas on the developers mailling list.
Handling Persistent States in Process Checkpoint/Restart Mechanisms for HPC Systems
Authors: Pierre Riteau, Adrien Lebre and Christine Morin
Computer clusters are today the reference architecture for high-performance computing.
The large number of nodes in these systems induces a high failure rate. This makes fault tolerance mechanisms, e.g. process checkpoint/restart, a required technology to effectively exploit clusters.
Most of the process checkpoint/restart implementations only handle volatile states and do not take into account persistent states of applications, which can lead to incoherent application restarts.
In this paper, we introduce an efficient persistent state checkpoint/restoration approach that can be interconnected with a large number of file systems. To avoid the performance issues of a stable support relying on synchronous replication mechanisms, we present a failure resilience scheme optimized for such persistent state checkpointing techniques in adistributed environment. First evaluations of our implementation in the kDFS distributed file system show the negligible performance impact of our proposal.
Autonomous Resource Selection for Decentralized Utility Computing
Source: Proceedings of the 29th International Conference on Distributed Computing Systems (ICDCS), June 2009.
Many large-scale utility computing infrastructures comprise heterogeneous hardware and software resources. This raises the need for scalable resource selection services, which identify resources that match application requirements, and can potentially be assigned to these applications. We present a fully decentralized resource selection algorithm by which resources autonomously select themselves when their attributes match a query. An application specifies what it expects from a resource by means of a conjunction of (attribute,value-range) pairs, which are matched against the attribute values of resources. We show that our solution scales in the number of resources as well as in the number of attributes, while being relatively insensitive to churn and other membership changes such as node failures.