Cyril Briquet

  • Citations Per Year
Learn More
We introduce a compact hierarchical procedural model that combines feature-based primitives to describe complex terrains with varying level of detail. Our model is inspired by skeletal implicit surfaces and defines the terrain elevation function by using a construction tree. Leaves represent terrain features and they are generic parametrized skeletal(More)
Grid computing can be defined as coordinated resource sharing and problem solving in dynamic, multiinstitutional collaborations [1]. As more Grids are deployed worldwide, the number of multi-institutional collaborations is rapidly growing. However, for Grid computing to realize its full potential, it is expected that Grid participants are able to use one(More)
Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for the closed-loop learning of mappings from images to actions. This approach requires a family of function approximators that maps visual percepts to a real-valued function. For this(More)
Scheduling Data-Intensive Bags of Tasks in P2P Grids leads to transfers of large input data files, which cause delays in completion times. We propose to combine several existing technologies and patterns to perform efficient data-aware scheduling: (1) use of the BitTorrent P2P file sharing protocol to transfer data, (2) data caching on computational(More)
Ian Foster’s What is The Grid ? paper gives the generally accepted definition of Grid and Grid computing. While sound, it does not precisely define the involved concepts, which may lead to misunderstandings. We propose a tentative set of definitions for Grid, Grid computing and related concepts such as Virtual Organization, Grid resource sharing(More)
Resource exchange between Grid participants is at the core of Grid computing. Distributed bartering is a distributed and moneyless method of resource exchange. Recent work related to distributed bartering has mainly dealt with resource supplying. However, Grid participants still face an unstable resource environment due to the partial and intermittent(More)
Dan Cohen (US Lead), George Mason University Frederick Gibbs, George Mason University Tim Hitchcock (UK Lead), University of Hertfordshire Geoffrey Rockwell (Canadian Lead), University of Alberta Jörg Sander, University of Alberta Robert Shoemaker, University of Sheffield Stéfan Sinclair, McGill University Sean Takats, George Mason University William J.(More)
P2P Grids are Grids organized into P2P networks where participant exchange computing time so as to complete computational tasks. Evaluating the performance of scheduling algorithms enables one to deploy those that are efficient. Performance is often evaluated experimentally or through simulation because these algorithms (typically heuristics) are too(More)
Lattice-Boltzmann (LB) methods are a well-known technique in the context of computational fluid dynamics. By nature, they can easily be parallelized but their adaptation to the Grid environment is not trivial due to hardware heterogeneity (CPU, memory. . . ) in a Grid. A load balancing method to dynamically handle the differences in terms of CPU number and(More)
In this paper, the deployment and execution of iterative stencil applications on a P2P grid middleware are investigated. So-called iterative stencil applications are composed of sets of heavily-communicating, long-running tasks. They thus require co-allocation of multiple reliable resources for extended periods of time. P2P grids are totally decentralized(More)