Sciweavers

151 search results - page 22 / 31
» Reinventing Scheduling for Multicore Systems
Sort
View
SPAA
2010
ACM
15 years 2 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
JSSPP
2009
Springer
15 years 10 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
PPOPP
2009
ACM
16 years 4 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
JSSPP
2009
Springer
15 years 10 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...
ECRTS
2008
IEEE
15 years 10 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander