Sciweavers

1259 search results - page 52 / 252
» The load rebalancing problem
Sort
View
SC
2009
ACM
14 years 2 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...
IPPS
2007
IEEE
14 years 1 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
NOMS
2006
IEEE
14 years 1 months ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
SC
1995
ACM
13 years 11 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 5 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...