Sciweavers

2477 search results - page 10 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 1 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
HPDC
2007
IEEE
15 years 4 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely
69
Voted
SPAA
2009
ACM
15 years 10 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
OOPSLA
2010
Springer
14 years 8 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...
ICFP
2009
ACM
15 years 10 months ago
Runtime support for multicore Haskell
Purely functional programs should run well on parallel hardware because of the absence of side effects, but it has proved hard to realise this potential in practice. Plenty of pap...
Simon Marlow, Simon L. Peyton Jones, Satnam Singh