International audienceIn this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without knowing the sizes of the jobs. We provide a fast algorithm (with a quadratic complexity) which can be used off-line or even on-line to compute the index tables. We also report numerous simulations providing numerical evidence of the great efficiency of our index routing policy as well as its robustness with respect to parameter changes. The value of information is also assessed by comparing the performance of indexes when the sizes of the jobs are known and when they are not known
The Grid provides access to distributed computational capabilities such as processors or storage spa...
Abstract—Markets and auctions have been proposed as mech-anisms for efficiently and fairly allocatin...
The global internet is rich in commodity resources but scarce in specialized resources. We argue tha...
International audienceIn this paper we show how dynamic brokering for batch allocation in grids base...
In this paper we show how index routing policies can be used in practice for task allocation in comp...
International audienceIn this paper we propose a new routing policy to route jobs to clusters in com...
Computational Grids are large infrastructures composed of several components such as clusters, or ma...
The Grid is a promising technology for providing access to distributed high-end computational ca...
We introduce a pricing mechanism for Grid computing, with the aim of showing how a broker can accept...
The Grid can be seen as a collection of services each of which performs some functionality. Users of...
Abstract: Despite recent advances, grid and P2P systems remain difficult for many users to bring to ...
Abstract-Computational grid comprises compute resources like PCs, clusters etc. The topology of brok...
Abstract—As Grid infrastructures become more widely used by the academic and commercial world, the p...
In this work we describe a market based approach to conduct resource allocation problems in computat...
AbstractIn this paper, we present a resource broker architecture for a computational Grid which uses...
The Grid provides access to distributed computational capabilities such as processors or storage spa...
Abstract—Markets and auctions have been proposed as mech-anisms for efficiently and fairly allocatin...
The global internet is rich in commodity resources but scarce in specialized resources. We argue tha...
International audienceIn this paper we show how dynamic brokering for batch allocation in grids base...
In this paper we show how index routing policies can be used in practice for task allocation in comp...
International audienceIn this paper we propose a new routing policy to route jobs to clusters in com...
Computational Grids are large infrastructures composed of several components such as clusters, or ma...
The Grid is a promising technology for providing access to distributed high-end computational ca...
We introduce a pricing mechanism for Grid computing, with the aim of showing how a broker can accept...
The Grid can be seen as a collection of services each of which performs some functionality. Users of...
Abstract: Despite recent advances, grid and P2P systems remain difficult for many users to bring to ...
Abstract-Computational grid comprises compute resources like PCs, clusters etc. The topology of brok...
Abstract—As Grid infrastructures become more widely used by the academic and commercial world, the p...
In this work we describe a market based approach to conduct resource allocation problems in computat...
AbstractIn this paper, we present a resource broker architecture for a computational Grid which uses...
The Grid provides access to distributed computational capabilities such as processors or storage spa...
Abstract—Markets and auctions have been proposed as mech-anisms for efficiently and fairly allocatin...
The global internet is rich in commodity resources but scarce in specialized resources. We argue tha...