Sciweavers

1095 search results - page 123 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
HPCA
1998
IEEE
15 years 2 months ago
Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
Ye Zhang, Lawrence Rauchwerger, Josep Torrellas
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 4 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
ANOR
2008
69views more  ANOR 2008»
14 years 10 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
EUROPAR
2009
Springer
15 years 1 months ago
StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures
Abstract. In the field of HPC, the current hardware trend is to design multiprocessor architectures that feature heterogeneous technologies such as specialized coprocessors (e.g., ...
Cédric Augonnet, Samuel Thibault, Raymond N...
ICCD
2008
IEEE
133views Hardware» more  ICCD 2008»
15 years 6 months ago
Reliability-aware Dynamic Voltage Scaling for energy-constrained real-time embedded systems
— The Dynamic Voltage Scaling (DVS) technique is the basis of numerous state-of-the-art energy management schemes proposed for real-time embedded systems. However, recent researc...
Baoxian Zhao, Hakan Aydin, Dakai Zhu