500 search results - page 15 / 100 » Process Scheduling for the Parallel Desktop |
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
ICPADS
2007
IEEE
14 years 3 months ago
2007
IEEE
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
JSSPP
2001
Springer
14 years 1 months ago
2001
Springer
The arrival process of jobs submitted to a parallel system is bursty, leading to fluctuations in the load at many time scales. In particular, rare events of extreme load may occu...
DAM
2008
13 years 9 months ago
2008
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...