Sciweavers

73 search results - page 2 / 15
» Idempotent work stealing
Sort
View
ICFP
2004
ACM
14 years 5 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
SC
2009
ACM
14 years 4 days 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...
GPC
2008
Springer
13 years 6 months ago
Work Stealing Technique and Scheduling on the Critical Path
This paper is about a new framework for high performance thread scheduling based on the work stealing principle when processors may run at different speed. We also take into accou...
Christophe Cérin, Michel Koskas
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 3 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
JSSPP
2009
Springer
13 years 12 months ago
Limits of Work-Stealing Scheduling
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
Zeljko Vrba, Håvard Espeland, Pål Halv...