Sciweavers

1292 search results - page 195 / 259
» Revisiting the optimal scheduling problem
Sort
View
ICS
2007
Tsinghua U.
16 years 1 days ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Bid based scheduler with backfilling for a multiprocessor system
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
Inbal Yahav, Louiqa Raschid, Henrique Andrade
CASES
2005
ACM
15 years 7 months ago
Architectural support for real-time task scheduling in SMT processors
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
MP
2002
85views more  MP 2002»
15 years 5 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
CP
2006
Springer
15 years 9 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa