Sciweavers

109 search results - page 18 / 22
» Convex programming for scheduling unrelated parallel machine...
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 3 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
124
Voted
IPPS
2010
IEEE
14 years 9 months ago
Structuring the execution of OpenMP applications for multicore architectures
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
François Broquedis, Olivier Aumage, Brice G...
IJPP
2010
156views more  IJPP 2010»
14 years 9 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
PLDI
1998
ACM
15 years 4 months ago
The Implementation of the Cilk-5 Multithreaded Language
The fth release of the multithreaded language Cilk uses a provably good \work-stealing" scheduling algorithm similar to the rst system, but the language has been completely r...
Matteo Frigo, Charles E. Leiserson, Keith H. Randa...
ICALP
2004
Springer
15 years 5 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella