Sciweavers

2057 search results - page 316 / 412
» Scalable and Structured Scheduling
Sort
View
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 7 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
IFIPPACT
1994
15 years 7 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
EUROPAR
2010
Springer
15 years 7 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
15 years 7 months ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo
ICFP
2010
ACM
15 years 6 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat