Sciweavers

1136 search results - page 113 / 228
» Functional Validation in Grid Computing
Sort
View
COLCOM
2008
IEEE
15 years 8 months ago
Mashup Model and Verification Using Mashup Processing Network
Abstract. Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term...
Ehtesham Zahoor, Olivier Perrin, Claude Godart
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 9 months ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
16 years 11 days ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
IPPS
2007
IEEE
16 years 18 days ago
Incorporating Latency in Heterogeneous Graph Partitioning
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
Eric E. Aubanel, Xiaochen Wu