800 search results - page 20 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
ISPASS
2009
IEEE
2009
IEEE
Machine learning based online performance prediction for runtime parallelization and task scheduling
14 years 2 months ago
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
JCM
2007
13 years 7 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
CCGRID
2008
IEEE
13 years 9 months ago
2008
IEEE
In the current approaches to workflow scheduling, there is no cooperation between the distributed workflow brokers and as a result, the problem of conflicting schedules occur. To o...