247 search results - page 16 / 50 » Optimal Preemptive Scheduling for General Target Functions |
83
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
76
Voted
HPDC
1999
IEEE
15 years 1 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
105
click to vote
SDM
2012
SIAM
12 years 12 months ago
2012
SIAM
: Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
GLVLSI
2010
IEEE
15 years 2 months ago
2010
IEEE
NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture leve...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...