Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,814,962 papers from all fields of science
Search
Sign In
Create Free Account
Work stealing
Known as:
Work-stealing
In parallel computing, work stealing is a scheduling strategy for multithreaded computer programs. It solves the problem of executing a dynamically…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Call stack
Cilk Plus
Compiler
Continuation
Expand
Broader (2)
Parallel computing
Scheduling (computing)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Integrating Asynchronous Task Parallelism with OpenSHMEM
M. Grossman
,
Vivek Kumar
,
Zoran Budimlic
,
Vivek Sarkar
Workshop on OpenSHMEM and Related Technologies
2016
Corpus ID: 12306434
Partitioned Global Address Space (PGAS) programming models combine shared and distributed memory features, and provide a…
Expand
2015
2015
Heterogeneous work-stealing across CPU and DSP cores
Vivek Kumar
,
A. Sbîrlea
,
Ajay Jayaraj
,
Zoran Budimlic
,
Deepak Majeti
,
Vivek Sarkar
IEEE Conference on High Performance Extreme…
2015
Corpus ID: 2431932
Due to the increasing power constraints and higher and higher performance demands, many vendors have shifted their focus from…
Expand
2013
2013
Scalable Loop Self-Scheduling Schemes Implemented on Large-Scale Clusters
Yiming Han
,
Anthony T. Chronopoulos
IEEE International Symposium on Parallel…
2013
Corpus ID: 7313299
Loops are the largest source of parallelism in many scientific applications. Parallelization of irregular loop applications is a…
Expand
2011
2011
A Trust Aware Distributed and Collaborative Scheduler for Virtual Machines in Cloud
Jonathan Rouzaud-Cornabas Lifo
2011
Corpus ID: 10552231
With the number of services using virtualization and clouds growing faster and faster, it is common to mutualize thousands of…
Expand
2011
2011
Green Thieves in Work Stealing
Yu David Liu
2011
Corpus ID: 11217384
This paper proposes an energy-efficient approach for programming languages that support work stealing. The key insight is that…
Expand
2010
2010
A Simple Improvement of the Work-stealing Scheduling Algorithm
Zeljko Vrba
,
P. Halvorsen
,
C. Griwodz
Computational Intelligence in Security for…
2010
Corpus ID: 1298922
Work-stealing is todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor…
Expand
2008
2008
A Methodology for Accurate , Effective and Scalable Performance Analysis of Application Programs
J. Mellor-Crummey
,
N. Rice
2008
Corpus ID: 12780253
We describe a unique and comprehensive methodology for accurately measuring and effectively analyzing the performance of an…
Expand
2002
2002
A Scalable Multi-Strategy Algorithm for Counting Frequent Sets
S. Orlando
,
P. Palmerini
,
R. Perego
,
F. Silvestri
2002
Corpus ID: 1216092
In this paper we present DCI, a new data mining algorithm for frequent set counting. We also discuss in depth the parallelization…
Expand
2002
2002
A new clustering algorithm for large communication delays
Renaud Lepère
,
D. Trystram
Proceedings 16th International Parallel and…
2002
Corpus ID: 34990933
We are interested in studying the clustering problem in the case of large communication delays for an unbounded number of…
Expand
2000
2000
SilkRoad: a multithreaded runtime system with software distributed shared memory for SMP clusters
Liang Peng
,
W. Wong
,
M. Feng
,
C. Yuen
Proceedings IEEE International Conference on…
2000
Corpus ID: 3391332
Constructing multithreaded parallel systems with software distributed shared memory (DSM) is an attractive trend in cluster…
Expand