Sciweavers

251 search results - page 42 / 51
» Dynamic Load Balancing for Parallel Modified PrefixSpan
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
HPDC
2006
IEEE
14 years 1 months ago
Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...
Changxun Wu, Randal C. Burns
HPCC
2005
Springer
14 years 1 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
IJPP
2010
156views more  IJPP 2010»
13 years 4 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
MIDDLEWARE
2007
Springer
14 years 1 months ago
Fair access to scarce resources in ad-hoc grids using an economic-based approach
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
Behnaz Pourebrahimi, Koen Bertels