Sciweavers

Share
20 search results - page 1 / 4
» Decentralized Load Balancing for Highly Irregular Search Pro...
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
12 years 3 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
SC
2009
ACM
12 years 4 months ago
Scalable work stealing
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
James Dinan, D. Brian Larkins, P. Sadayappan, Srir...
IWOMP
2009
Springer
12 years 4 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
HPCC
2005
Springer
12 years 3 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
ESAW
2009
Springer
12 years 4 months ago
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
Abstract. Load-Balancing is a significant problem in heterogeneous distributed systems. There exist many load balancing algorithms, however, most approaches are very problem speci...
eva Kühn, Vesna Sesum-Cavic
books